Efficient Algorithms for Integer Programs with Two Variables per Constraint. - Reuven Bar-Yehuda; Dror Rawitz (Algorithmica, 2001)

Approximating Element-Weighted Vertex Deletion Problems for the Complete k-Partite Property. - Reuven Bar-Yehuda; Dror Rawitz (J. Algorithms, 2002)

Combinatorial Interpretations of Dual Fitting and Primal Fitting. - Ari Freund 001; Dror Rawitz (WAOA, 2003)

Combinatorial and LP-based methods for designing approximation algorithms. - Dror Rawitz (2003)

Local ratio: A unified framework for approxmation algrithms in memoriam: Shimon Even 1935-2004. - Reuven Bar-Yehuda; Keren Bendel; Ari Freund 001; Dror Rawitz (ACM Comput. Surv., 2004)

Local ratio with negative weights. - Reuven Bar-Yehuda; Dror Rawitz (Oper. Res. Lett., 2004)

Hitting sets when the VC-dimension is small. - Guy Even; Dror Rawitz; Shimon Shahar (Inf. Process. Lett., 2005)

The Hardness of Cache Conscious Data Placement. - Erez Petrank; Dror Rawitz (Nord. J. Comput., 2005)

On the Equivalence between the Primal-Dual Schema and the Local Ratio Technique. - Reuven Bar-Yehuda; Dror Rawitz (SIAM J. Discret. Math., 2005)

A Tale of Two Methods. - Reuven Bar-Yehuda; Dror Rawitz (Essays in Memory of Shimon Even, 2006)

Approximation Algorithms for Capacitated Rectangle Stabbing. - Guy Even; Dror Rawitz; Shimon Shahar (CIAC, 2006)

Using fractional primal-dual to schedule split intervals with demands. - Reuven Bar-Yehuda; Dror Rawitz (Discret. Optim., 2006)

Admission control with advance reservations in simple networks. - Dror Rawitz (J. Discrete Algorithms, 2007)

The Minimum Substring Cover problem. - Danny Hermelin; Dror Rawitz; Romeo Rizzi; Stéphane Vialette (Inf. Comput., 2008)

On the complexity of sequential rectangle placement in IEEE 802.16/WiMAX systems. - Amos Israeli; Dror Rawitz; Oran Sharon (Inf. Comput., 2008)

Ski rental with two general options. - Zvi Lotker; Boaz Patt-Shamir; Dror Rawitz (Inf. Process. Lett., 2008)

Improved Approximation Algorithm for Convex Recoloring of Trees. - Reuven Bar-Yehuda; Ido Feldman; Dror Rawitz (Theory Comput. Syst., 2008)

Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs. - Guy Even; Retsef Levi; Dror Rawitz; Baruch Schieber; Shimon Shahar; Maxim Sviridenko (ACM Trans. Algorithms, 2008)

Approximating the 2-interval pattern problem. - Maxime Crochemore; Danny Hermelin; Gad M. Landau; Dror Rawitz; Stéphane Vialette (Theor. Comput. Sci., 2008)

Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications. - Reuven Bar-Yehuda; Danny Hermelin; Dror Rawitz (WAOA, 2009)

Resource Allocation in Bounded Degree Trees. - Reuven Bar-Yehuda; Michael Beder; Yuval Cohen; Dror Rawitz (Algorithmica, 2009)

Time-dependent multi-scheduling of multicast. - Rami Cohen; Dror Rawitz; Danny Raz (ACM Trans. Algorithms, 2009)

Online set packing and competitive scheduling of multi-part tasks. - Yuval Emek; Magnús M. Halldórsson; Yishay Mansour; Boaz Patt-Shamir; Jaikumar Radhakrishnan; Dror Rawitz (PODC, 2010)

Approximation of Partial Capacitated Vertex Cover. - Reuven Bar-Yehuda; Guy Flysher; Julián Mestre; Dror Rawitz (SIAM J. Discret. Math., 2010)

An Extension of the Nemhauser–Trotter Theorem to Generalized Vertex Cover with Applications. - Reuven Bar-Yehuda; Danny Hermelin; Dror Rawitz (SIAM J. Discret. Math., 2010)

Optimization problems in multiple-interval graphs. - Ayelet Butman; Danny Hermelin; Moshe Lewenstein; Dror Rawitz (ACM Trans. Algorithms, 2010)

Minimum vertex cover in rectangle graphs. - Reuven Bar-Yehuda; Danny Hermelin; Dror Rawitz (Comput. Geom., 2011)

Optimization problems in multiple subtree graphs. - Danny Hermelin; Dror Rawitz (Discret. Appl. Math., 2011)

Partial multicovering and the d-consecutive ones property. - Dror Rawitz; Shimon Shahar (Discret. Optim., 2011)

Video distribution under multiple constraints. - Boaz Patt-Shamir; Dror Rawitz (Theor. Comput. Sci., 2011)

Timely Report Delivery in Social Swarming Applications. - Bin Liu 004; Peter Terlecky; Xing Xu; Amotz Bar-Noy; Ramesh Govindan; Dror Rawitz (DCOSS, 2012)

Growing Half-Balls: Minimizing Storage and Communication Costs in CDNs. - Reuven Bar-Yehuda; Erez Kantor; Shay Kutten; Dror Rawitz (ICALP (2), 2012)

Overflow management with multipart packets. - Yishay Mansour; Boaz Patt-Shamir; Dror Rawitz (Comput. Networks, 2012)

Vector bin packing with multiple-choice. - Boaz Patt-Shamir; Dror Rawitz (Discret. Appl. Math., 2012)

Capacitated Arc Stabbing. - Dror Rawitz; Shimon Shahar (J. Discrete Algorithms, 2012)

Distributed approximation of cellular coverage. - Boaz Patt-Shamir; Dror Rawitz; Gabriel Scalosub (J. Parallel Distributed Comput., 2012)

Online Set Packing. - Yuval Emek; Magnús M. Halldórsson; Yishay Mansour; Boaz Patt-Shamir; Jaikumar Radhakrishnan; Dror Rawitz (SIAM J. Comput., 2012)

Rent, Lease, or Buy: Randomized Algorithms for Multislope Ski Rental. - Zvi Lotker; Boaz Patt-Shamir; Dror Rawitz (SIAM J. Discret. Math., 2012)

Optimizing Information Credibility in Social Swarming Applications. - Bin Liu 004; Peter Terlecky; Amotz Bar-Noy; Ramesh Govindan; Michael J. Neely; Dror Rawitz (IEEE Trans. Parallel Distributed Syst., 2012)

Brief announcement: set it and forget it - approximating the set once strip cover problem. - Amotz Bar-Noy; Ben Baumer; Dror Rawitz (SPAA, 2013)

A constant factor approximation algorithm for the storage allocation problem: extended abstract. - Reuven Bar-Yehuda; Michael Beder; Dror Rawitz (SPAA, 2013)

A note on multicovering with disks. - Reuven Bar-Yehuda; Dror Rawitz (Comput. Geom., 2013)

Online Scheduling with Interval Conflicts. - Magnús M. Halldórsson; Boaz Patt-Shamir; Dror Rawitz (Theory Comput. Syst., 2013)

To Sample or To Smash? Estimating reachability in large time-varying graphs. - Prithwish Basu; Feng Yu 005; Amotz Bar-Noy; Dror Rawitz (SDM, 2014)

Should I stay or should I go? Maximizing lifetime with relays. - Peter Terlecky; Brian Phelan; Amotz Bar-Noy; Theodore Brown; Dror Rawitz (Comput. Networks, 2014)

Optimization problems in dotted interval graphs. - Danny Hermelin; Julián Mestre; Dror Rawitz (Discret. Appl. Math., 2014)

Competitive router scheduling with structured data. - Yishay Mansour; Boaz Patt-Shamir; Dror Rawitz (Theor. Comput. Sci., 2014)

Peer-Assisted Timely Report Delivery in Social Swarming Applications. - Bin Liu 004; Peter Terlecky; Xing Xu; Amotz Bar-Noy; Ramesh Govindan; Dror Rawitz (IEEE Trans. Wirel. Commun., 2014)

"Green" Barrier Coverage with Mobile Sensors. - Amotz Bar-Noy; Dror Rawitz; Peter Terlecky (CIAC, 2015)

The Price of Incorrectly Aggregating Coverage Values in Sensor Selection. - Amotz Bar-Noy; Matthew P. Johnson 001; Nooreddin Naghibolhosseini; Dror Rawitz; Simon Shamoun (DCOSS, 2015)

Bandwidth allocation in cellular networks with multiple interferences. - Reuven Bar-Yehuda; Gleb Polevoy; Dror Rawitz (Discret. Appl. Math., 2015)

Flexible Cell Selection in Cellular Networks. - Dror Rawitz; Ariella Voloshin (ALGOSENSORS, 2016)

Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems. - Pierre Fraigniaud; Magnús M. Halldórsson; Boaz Patt-Shamir; Dror Rawitz; Adi Rosén (Algorithmica, 2016)

Changing of the guards: Strip cover with duty cycling. - Amotz Bar-Noy; Ben Baumer; Dror Rawitz (Theor. Comput. Sci., 2016)

Local Search Algorithms for Maximum Carpool Matching. - Gilad Kutiel; Dror Rawitz (ESA, 2017)

Set It and Forget It: Approximating the Set Once Strip Cover Problem. - Amotz Bar-Noy; Ben Baumer; Dror Rawitz (Algorithmica, 2017)

A Constant Factor Approximation Algorithm for the Storage Allocation Problem. - Reuven Bar-Yehuda; Michael Beder; Dror Rawitz (Algorithmica, 2017)

Maximizing Barrier Coverage Lifetime with Mobile Sensors. - Amotz Bar-Noy; Dror Rawitz; Peter Terlecky (SIAM J. Discret. Math., 2017)

Local Ratio. - Dror Rawitz (Handbook of Approximation Algorithms and Metaheuristics (1), 2018)

Brief Announcement: Simple and Local Independent Set Approximation. - Ravi B. Boppana; Magnús M. Halldórsson; Dror Rawitz (PODC, 2018)

Realizability of Graph Specifications: Characterizations and Algorithms. - Amotz Bar-Noy; Keerti Choudhary; David Peleg; Dror Rawitz (SIROCCO, 2018)

Online Generalized Caching with Varying Weights and Costs. - Guy Even; Moti Medina; Dror Rawitz (SPAA, 2018)

1.5-approximation algorithm for the 2-Convex Recoloring problem. - Reuven Bar-Yehuda; Gilad Kutiel; Dror Rawitz (Discret. Appl. Math., 2018)

Flexible allocation on related machines with assignment restrictions. - Dror Rawitz; Ariella Voloshin (Discret. Appl. Math., 2018)

Distributed backup placement in networks. - Magnús M. Halldórsson; Sven Köhler 001; Boaz Patt-Shamir; Dror Rawitz (Distributed Comput., 2018)

Growing Half-Balls: Minimizing Storage and Communication Costs in Content Delivery Networks. - Reuven Bar-Yehuda; Erez Kantor; Shay Kutten; Dror Rawitz (SIAM J. Discret. Math., 2018)

Graph Profile Realizations and Applications to Social Networks. - Amotz Bar-Noy; Keerti Choudhary; David Peleg; Dror Rawitz (WALCOM, 2019)

Graph Realizations: Maximum and Minimum Degree in Vertex Neighborhoods. - Amotz Bar-Noy; Keerti Choudhary; David Peleg; Dror Rawitz (CoRR, 2019)

Service chain placement in SDNs. - Gilad Kutiel; Dror Rawitz (Discret. Appl. Math., 2019)

Distributed approximation of k-service assignment. - Magnús M. Halldórsson; Sven Köhler 001; Dror Rawitz (Distributed Comput., 2019)

Minimum Neighboring Degree Realization in Graphs and Trees. - Amotz Bar-Noy; Keerti Choudhary; Avi Cohen; David Peleg; Dror Rawitz (ESA, 2020)

Local Search Algorithms for the Maximum Carpool Matching Problem. - Gilad Kutiel; Dror Rawitz (Algorithmica, 2020)

Efficiently Realizing Interval Sequences. - Amotz Bar-Noy; Keerti Choudhary; David Peleg; Dror Rawitz (SIAM J. Discret. Math., 2020)

Vertex-weighted realizations of graphs. - Amotz Bar-Noy; David Peleg; Dror Rawitz (Theor. Comput. Sci., 2020)

Simple and local independent set approximation. - Ravi B. Boppana; Magnús M. Halldórsson; Dror Rawitz (Theor. Comput. Sci., 2020)

On Vertex-Weighted Graph Realizations. - Amotz Bar-Noy; Toni Böhnlein; David Peleg; Dror Rawitz (CIAC, 2021)

Selected Neighbor Degree Forest Realization. - Amotz Bar-Noy; David Peleg; Dror Rawitz; Elad Yehezkel (ISAAC, 2021)

Relaxed and Approximate Graph Realizations. - Amotz Bar-Noy; Toni Böhnlein; David Peleg; Mor Perry; Dror Rawitz (IWOCA, 2021)

Containers Resource Allocation in Dynamic Cloud Environments. - Oren Katz; Dror Rawitz; Danny Raz (Networking, 2021)

Online Budgeted Maximum Coverage. - Dror Rawitz; Adi Rosén (Algorithmica, 2021)

"Green" barrier coverage with mobile sensors. - Amotz Bar-Noy; Thomas Erlebach; Dror Rawitz; Peter Terlecky (Theor. Comput. Sci., 2021)

On the Role of the High-Low Partition in Realizing a Degree Sequence by a Bipartite Graph. - Amotz Bar-Noy; Toni Böhnlein; David Peleg; Dror Rawitz (MFCS, 2022)

Randomized Strategies for Non-additive 3-Slope Ski Rental. - Toni Böhnlein; Sapir Erlich; Zvi Lotker; Dror Rawitz (SIROCCO, 2022)

On Realizing a Single Degree Sequence by a Bipartite Graph (Invited Paper). - Amotz Bar-Noy; Toni Böhnlein; David Peleg; Dror Rawitz (SWAT, 2022)

Vertex-Weighted Graphs: Realizable and Unrealizable Domains. - Amotz Bar-Noy; Toni Böhnlein; David Peleg; Dror Rawitz (WALCOM, 2022)

The generalized microscopic image reconstruction problem. - Amotz Bar-Noy; Toni Böhnlein; Zvi Lotker; David Peleg; Dror Rawitz (Discret. Appl. Math., 2022)

Maximizing barrier coverage lifetime with static sensors. - Menachem Poss; Dror Rawitz (J. Sched., 2022)

On vertex-weighted realizations of acyclic and general graphs. - Amotz Bar-Noy; Toni Böhnlein; David Peleg; Dror Rawitz (Theor. Comput. Sci., 2022)

Degree Realization by Bipartite Multigraphs. - Amotz Bar-Noy; Toni Böhnlein; David Peleg; Dror Rawitz (SIROCCO, 2023)

Overflow management with self-eliminations. - Assaf Rabinowitz; Dror Rawitz (Theor. Comput. Sci., 2023)

Composed Degree-Distance Realizations of Graphs. - Amotz Bar-Noy; David Peleg; Mor Perry; Dror Rawitz (Algorithmica, 2023)

Forcibly bipartite and acyclic (uni-)graphic sequences. - Amotz Bar-Noy; Toni Böhnlein; David Peleg; Dror Rawitz (Discret. Math., 2023)

Graph realizations: Maximum degree in vertex neighborhoods. - Amotz Bar-Noy; Keerti Choudhary; David Peleg; Dror Rawitz (Discret. Math., 2023)

On Key Parameters Affecting the Realizability of Degree Sequences (Invited Paper). - Amotz Bar-Noy; Toni Böhnlein; David Peleg; Yingli Ran; Dror Rawitz (MFCS, 2024)

Sparse Graphic Degree Sequences Have Planar Realizations. - Amotz Bar-Noy; Toni Böhnlein; David Peleg; Yingli Ran; Dror Rawitz (MFCS, 2024)

Graph realization of distance sets. - Amotz Bar-Noy; David Peleg; Mor Perry; Dror Rawitz (Theor. Comput. Sci., 2024)

Weighted microscopic image reconstruction. - Amotz Bar-Noy; Toni Böhnlein; Zvi Lotker; David Peleg; Dror Rawitz (Discret. Appl. Math., 2024)

Online Multiset Submodular Cover. - Magnús M. Halldórsson; Dror Rawitz (Algorithmica, 2024)

Degree Realization by Bipartite Cactus Graphs. - Amotz Bar-Noy; Toni Böhnlein; David Peleg; Yingli Ran; Dror Rawitz (CIAC (1), 2025)

Distributed fractional local ratio and independent set approximation. - Magnús M. Halldórsson; Dror Rawitz (Inf. Comput., 2025)

Approximate realizations for outerplanaric degree sequences. - Amotz Bar-Noy; Toni Böhnlein; David Peleg; Yingli Ran; Dror Rawitz (J. Comput. Syst. Sci., 2025)

On Bipartite Graph Realizations of a Single Degree Sequence. - Amotz Bar-Noy; Toni Böhnlein; David Peleg; Dror Rawitz (SIAM J. Discret. Math., 2025)