default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDror Rawitz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j67]Magnús M. Halldórsson
, Dror Rawitz:
Distributed fractional local ratio and independent set approximation. Inf. Comput. 303: 105238 (2025)- [j66]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran, Dror Rawitz:
Approximate realizations for outerplanaric degree sequences. J. Comput. Syst. Sci. 148: 103588 (2025) - 2024
- [j65]Magnús M. Halldórsson, Dror Rawitz:
Online Multiset Submodular Cover. Algorithmica 86(7): 2393-2411 (2024) - [j64]Amotz Bar-Noy, Toni Böhnlein, Zvi Lotker, David Peleg, Dror Rawitz:
Weighted microscopic image reconstruction. Discret. Appl. Math. 345: 17-33 (2024) - [j63]Amotz Bar-Noy, David Peleg, Mor Perry, Dror Rawitz:
Graph realization of distance sets. Theor. Comput. Sci. 1019: 114810 (2024) - [c72]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran, Dror Rawitz:
Approximate Realizations for Outerplanaric Degree Sequences. IWOCA 2024: 98-110 - [c71]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran, Dror Rawitz:
On Key Parameters Affecting the Realizability of Degree Sequences (Invited Paper). MFCS 2024: 1:1-1:16 - [c70]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran, Dror Rawitz:
Sparse Graphic Degree Sequences Have Planar Realizations. MFCS 2024: 18:1-18:17 - [c69]Magnús M. Halldórsson, Dror Rawitz:
Distributed Fractional Local Ratio and Independent Set Approximation. SIROCCO 2024: 281-299 - [i9]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran, Dror Rawitz:
Approximate Realizations for Outerplanaric Degree Sequences. CoRR abs/2405.03278 (2024) - 2023
- [j62]Amotz Bar-Noy, David Peleg, Mor Perry, Dror Rawitz:
Composed Degree-Distance Realizations of Graphs. Algorithmica 85(3): 665-687 (2023) - [j61]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz:
Forcibly bipartite and acyclic (uni-)graphic sequences. Discret. Math. 346(7): 113460 (2023) - [j60]Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz:
Graph realizations: Maximum degree in vertex neighborhoods. Discret. Math. 346(9): 113483 (2023) - [j59]Assaf Rabinowitz, Dror Rawitz:
Overflow management with self-eliminations. Theor. Comput. Sci. 948: 113732 (2023) - [c68]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz:
Degree Realization by Bipartite Multigraphs. SIROCCO 2023: 3-17 - 2022
- [j58]Amotz Bar-Noy, Toni Böhnlein, Zvi Lotker, David Peleg, Dror Rawitz:
The generalized microscopic image reconstruction problem. Discret. Appl. Math. 321: 402-416 (2022) - [j57]Menachem Poss, Dror Rawitz:
Maximizing barrier coverage lifetime with static sensors. J. Sched. 25(5): 535-545 (2022) - [j56]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz:
On vertex-weighted realizations of acyclic and general graphs. Theor. Comput. Sci. 922: 81-95 (2022) - [c67]Amotz Bar-Noy, David Peleg, Mor Perry, Dror Rawitz:
Graph Realization of Distance Sets. MFCS 2022: 13:1-13:14 - [c66]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz:
On the Role of the High-Low Partition in Realizing a Degree Sequence by a Bipartite Graph. MFCS 2022: 14:1-14:15 - [c65]Toni Böhnlein, Sapir Erlich, Zvi Lotker, Dror Rawitz:
Randomized Strategies for Non-additive 3-Slope Ski Rental. SIROCCO 2022: 62-78 - [c64]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz:
On Realizing a Single Degree Sequence by a Bipartite Graph (Invited Paper). SWAT 2022: 1:1-1:17 - [c63]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz:
Vertex-Weighted Graphs: Realizable and Unrealizable Domains. WALCOM 2022: 315-327 - 2021
- [j55]Dror Rawitz, Adi Rosén:
Online Budgeted Maximum Coverage. Algorithmica 83(9): 2989-3014 (2021) - [j54]Amotz Bar-Noy, Thomas Erlebach, Dror Rawitz, Peter Terlecky:
"Green" barrier coverage with mobile sensors. Theor. Comput. Sci. 860: 117-134 (2021) - [c62]Assaf Rabinowitz, Dror Rawitz:
Overflow Management with Self-eliminations. ALGOSENSORS 2021: 124-139 - [c61]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz:
On Vertex-Weighted Graph Realizations. CIAC 2021: 90-102 - [c60]Amotz Bar-Noy, David Peleg, Dror Rawitz, Elad Yehezkel:
Selected Neighbor Degree Forest Realization. ISAAC 2021: 27:1-27:15 - [c59]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Mor Perry, Dror Rawitz:
Relaxed and Approximate Graph Realizations. IWOCA 2021: 3-19 - [c58]Amotz Bar-Noy, David Peleg, Mor Perry, Dror Rawitz:
Composed Degree-Distance Realizations of Graphs. IWOCA 2021: 63-77 - [c57]Oren Katz, Dror Rawitz, Danny Raz:
Containers Resource Allocation in Dynamic Cloud Environments. Networking 2021: 1-9 - [c56]Amotz Bar-Noy, Toni Böhnlein, Zvi Lotker, David Peleg, Dror Rawitz:
Weighted Microscopic Image Reconstruction. SOFSEM 2021: 373-386 - 2020
- [j53]Gilad Kutiel, Dror Rawitz:
Local Search Algorithms for the Maximum Carpool Matching Problem. Algorithmica 82(11): 3165-3182 (2020) - [j52]Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz:
Efficiently Realizing Interval Sequences. SIAM J. Discret. Math. 34(4): 2318-2337 (2020) - [j51]Amotz Bar-Noy, David Peleg, Dror Rawitz:
Vertex-weighted realizations of graphs. Theor. Comput. Sci. 807: 56-72 (2020) - [j50]Ravi B. Boppana, Magnús M. Halldórsson, Dror Rawitz:
Simple and local independent set approximation. Theor. Comput. Sci. 846: 27-37 (2020) - [c55]Amotz Bar-Noy, Keerti Choudhary, Avi Cohen, David Peleg, Dror Rawitz:
Minimum Neighboring Degree Realization in Graphs and Trees. ESA 2020: 10:1-10:15 - [c54]Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz:
Graph Realizations: Maximum Degree in Vertex Neighborhoods. SWAT 2020: 10:1-10:17
2010 – 2019
- 2019
- [j49]Gilad Kutiel, Dror Rawitz:
Service chain placement in SDNs. Discret. Appl. Math. 270: 168-180 (2019) - [j48]Magnús M. Halldórsson, Sven Köhler, Dror Rawitz:
Distributed approximation of k-service assignment. Distributed Comput. 32(1): 27-40 (2019) - [c53]Amotz Bar-Noy, Toni Böhnlein, Zvi Lotker, David Peleg, Dror Rawitz:
The Generalized Microscopic Image Reconstruction Problem. ISAAC 2019: 42:1-42:15 - [c52]Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz:
Efficiently Realizing Interval Sequences. ISAAC 2019: 47:1-47:15 - [c51]Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz:
Graph Profile Realizations and Applications to Social Networks. WALCOM 2019: 3-14 - [i8]Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz:
Graph Realizations: Maximum and Minimum Degree in Vertex Neighborhoods. CoRR abs/1912.13286 (2019) - [i7]Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz:
Efficiently Realizing Interval Sequences. CoRR abs/1912.13287 (2019) - 2018
- [j47]Reuven Bar-Yehuda, Gilad Kutiel, Dror Rawitz:
1.5-approximation algorithm for the 2-Convex Recoloring problem. Discret. Appl. Math. 246: 2-11 (2018) - [j46]Dror Rawitz, Ariella Voloshin:
Flexible allocation on related machines with assignment restrictions. Discret. Appl. Math. 250: 309-321 (2018) - [j45]Magnús M. Halldórsson, Sven Köhler, Boaz Patt-Shamir, Dror Rawitz:
Distributed backup placement in networks. Distributed Comput. 31(2): 83-98 (2018) - [j44]Reuven Bar-Yehuda, Erez Kantor, Shay Kutten, Dror Rawitz:
Growing Half-Balls: Minimizing Storage and Communication Costs in Content Delivery Networks. SIAM J. Discret. Math. 32(3): 1903-1921 (2018) - [c50]Ravi B. Boppana, Magnús M. Halldórsson, Dror Rawitz:
Brief Announcement: Simple and Local Independent Set Approximation. PODC 2018: 163-165 - [c49]Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz:
Realizability of Graph Specifications: Characterizations and Algorithms. SIROCCO 2018: 3-13 - [c48]Ravi B. Boppana, Magnús M. Halldórsson, Dror Rawitz:
Simple and Local Independent Set Approximation. SIROCCO 2018: 88-101 - [c47]Guy Even, Moti Medina, Dror Rawitz:
Online Generalized Caching with Varying Weights and Costs. SPAA 2018: 205-212 - [p1]Dror Rawitz:
Local Ratio. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 87-111 - [i6]Ravi B. Boppana, Magnús M. Halldórsson, Dror Rawitz:
Simple and Local Independent Set Approximation. CoRR abs/1803.00786 (2018) - 2017
- [j43]Reuven Bar-Yehuda, Michael Beder, Dror Rawitz:
A Constant Factor Approximation Algorithm for the Storage Allocation Problem. Algorithmica 77(4): 1105-1127 (2017) - [j42]Amotz Bar-Noy, Ben Baumer, Dror Rawitz:
Set It and Forget It: Approximating the Set Once Strip Cover Problem. Algorithmica 79(2): 368-386 (2017) - [j41]Amotz Bar-Noy, Dror Rawitz, Peter Terlecky:
Maximizing Barrier Coverage Lifetime with Mobile Sensors. SIAM J. Discret. Math. 31(1): 573-596 (2017) - [c46]Gilad Kutiel, Dror Rawitz:
Service Chain Placement in SDNs. ALGOCLOUD 2017: 27-40 - [c45]Menachem Poss, Dror Rawitz:
Maximizing Barrier Coverage Lifetime with Static Sensors. ALGOSENSORS 2017: 198-210 - [c44]Gilad Kutiel, Dror Rawitz:
Local Search Algorithms for Maximum Carpool Matching. ESA 2017: 55:1-55:14 - 2016
- [j40]Pierre Fraigniaud, Magnús M. Halldórsson, Boaz Patt-Shamir, Dror Rawitz, Adi Rosén:
Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems. Algorithmica 74(4): 1205-1223 (2016) - [j39]Amotz Bar-Noy, Ben Baumer, Dror Rawitz:
Changing of the guards: Strip cover with duty cycling. Theor. Comput. Sci. 610: 135-148 (2016) - [c43]Dror Rawitz, Ariella Voloshin:
Flexible Cell Selection in Cellular Networks. ALGOSENSORS 2016: 112-128 - [c42]Dror Rawitz, Adi Rosén:
Online Budgeted Maximum Coverage. ESA 2016: 73:1-73:17 - 2015
- [j38]Reuven Bar-Yehuda, Gleb Polevoy, Dror Rawitz:
Bandwidth allocation in cellular networks with multiple interferences. Discret. Appl. Math. 194: 23-36 (2015) - [c41]Amotz Bar-Noy, Dror Rawitz, Peter Terlecky:
"Green" Barrier Coverage with Mobile Sensors. CIAC 2015: 33-46 - [c40]Amotz Bar-Noy, Matthew P. Johnson, Nooreddin Naghibolhosseini, Dror Rawitz, Simon Shamoun:
The Price of Incorrectly Aggregating Coverage Values in Sensor Selection. DCOSS 2015: 98-107 - [c39]Reuven Bar-Yehuda, Gilad Kutiel, Dror Rawitz:
1.5-Approximation Algorithm for the 2-Convex Recoloring Problem. IWOCA 2015: 299-311 - [c38]Magnús M. Halldórsson, Sven Köhler, Dror Rawitz:
Distributed Approximation of k-Service Assignment. OPODIS 2015: 11:1-11:16 - [c37]Magnús M. Halldórsson, Sven Köhler, Boaz Patt-Shamir, Dror Rawitz:
Distributed Backup Placement in Networks. SPAA 2015: 274-283 - 2014
- [j37]Peter Terlecky, Brian Phelan, Amotz Bar-Noy, Theodore Brown, Dror Rawitz:
Should I stay or should I go? Maximizing lifetime with relays. Comput. Networks 70: 210-224 (2014) - [j36]Danny Hermelin, Julián Mestre, Dror Rawitz:
Optimization problems in dotted interval graphs. Discret. Appl. Math. 174: 66-72 (2014) - [j35]Yishay Mansour, Boaz Patt-Shamir, Dror Rawitz:
Competitive router scheduling with structured data. Theor. Comput. Sci. 530: 12-22 (2014) - [j34]Bin Liu, Peter Terlecky, Xing Xu, Amotz Bar-Noy, Ramesh Govindan, Dror Rawitz:
Peer-Assisted Timely Report Delivery in Social Swarming Applications. IEEE Trans. Wirel. Commun. 13(10): 5826-5838 (2014) - [c36]Prithwish Basu, Feng Yu, Amotz Bar-Noy, Dror Rawitz:
To Sample or To Smash? Estimating reachability in large time-varying graphs. SDM 2014: 983-991 - 2013
- [j33]Reuven Bar-Yehuda, Dror Rawitz:
A note on multicovering with disks. Comput. Geom. 46(3): 394-399 (2013) - [j32]Magnús M. Halldórsson, Boaz Patt-Shamir, Dror Rawitz:
Online Scheduling with Interval Conflicts. Theory Comput. Syst. 53(2): 300-317 (2013) - [c35]Pierre Fraigniaud, Magnús M. Halldórsson, Boaz Patt-Shamir, Dror Rawitz, Adi Rosén:
Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems. APPROX-RANDOM 2013: 158-172 - [c34]Amotz Bar-Noy, Dror Rawitz, Peter Terlecky:
Maximizing Barrier Coverage Lifetime with Mobile Sensors. ESA 2013: 97-108 - [c33]Amotz Bar-Noy, Ben Baumer, Dror Rawitz:
Brief announcement: set it and forget it - approximating the set once strip cover problem. SPAA 2013: 105-107 - [c32]Reuven Bar-Yehuda, Michael Beder, Dror Rawitz:
A constant factor approximation algorithm for the storage allocation problem: extended abstract. SPAA 2013: 204-213 - [i5]Amotz Bar-Noy, Dror Rawitz, Peter Terlecky:
Maximizing Barrier Coverage Lifetime with Mobile Sensors. CoRR abs/1304.6358 (2013) - 2012
- [j31]Yishay Mansour, Boaz Patt-Shamir, Dror Rawitz:
Overflow management with multipart packets. Comput. Networks 56(15): 3456-3467 (2012) - [j30]Boaz Patt-Shamir, Dror Rawitz:
Vector bin packing with multiple-choice. Discret. Appl. Math. 160(10-11): 1591-1600 (2012) - [j29]Dror Rawitz, Shimon Shahar:
Capacitated Arc Stabbing. J. Discrete Algorithms 17: 86-94 (2012) - [j28]Boaz Patt-Shamir, Dror Rawitz, Gabriel Scalosub:
Distributed approximation of cellular coverage. J. Parallel Distributed Comput. 72(3): 402-408 (2012) - [j27]Yuval Emek, Magnús M. Halldórsson, Yishay Mansour, Boaz Patt-Shamir, Jaikumar Radhakrishnan, Dror Rawitz:
Online Set Packing. SIAM J. Comput. 41(4): 728-746 (2012) - [j26]Zvi Lotker, Boaz Patt-Shamir, Dror Rawitz:
Rent, Lease, or Buy: Randomized Algorithms for Multislope Ski Rental. SIAM J. Discret. Math. 26(2): 718-736 (2012) - [j25]Bin Liu, Peter Terlecky, Amotz Bar-Noy, Ramesh Govindan, Michael J. Neely, Dror Rawitz:
Optimizing Information Credibility in Social Swarming Applications. IEEE Trans. Parallel Distributed Syst. 23(6): 1147-1158 (2012) - [c31]Brian Phelan, Peter Terlecky, Amotz Bar-Noy, Theodore Brown, Dror Rawitz:
Should I Stay or Should I Go? Maximizing Lifetime with Relays. DCOSS 2012: 1-8 - [c30]Bin Liu, Peter Terlecky, Xing Xu, Amotz Bar-Noy, Ramesh Govindan, Dror Rawitz:
Timely Report Delivery in Social Swarming Applications. DCOSS 2012: 75-82 - [c29]Reuven Bar-Yehuda, Erez Kantor, Shay Kutten, Dror Rawitz:
Growing Half-Balls: Minimizing Storage and Communication Costs in CDNs. ICALP (2) 2012: 416-427 - [c28]Amotz Bar-Noy, Ben Baumer, Dror Rawitz:
Changing of the Guards: Strip Cover with Duty Cycling. SIROCCO 2012: 36-47 - [c27]Danny Hermelin, Julián Mestre, Dror Rawitz:
Optimization Problems in Dotted Interval Graphs. WG 2012: 46-56 - [e1]Guy Even, Dror Rawitz:
Design and Analysis of Algorithms - First Mediterranean Conference on Algorithms, MedAlg 2012, Kibbutz Ein Gedi, Israel, December 3-5, 2012. Proceedings. Lecture Notes in Computer Science 7659, Springer 2012, ISBN 978-3-642-34861-7 [contents] - [i4]Amotz Bar-Noy, Ben Baumer, Dror Rawitz:
Set It and Forget It: Approximating the Set Once Strip Cover Problem. CoRR abs/1204.1082 (2012) - 2011
- [j24]Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz:
Minimum vertex cover in rectangle graphs. Comput. Geom. 44(6-7): 356-364 (2011) - [j23]Danny Hermelin, Dror Rawitz:
Optimization problems in multiple subtree graphs. Discret. Appl. Math. 159(7): 588-594 (2011) - [j22]Dror Rawitz, Shimon Shahar:
Partial multicovering and the d-consecutive ones property. Discret. Optim. 8(4): 555-567 (2011) - [j21]Boaz Patt-Shamir, Dror Rawitz:
Video distribution under multiple constraints. Theor. Comput. Sci. 412(29): 3717-3730 (2011) - [c26]Yishay Mansour, Boaz Patt-Shamir, Dror Rawitz:
Overflow management with multipart packets. INFOCOM 2011: 2606-2614 - [c25]Magnús M. Halldórsson, Boaz Patt-Shamir, Dror Rawitz:
Online Scheduling with Interval Conflicts. STACS 2011: 472-483 - [c24]Yishay Mansour, Boaz Patt-Shamir, Dror Rawitz:
Competitive Router Scheduling with Structured Data. WAOA 2011: 219-232 - 2010
- [j20]Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz:
An Extension of the Nemhauser--Trotter Theorem to Generalized Vertex Cover with Applications. SIAM J. Discret. Math. 24(1): 287-300 (2010) - [j19]Reuven Bar-Yehuda, Guy Flysher, Julián Mestre, Dror Rawitz:
Approximation of Partial Capacitated Vertex Cover. SIAM J. Discret. Math. 24(4): 1441-1469 (2010) - [j18]Ayelet Butman, Danny Hermelin, Moshe Lewenstein, Dror Rawitz:
Optimization problems in multiple-interval graphs. ACM Trans. Algorithms 6(2): 40:1-40:18 (2010) - [c23]Reuven Bar-Yehuda, Gleb Polevoy, Dror Rawitz:
Bandwidth allocation in cellular networks with multiple interferences. DIALM-PODC 2010: 33-42 - [c22]Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz:
Minimum Vertex Cover in Rectangle Graphs. ESA (1) 2010: 255-266 - [c21]Yuval Emek, Magnús M. Halldórsson, Yishay Mansour, Boaz Patt-Shamir, Jaikumar Radhakrishnan, Dror Rawitz:
Online set packing and competitive scheduling of multi-part tasks. PODC 2010: 440-449 - [c20]Boaz Patt-Shamir, Dror Rawitz:
Vector Bin Packing with Multiple-Choice. SWAT 2010: 248-259 - [i3]Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz:
Minimum Vertex Cover in Rectangle Graphs. CoRR abs/1001.3332 (2010)
2000 – 2009
- 2009
- [j17]Reuven Bar-Yehuda, Michael Beder, Yuval Cohen, Dror Rawitz:
Resource Allocation in Bounded Degree Trees. Algorithmica 54(1): 89-106 (2009) - [j16]Rami Cohen, Dror Rawitz, Danny Raz:
Time-dependent multi-scheduling of multicast. ACM Trans. Algorithms 6(1): 14:1-14:22 (2009) - [c19]Reuven Bar-Yehuda, Danny Hermelin, Dror Rawitz:
Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications. WAOA 2009: 13-24 - [c18]Danny Hermelin, Dror Rawitz:
Optimization Problems in Multiple Subtree Graphs. WAOA 2009: 194-204 - [i2]Boaz Patt-Shamir, Dror Rawitz:
Vector Bin Packing with Multiple-Choice. CoRR abs/0910.5599 (2009) - 2008
- [j15]Danny Hermelin, Dror Rawitz, Romeo Rizzi, Stéphane Vialette:
The Minimum Substring Cover problem. Inf. Comput. 206(11): 1303-1312 (2008) - [j14]Amos Israeli, Dror Rawitz, Oran Sharon:
On the complexity of sequential rectangle placement in IEEE 802.16/WiMAX systems. Inf. Comput. 206(11): 1334-1345 (2008) - [j13]Zvi Lotker, Boaz Patt-Shamir, Dror Rawitz:
Ski rental with two general options. Inf. Process. Lett. 108(6): 365-368 (2008) - [j12]Reuven Bar-Yehuda, Ido Feldman, Dror Rawitz:
Improved Approximation Algorithm for Convex Recoloring of Trees. Theory Comput. Syst. 43(1): 3-18 (2008) - [j11]Guy Even, Retsef Levi, Dror Rawitz, Baruch Schieber, Shimon Shahar, Maxim Sviridenko:
Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs. ACM Trans. Algorithms 4(3): 34:1-34:17 (2008) - [j10]Maxime Crochemore, Danny Hermelin, Gad M. Landau, Dror Rawitz, Stéphane Vialette:
Approximating the 2-interval pattern problem. Theor. Comput. Sci. 395(2-3): 283-297 (2008) - [c17]Boaz Patt-Shamir, Dror Rawitz:
Video Distribution Under Multiple Constraints. ICDCS 2008: 841-848 - [c16]Boaz Patt-Shamir, Dror Rawitz, Gabriel Scalosub:
Distributed Approximation of Cellular Coverage. OPODIS 2008: 331-345 - [c15]Zvi Lotker, Boaz Patt-Shamir, Dror Rawitz:
Rent, Lease or Buy: Randomized Algorithms for Multislope Ski Rental. STACS 2008: 503-514 - [i1]Zvi Lotker, Boaz Patt-Shamir, Dror Rawitz:
Rent, Lease or Buy: Randomized Algorithms for Multislope Ski Rental. CoRR abs/0802.2832 (2008) - 2007
- [j9]Dror Rawitz:
Admission control with advance reservations in simple networks. J. Discrete Algorithms 5(3): 491-500 (2007) - [c14]Reuven Bar-Yehuda, Guy Flysher, Julián Mestre, Dror Rawitz:
Approximation of Partial Capacitated Vertex Cover. ESA 2007: 335-346 - [c13]Amos Israeli, Dror Rawitz, Oran Sharon:
On the Complexity of Sequential Rectangle Placement in IEEE 802.16/WiMAX Systems. ESA 2007: 570-581 - [c12]Ayelet Butman, Danny Hermelin, Moshe Lewenstein, Dror Rawitz:
Optimization problems in multiple-interval graphs. SODA 2007: 268-277 - [c11]Danny Hermelin, Dror Rawitz, Romeo Rizzi, Stéphane Vialette:
The Minimum Substring Cover Problem. WAOA 2007: 170-183 - 2006
- [j8]Reuven Bar-Yehuda, Dror Rawitz:
Using fractional primal-dual to schedule split intervals with demands. Discret. Optim. 3(4): 275-287 (2006) - [c10]Reuven Bar-Yehuda, Dror Rawitz:
A Tale of Two Methods. Essays in Memory of Shimon Even 2006: 196-217 - [c9]Guy Even, Dror Rawitz, Shimon Shahar:
Approximation Algorithms for Capacitated Rectangle Stabbing. CIAC 2006: 18-29 - [c8]Reuven Bar-Yehuda, Michael Beder, Yuval Cohen, Dror Rawitz:
Resource Allocation in Bounded Degree Trees. ESA 2006: 64-75 - 2005
- [j7]Guy Even, Dror Rawitz, Shimon Shahar:
Hitting sets when the VC-dimension is small. Inf. Process. Lett. 95(2): 358-362 (2005) - [j6]Erez Petrank, Dror Rawitz:
The Hardness of Cache Conscious Data Placement. Nord. J. Comput. 12(3): 275-307 (2005) - [j5]Reuven Bar-Yehuda, Dror Rawitz:
On the Equivalence between the Primal-Dual Schema and the Local Ratio Technique. SIAM J. Discret. Math. 19(3): 762-797 (2005) - [c7]Reuven Bar-Yehuda, Dror Rawitz:
Using Fractional Primal-Dual to Schedule Split Intervals with Demands. ESA 2005: 714-725 - [c6]Reuven Bar-Yehuda, Ido Feldman, Dror Rawitz:
Improved Approximation Algorithm for Convex Recoloring of Trees. WAOA 2005: 55-68 - 2004
- [j4]Reuven Bar-Yehuda, Keren Bendel, Ari Freund, Dror Rawitz:
Local ratio: A unified framework for approxmation algrithms in memoriam: Shimon Even 1935-2004. ACM Comput. Surv. 36(4): 422-463 (2004) - [j3]Reuven Bar-Yehuda, Dror Rawitz:
Local ratio with negative weights. Oper. Res. Lett. 32(6): 540-546 (2004) - [c5]Rami Cohen, Dror Rawitz, Danny Raz:
Time Dependent Multi Scheduling of Multicast. ESA 2004: 216-227 - 2003
- [b1]Dror Rawitz:
Combinatorial and LP-based methods for designing approximation algorithms. Technion - Israel Institute of Technology, Israel, 2003 - [c4]Ari Freund, Dror Rawitz:
Combinatorial Interpretations of Dual Fitting and Primal Fitting. WAOA 2003: 137-150 - 2002
- [j2]Reuven Bar-Yehuda, Dror Rawitz:
Approximating Element-Weighted Vertex Deletion Problems for the Complete k-Partite Property. J. Algorithms 42(1): 20-40 (2002) - [c3]Erez Petrank, Dror Rawitz:
The hardness of cache conscious data placement. POPL 2002: 101-112 - 2001
- [j1]Reuven Bar-Yehuda, Dror Rawitz:
Efficient Algorithms for Integer Programs with Two Variables per Constraint. Algorithmica 29(4): 595-609 (2001) - [c2]Reuven Bar-Yehuda, Dror Rawitz:
On the Equivalence between the Primal-Dual Schema and the Local-Ratio Technique. RANDOM-APPROX 2001: 24-35
1990 – 1999
- 1999
- [c1]Reuven Bar-Yehuda, Dror Rawitz:
Efficient Algorithms for Integer Programs with Two Variables per Constraint. ESA 1999: 116-126
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 19:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
