Skip to main content

All Publications

2026

Bar-Noy, Amotz ; Peleg, David ; Perry, Mor et al. / Minimum Deviation Distance Realization. Structural Information and Communication Complexity - 33rd International Colloquium, SIROCCO 2026, Proceedings. עורך / Chryssis Georgiou. Springer Science and Business Media Deutschland GmbH, 2026. עמודים 73-92 (Lecture Notes in Computer Science).
Bar-Noy, Amotz ; Böhnlein, Toni ; Peleg, David et al. / Sparse Graphic Degree Sequences Have Planar Realizations. ב-: Journal of Graph Theory. 2026.
Bar-Noy, Amotz ; Kalinichev, Igor ; Peleg, David et al. / Degree Realization with Maximum Matching. Combinatorial Algorithms - 37th International Workshop, IWOCA 2026, Proceedings. עורך / Florent Foucaud ; Aline Parreau. Springer Science and Business Media Deutschland GmbH, 2026. עמודים 103-117 (Lecture Notes in Computer Science).
Bar-Noy, Amotz ; Böhnlein, Toni ; Peleg, David et al. / Degree Realization by Bipartite Cactus Graphs. ב-: Journal of Graph Algorithms and Applications. 2026 ; כרך 30, מס' 1. עמודים 65-87.
Bar-Noy, Amotz ; Kalinichev, Igor ; Peleg, David et al. / Degree Realization with Minimum Dominating Set. Integer Programming and Combinatorial Optimization - 27th International Conference, IPCO 2026, Proceedings. עורך / Santanu S. Dey ; Marco Di Summa ; Domenico Salvagnin. Springer Science and Business Media Deutschland GmbH, 2026. עמודים 64-80 (Lecture Notes in Computer Science).
Bar-Noy, Amotz ; Böhnlein, Toni ; Peleg, David et al. / Degree Realization by Bipartite Multigraphs. ב-: Discrete Mathematics and Theoretical Computer Science. 2026 ; כרך 28, מס' 2.

2025

Bar-Noy, Amotz ; Bohnlein, Toni ; Peleg, David et al. / ON BIPARTITE GRAPH REALIZATIONS OF A SINGLE DEGREE SEQUENCE. ב-: SIAM Journal on Discrete Mathematics. 2025 ; כרך 39, מס' 2. עמודים 607-630.
Halldórsson, Magnús M. ; Rawitz, Dror. / Distributed fractional local ratio and independent set approximation. ב-: Information and Computation. 2025 ; כרך 303.
Bar-Noy, Amotz ; Böhnlein, Toni ; Peleg, David et al. / Approximate realizations for outerplanaric degree sequences. ב-: Journal of Computer and System Sciences. 2025 ; כרך 148.
Bar-Noy, Amotz ; Böhnlein, Toni ; Peleg, David et al. / On the role of the equal partition in degree realization by a bipartite graph. ב-: Theoretical Computer Science. 2025 ; כרך 1058.
Bar-Noy, Amotz ; Böhnlein, Toni ; Peleg, David et al. / Degree Realization by Bipartite Cactus Graphs. Algorithms and Complexity - 14th International Conference, CIAC 2025, Proceedings. עורך / Irene Finocchi ; Loukas Georgiadis. Springer Science and Business Media Deutschland GmbH, 2025. עמודים 258-275 (Lecture Notes in Computer Science).

2024

Bar-Noy, Amotz ; Böhnlein, Toni ; Peleg, David et al. / Approximate Realizations for Outerplanaric Degree Sequences. IWOCA. 2024. עמודים 98-110
Bar-Noy, Amotz ; Böhnlein, Toni ; Peleg, David et al. / Sparse Graphic Degree Sequences Have Planar Realizations. 49th International Symposium on Mathematical Foundations of Computer Science, MFCS 2024. עורך / Rastislav Kralovic ; Antonin Kucera. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2024. (Leibniz International Proceedings in Informatics, LIPIcs).
Bar-Noy, Amotz ; Böhnlein, Toni ; Peleg, David et al. / On Key Parameters Affecting the Realizability of Degree Sequences. 49th International Symposium on Mathematical Foundations of Computer Science, MFCS 2024. עורך / Rastislav Kralovic ; Antonin Kucera. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2024. (Leibniz International Proceedings in Informatics, LIPIcs).
Halldórsson, Magnús M. ; Rawitz, Dror. / Distributed Fractional Local Ratio and Independent Set Approximation. Structural Information and Communication Complexity - 31st International Colloquium, SIROCCO 2024, Proceedings. עורך / Yuval Emek. Springer Science and Business Media Deutschland GmbH, 2024. עמודים 281-299 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Bar-Noy, Amotz ; Böhnlein, Toni ; Lotker, Zvi et al. / Weighted microscopic image reconstruction. ב-: Discrete Applied Mathematics. 2024 ; כרך 345. עמודים 17-33.
Halldórsson, Magnús M. ; Rawitz, Dror. / Online Multiset Submodular Cover. ב-: Algorithmica. 2024 ; כרך 86, מס' 7. עמודים 2393-2411.
Bar-Noy, Amotz ; Bohnlein, Toni ; Peleg, David et al. / Approximate Realizations for Outerplanaric Degree Sequences. 2024.
Bar-Noy, Amotz ; Peleg, David ; Perry, Mor et al. / Graph realization of distance sets. ב-: Theoretical Computer Science. 2024 ; כרך 1019.

2023

Bar-Noy, Amotz ; Böhnlein, Toni ; Peleg, David et al. / Degree Realization by Bipartite Multigraphs. Structural Information and Communication Complexity - 30th International Colloquium, SIROCCO 2023, Proceedings. עורך / Sergio Rajsbaum ; Sergio Rajsbaum ; Alkida Balliu ; Dennis Olivetti ; Joshua J. Daymude. Springer Science and Business Media Deutschland GmbH, 2023. עמודים 3-17 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Rabinowitz, Assaf ; Rawitz, Dror. / Overflow management with self-eliminations. ב-: Theoretical Computer Science. 2023 ; כרך 948.
Bar-Noy, Amotz ; Böhnlein, Toni ; Peleg, David et al. / Forcibly bipartite and acyclic (uni-)graphic sequences. ב-: Discrete Mathematics. 2023 ; כרך 346, מס' 7.
Bar-Noy, Amotz ; Peleg, David ; Perry, Mor et al. / Composed Degree-Distance Realizations of Graphs. ב-: Algorithmica. 2023 ; כרך 85, מס' 3. עמודים 665-687.
Bar-Noy, Amotz ; Choudhary, Keerti ; Peleg, David et al. / Graph realizations : Maximum degree in vertex neighborhoods. ב-: Discrete Mathematics. 2023 ; כרך 346, מס' 9.

2022

Bar-Noy, Amotz ; Böhnlein, Toni ; Peleg, David et al. / On the Role of the High-Low Partition in Realizing a Degree Sequence by a Bipartite Graph. 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022. עורך / Stefan Szeider ; Robert Ganian ; Alexandra Silva. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2022. (Leibniz International Proceedings in Informatics, LIPIcs).
Böhnlein, Toni ; Erlich, Sapir ; Lotker, Zvi et al. / Randomized Strategies for Non-additive 3-Slope Ski Rental. Structural Information and Communication Complexity - 29th International Colloquium, SIROCCO 2022, Proceedings. עורך / Merav Parter. Springer Science and Business Media Deutschland GmbH, 2022. עמודים 62-78 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Bar-Noy, Amotz ; Peleg, David ; Perry, Mor et al. / Graph Realization of Distance Sets. 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022. עורך / Stefan Szeider ; Robert Ganian ; Alexandra Silva. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2022. (Leibniz International Proceedings in Informatics, LIPIcs).
Bar-Noy, Amotz ; Böhnlein, Toni ; Peleg, David et al. / On Realizing a Single Degree Sequence by a Bipartite Graph. 18th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2022. עורך / Artur Czumaj ; Qin Xin. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2022. (Leibniz International Proceedings in Informatics, LIPIcs).
Bar-Noy, Amotz ; Böhnlein, Toni ; Peleg, David et al. / Vertex-Weighted Graphs : Realizable and Unrealizable Domains. WALCOM: Algorithms and Computation - 16th International Conference and Workshops, WALCOM 2022, Proceedings. עורך / Petra Mutzel ; Md. Saidur Rahman ; Slamin. Springer Science and Business Media Deutschland GmbH, 2022. עמודים 315-327 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Poss, Menachem ; Rawitz, Dror. / Maximizing barrier coverage lifetime with static sensors. ב-: Journal of Scheduling. 2022 ; כרך 25, מס' 5. עמודים 535-545.
Bar-Noy, Amotz ; Böhnlein, Toni ; Peleg, David et al. / On vertex-weighted realizations of acyclic and general graphs. ב-: Theoretical Computer Science. 2022 ; כרך 922. עמודים 81-95.
Bar-Noy, Amotz ; Böhnlein, Toni ; Lotker, Zvi et al. / The generalized microscopic image reconstruction problem. ב-: Discrete Applied Mathematics. 2022 ; כרך 321. עמודים 402-416.

2021

Katz, Oren ; Rawitz, Dror ; Raz, Danny. / Containers Resource Allocation in Dynamic Cloud Environments. 2021 IFIP Networking Conference, IFIP Networking 2021. Institute of Electrical and Electronics Engineers Inc., 2021. (2021 IFIP Networking Conference, IFIP Networking 2021).
Bar-Noy, Amotz ; Erlebach, Thomas ; Rawitz, Dror et al. / “Green” barrier coverage with mobile sensors. ב-: Theoretical Computer Science. 2021 ; כרך 860. עמודים 117-134.
Bar-Noy, Amotz ; Böhnlein, Toni ; Lotker, Zvi et al. / Weighted Microscopic Image Reconstruction. SOFSEM 2021: Theory and Practice of Computer Science - 47th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2021, Proceedings. עורך / Tomáš Bureš ; Riccardo Dondi ; Johann Gamper ; Giovanna Guerrini ; Tomasz Jurdzinski ; Claus Pahl ; Florian Sikora ; Prudence W. Wong. Springer Science and Business Media Deutschland GmbH, 2021. עמודים 373-386 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Bar-Noy, Amotz ; Böhnlein, Toni ; Peleg, David et al. / Relaxed and Approximate Graph Realizations. Combinatorial Algorithms - 32nd International Workshop, IWOCA 2021, Proceedings. עורך / Paola Flocchini ; Lucia Moura. Springer Science and Business Media Deutschland GmbH, 2021. עמודים 3-19 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Bar-Noy, Amotz ; Peleg, David ; Rawitz, Dror et al. / Selected Neighbor Degree Forest Realization. 32nd International Symposium on Algorithms and Computation, ISAAC 2021. עורך / Hee-Kap Ahn ; Kunihiko Sadakane. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2021. (Leibniz International Proceedings in Informatics, LIPIcs).
Bar-Noy, Amotz ; Peleg, David ; Perry, Mor et al. / Composed Degree-Distance Realizations of Graphs. Combinatorial Algorithms - 32nd International Workshop, IWOCA 2021, Proceedings. עורך / Paola Flocchini ; Lucia Moura. Springer Science and Business Media Deutschland GmbH, 2021. עמודים 63-77 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Rabinowitz, Assaf ; Rawitz, Dror. / Overflow Management with Self-eliminations. Algorithms for Sensor Systems - 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2021, Proceedings. עורך / Leszek Gasieniec ; Ralf Klasing ; Tomasz Radzik. Springer Science and Business Media Deutschland GmbH, 2021. עמודים 124-139 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Bar-Noy, Amotz ; Böhnlein, Toni ; Peleg, David et al. / On Vertex-Weighted Graph Realizations. Algorithms and Complexity - 12th International Conference, CIAC 2021, Proceedings. עורך / Tiziana Calamoneri ; Federico Corò. Springer Science and Business Media Deutschland GmbH, 2021. עמודים 90-102 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Rawitz, Dror ; Rosén, Adi. / Online Budgeted Maximum Coverage. ב-: Algorithmica. 2021 ; כרך 83, מס' 9. עמודים 2989-3014.

2020

Bar-Noy, Amotz ; Choudhary, Keerti ; Peleg, David et al. / Graph realizations : Maximum degree in vertex neighborhoods. 17th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2020. עורך / Susanne Albers. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2020. (Leibniz International Proceedings in Informatics, LIPIcs).
Boppana, Ravi B. ; Halldórsson, Magnús M. ; Rawitz, Dror. / Simple and local independent set approximation. ב-: Theoretical Computer Science. 2020 ; כרך 846. עמודים 27-37.
BAR-NOY, AMOTZ ; CHOUDHARY, KEERTI ; PELEG, DAVID et al. / Efficiently realizing interval sequences. ב-: SIAM Journal on Discrete Mathematics. 2020 ; כרך 34, מס' 4. עמודים 2318-2337.
Kutiel, Gilad ; Rawitz, Dror. / Local Search Algorithms for the Maximum Carpool Matching Problem. ב-: Algorithmica. 2020 ; כרך 82, מס' 11. עמודים 3165-3182.
Bar-Noy, Amotz ; Choudhary, Keerti ; Cohen, Avi et al. / Minimum neighboring degree realization in graphs and trees. 28th Annual European Symposium on Algorithms, ESA 2020. עורך / Fabrizio Grandoni ; Grzegorz Herman ; Peter Sanders. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2020. (Leibniz International Proceedings in Informatics, LIPIcs).
Bar-Noy, Amotz ; Peleg, David ; Rawitz, Dror. / Vertex-weighted realizations of graphs. ב-: Theoretical Computer Science. 2020 ; כרך 807. עמודים 56-72.

2019

Bar-Noy, Amotz ; Choudhary, Keerti ; Peleg, David et al. / Graph Profile Realizations and Applications to Social Networks. WALCOM: Algorithms and Computation - 13th International Conference, WALCOM 2019, Proceedings. עורך / Krishnendu Mukhopadhyaya ; Shin-ichi Nakano ; Gautam K. Das ; Partha S. Mandal. Springer Verlag, 2019. עמודים 3-14 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Halldórsson, Magnús M. ; Köhler, Sven ; Rawitz, Dror. / Distributed approximation of k-service assignment. ב-: Distributed Computing. 2019 ; כרך 32, מס' 1. עמודים 27-40.
Kutiel, Gilad ; Rawitz, Dror. / Service chain placement in SDNs. ב-: Discrete Applied Mathematics. 2019 ; כרך 270. עמודים 168-180.
Bar-Noy, Amotz ; Böhnlein, Toni ; Lotker, Zvi et al. / The generalized microscopic image reconstruction problem. 30th International Symposium on Algorithms and Computation, ISAAC 2019. עורך / Pinyan Lu ; Guochuan Zhang. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2019. (Leibniz International Proceedings in Informatics, LIPIcs).
Bar-Noy, Amotz ; Choudhary, Keerti ; Peleg, David et al. / Efficiently realizing interval sequences. 30th International Symposium on Algorithms and Computation, ISAAC 2019. עורך / Pinyan Lu ; Guochuan Zhang. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2019. (Leibniz International Proceedings in Informatics, LIPIcs).
Bar-Noy, Amotz ; Choudhary, Keerti ; Peleg, David et al. / Graph Realizations : Maximum and Minimum Degree in Vertex Neighborhoods. 2019.
Bar-Noy, Amotz ; Bohnlein, Toni ; Peleg, David et al. / Vertex-weighted realizations of graphs. המאמר מוצג ב- 17th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2019, Enschede, הולנד.4 עמוד

2018

Bar-Yehuda, Reuven ; Kutiel, Gilad ; Rawitz, Dror. / 1.5-approximation algorithm for the 2-Convex Recoloring problem. ב-: Discrete Applied Mathematics. 2018 ; כרך 246. עמודים 2-11.
Boppana, Ravi B. ; Halldórsson, Magnús M. ; Rawitz, Dror. / Simple and local independent set approximation. 25th International Colloquium, SIROCCO 2018, Revised Selected Papers. עורך / Zvi Lotker ; Boaz Patt-Shamir. Springer Verlag, 2018. עמודים 88-101 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Halldórsson, Magnús M. ; Köhler, Sven ; Patt-Shamir, Boaz et al. / Distributed backup placement in networks. ב-: Distributed Computing. 2018 ; כרך 31, מס' 2. עמודים 83-98.
Bar-Yehuda, Reuven ; Kantor, Erez ; Kutten, Shay et al. / Growing half-balls : Minimizing storage and communication costs in content delivery networks. ב-: SIAM Journal on Discrete Mathematics. 2018 ; כרך 32, מס' 3. עמודים 1903-1921.
Rawitz, D. / Local Ratio. Handbook of Approximation Algorithms and Metaheuristics. עורך / D. Rawitz. Chapman & Hall/CRC, 2018. עמודים 87-111
Boppana, Ravi B. ; Halldórsson, Magnús M. ; Rawitz, Dror. / Simple and Local Independent Set Approximation. 2018.
Rawitz, Dror ; Voloshin, Ariella. / Flexible allocation on related machines with assignment restrictions. ב-: Discrete Applied Mathematics. 2018 ; כרך 250. עמודים 309-321.
Bar-Noy, Amotz ; Choudhary, Keerti ; Peleg, David et al. / Realizability of graph specifications : Characterizations and algorithms. 25th International Colloquium, SIROCCO 2018, Revised Selected Papers. עורך / Zvi Lotker ; Boaz Patt-Shamir. Springer Verlag, 2018. עמודים 3-13 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Boppana, Ravi B. ; Halldórsson, Magnús M. ; Rawitz, Dror. / Brief announcement : Simple and local independent set approximation. PODC 2018 - Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, 2018. עמודים 163-165 (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).
Kutiel, Gilad ; Rawitz, Dror. / Service chain placement in SDNs. Algorithmic Aspects of Cloud Computing - 3rd International Workshop, ALGOCLOUD 2017, Revised Selected Papers. עורך / Alex Delis ; George Pallis ; Dan Alistarh. Springer Verlag, 2018. עמודים 27-40 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Even, Guy ; Medina, Moti ; Rawitz, Dror. / Online generalized caching with varying weights and costs. SPAA 2018 - Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery, 2018. עמודים 205-212 (Annual ACM Symposium on Parallelism in Algorithms and Architectures).

2017

Rawitz, Dror ; Voloshin, Ariella. / Flexible cell selection in cellular networks. Algorithms for Sensor Systems - 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2016, Revised Selected Papers. עורך / Ralf Klasing ; Marek Chrobak ; Leszek Gąsieniec ; Antonio Fernández Anta. Springer Verlag, 2017. עמודים 112-128 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Bar-Noy, Amotz ; Rawitz, Dror ; Terlecky, Peter. / Maximizing barrier coverage lifetime with mobile sensors. ב-: SIAM Journal on Discrete Mathematics. 2017 ; כרך 31, מס' 1. עמודים 573-596.
Bar-Yehuda, Reuven ; Beder, Michael ; Rawitz, Dror. / A Constant Factor Approximation Algorithm for the Storage Allocation Problem. ב-: Algorithmica. 2017 ; כרך 77, מס' 4. עמודים 1105-1127.
Poss, Menachem ; Rawitz, Dror. / Maximizing barrier coverage lifetime with static sensors. Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Revised Selected Papers. עורך / Miguel A. Mosteiro ; Tomasz Jurdzinski ; Antonio Fernandez Anta ; Yanyong Zhang. Springer Verlag, 2017. עמודים 198-210 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Bar-Noy, Amotz ; Baumer, Ben ; Rawitz, Dror. / Set It and Forget It : Approximating the Set Once Strip Cover Problem. ב-: Algorithmica. 2017 ; כרך 79, מס' 2. עמודים 368-386.
Kutiel, Gilad ; Rawitz, Dror. / Local search algorithms for the maximum carpool matching problem. 25th European Symposium on Algorithms, ESA 2017. עורך / Christian Sohler ; Christian Sohler ; Kirk Pruhs. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017. (Leibniz International Proceedings in Informatics, LIPIcs).

2016

Halldórsson, Magnús M. ; Köhler, Sven ; Rawitz, Dror. / Distributed approximation of k-service assignment. 19th International Conference on Principles of Distributed Systems, OPODIS 2015. עורך / Emmanuelle Anceaume ; Christian Cachin ; Maria Potop-Butucaru. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2016. עמודים 11.1-11.16 (Leibniz International Proceedings in Informatics, LIPIcs).
Rawitz, Dror ; Rosén, Adi. / Online budgeted maximum coverage. 24th Annual European Symposium on Algorithms, ESA 2016. עורך / Christos Zaroliagis ; Piotr Sankowski. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2016. (Leibniz International Proceedings in Informatics, LIPIcs).
Fraigniaud, Pierre ; Halldórsson, Magnús M. ; Patt-Shamir, Boaz et al. / Shrinking Maxima, Decreasing Costs : New Online Packing and Covering Problems. ב-: Algorithmica. 2016 ; כרך 74, מס' 4. עמודים 1205-1223.
Bar-Yehuda, Reuven ; Kutiel, Gilad ; Rawitz, Dror. / 1.5-approximation algorithm for the 2-Convex Recoloring problem. Combinatorial Algorithms - 26th International Workshop, IWOCA 2015, Revised Selected Papers. עורך / William F. Smyth ; Zsuzsanna Liptak. Springer Verlag, 2016. עמודים 299-311 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Bar-Noy, Amotz ; Baumer, Ben ; Rawitz, Dror. / Changing of the guards : Strip cover with duty cycling. ב-: Theoretical Computer Science. 2016 ; כרך 610. עמודים 135-148.

2015

Halldórsson, Magnús M. ; Patt-Shamir, Boaz ; Köhler, Sven et al. / Distributed backup placement in networks. SPAA 2015 - Proceedings of the 27th ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery, 2015. עמודים 274-283 (Annual ACM Symposium on Parallelism in Algorithms and Architectures).
Bar-Noy, Amotz ; Rawitz, Dror ; Terlecky, Peter. / “Green” barrier coverage with mobile sensors. Algorithms and Complexity - 9th International Conference, CIAC 2015, Proceedings. עורך / Vangelis Th. Paschos ; Peter Widmayer. Springer Verlag, 2015. עמודים 33-46 (Lecture Notes in Computer Science).
Bar-Noy, Amotz ; Johnson, Matthew P. ; Naghibolhosseini, Nooreddin et al. / The price of incorrectly aggregating coverage values in sensor selection. Proceedings - IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2015. Institute of Electrical and Electronics Engineers Inc., 2015. עמודים 98-107 (Proceedings - IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2015).
Rawitz, Dror. / Rent, lease or buy: randomized strategies for multislope ski rental. 2015. City University of New York; Faculty of Engineering.
Bar-Yehuda, Reuven ; Polevoy, Gleb ; Rawitz, Dror. / Bandwidth allocation in cellular networks with multiple interferences. ב-: Discrete Applied Mathematics. 2015 ; כרך 194. עמודים 23-36.
Bar-Yehuda, Reuven ; Rawitz, Dror. / On the equivalence between the primal-dual schema and the local-ratio technique. Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 4th International Workshop on Approximation, Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001, Proceedings. עורך / Luca Trevisan ; Klaus Jansen ; Michel Goemans ; Jose D. P. Rolim. Springer Verlag, 2015. עמודים 24-36 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

2014

Terlecky, Peter ; Phelan, Brian ; Bar-Noy, Amotz et al. / Should i stay or should i go? Maximizing lifetime with relays. ב-: Computer Networks. 2014 ; כרך 70. עמודים 210-224.
Basu, Prithwish ; Yu, Feng ; Bar-Noy, Amotz et al. / To sample or to smash? Estimating reachability in large time-varying graphs. SIAM International Conference on Data Mining 2014, SDM 2014. עורך / Mohammed Zaki ; Zoran Obradovic ; Pang Ning-Tan ; Arindam Banerjee ; Chandrika Kamath ; Srinivasan Parthasarathy. Society for Industrial and Applied Mathematics Publications, 2014. עמודים 983-991 (SIAM International Conference on Data Mining 2014, SDM 2014).
Hermelin, Danny ; Mestre, Julián ; Rawitz, Dror. / Optimization problems in dotted interval graphs. ב-: Discrete Applied Mathematics. 2014 ; כרך 174. עמודים 66-72.
Liu, Bin ; Terlecky, Peter ; Xu, Xing et al. / Peer-assisted timely report delivery in social swarming applications. ב-: IEEE Transactions on Wireless Communications. 2014 ; כרך 13, מס' 10. עמודים 5826-5838.
Mansour, Yishay ; Patt-Shamir, Boaz ; Rawitz, Dror. / Competitive router scheduling with structured data. ב-: Theoretical Computer Science. 2014 ; כרך 530. עמודים 12-22.

2013

Halldórsson, Magnús M. ; Patt-Shamir, Boaz ; Rawitz, Dror. / Online Scheduling with Interval Conflicts. ב-: Theory of Computing Systems. 2013 ; כרך 53, מס' 2. עמודים 300-317.
Fraigniaud, P ; Halldórsson, M. M ; Patt-Shamir, B et al. / Shrinking maxima, decreasing costs: New online packing and covering problems. 16th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX). 2013.
Bar-Noy, Amotz ; Baumer, Ben ; Rawitz, Dror. / Brief announcement: Set it and forget it-approximating the set once strip cover Problem. ב-: Annual ACM Symposium on Parallelism in Algorithms and Architectures. 2013.
Bar-Yehuda, Reuven ; Beder, Michael ; Rawitz, Dror. / A constant factor approximation algorithm for the storage allocation problem. SPAA 2013 - Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery, 2013. עמודים 204-213 (Annual ACM Symposium on Parallelism in Algorithms and Architectures).
Fraigniaud, Pierre ; Halldórsson, Magnús M. ; Patt-Shamir, Boaz et al. / Shrinking maxima, decreasing costs : New online packing and covering problems. Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 16th International Workshop, APPROX 2013 and 17th International Workshop, RANDOM 2013, Proceedings. 2013. עמודים 158-172 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Bar-Yehuda, Reuven ; Rawitz, Dror. / A note on multicovering with disks. ב-: Computational Geometry: Theory and Applications. 2013 ; כרך 46, מס' 3. עמודים 394-399.
Bar-Noy, Amotz ; Rawitz, Dror ; Terlecky, Peter. / Maximizing barrier coverage lifetime with mobile sensors. Algorithms, ESA 2013 - 21st Annual European Symposium, Proceedings. 2013. עמודים 97-108 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

2012

Emekj, Yuval ; Halldórsson, Magnús M. ; Mansour, Yishay et al. / Online set packing. ב-: SIAM Journal on Computing. 2012 ; כרך 41, מס' 4. עמודים 728-746.
Phelan, Brian ; Terlecky, Peter ; Bar-Noy, Amotz et al. / Should I stay or should I go? Maximizing lifetime with relays. Proceedings - IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2012. 2012. עמודים 1-8 (Proceedings - IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2012).
Bar-Noy, Amotz ; Baumer, Ben ; Rawitz, Dror. / Changing of the guards : Strip cover with duty cycling. Structural Information and Communication Complexity - 19th International Colloquium, SIROCCO 2012, Proceedings. 2012. עמודים 36-47 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Mansour, Yishay ; Patt-Shamir, Boaz ; Rawitz, Dror. / Competitive router scheduling with structured data. Approximation and Online Algorithms - 9th International Workshop, WAOA 2011, Revised Selected Papers. 2012. עמודים 219-232 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Mansour, Yishay ; Patt-Shamir, Boaz ; Rawitz, Dror. / Overflow management with multipart packets. ב-: Computer Networks. 2012 ; כרך 56, מס' 15. עמודים 3456-3467.
Lotker, Zvi ; Patt-Shamir, Boaz ; Rawitz, Dror. / Rent, lease, or buy : Randomized algorithms for multislope ski rental. ב-: SIAM Journal on Discrete Mathematics. 2012 ; כרך 26, מס' 2. עמודים 718-736.
Even, Guy ; Rawitz, D. / Design and analysis of algorithms,1st Mediterranean Conference on Algorithms (MEDALG), LNCS 7659. Springer, 2012.
Hermelin, Danny ; Mestre, Julián ; Rawitz, Dror. / Optimization problems in dotted interval graphs. Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Revised Selcted Papers. 2012. עמודים 46-56 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Even, Guy ; Rawitz, Dror. / Preface. ב-: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2012 ; כרך 7659 LNNS. עמודים iv.
Liu, Bin ; Terlecky, Peter ; Bar-Noy, Amotz et al. / Optimizing information credibility in social swarming applications. ב-: IEEE Transactions on Parallel and Distributed Systems. 2012 ; כרך 23, מס' 6. עמודים 1147-1158.
Patt-Shamir, Boaz ; Rawitz, Dror. / Vector bin packing with multiple-choice. ב-: Discrete Applied Mathematics. 2012 ; כרך 160, מס' 10-11. עמודים 1591-1600.
Rawitz, Dror. / Competitive Scheduling and Overflow Management of Multipart Packets. 2012. Bar-Ilan University, Ramat Gan; Faculty of Engineering.
Liu, Bin ; Terlecky, Peter ; Xu, Xing et al. / Timely report delivery in social swarming applications. Proceedings - IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2012. 2012. עמודים 75-82 (Proceedings - IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2012).
Bar-Yehuda, Reuven ; Kantor, Erez ; Kutten, Shay et al. / Growing half-balls : Minimizing storage and communication costs in CDNs. Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Proceedings. PART 2. מהדורה Springer Verlag, 2012. עמודים 416-427 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2).
Bar-Noy, A ; Baumer, B ; Rawitz, D. / Changing of the guards: Strip cover with duty cycling. 19th International Colloquium on Structural Information and Communication Complexity (SIROCCO). Theoretical Computer Science, 2012.
Rawitz, Dror ; Shahar, Shimon. / Capacitated Arc stabbing. ב-: Journal of Discrete Algorithms. 2012 ; כרך 17. עמודים 86-94.
Bar-Yehuda, Reuven ; Kantor, Erez ; Kutten, Shay et al. / Growing half-balls: Minimizing storage and communication costs in CDNs. ב-: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2012 ; כרך 7392 LNCS, מס' PART 2.
Patt-Shamir, Boaz ; Rawitz, Dror ; Scalosub, Gabriel. / Distributed approximation of cellular coverage. ב-: Journal of Parallel and Distributed Computing. 2012 ; כרך 72, מס' 3. עמודים 402-408.

2011

Mansour, Yishay ; Patt-Shamir, Boaz ; Rawitz, Dror. / Overflow management with multipart packets. 30th IEEE International Conference on Computer Communications (INFOCOM). Computer Networks, 2011.
Halldórsson, Magnús M. ; Patt-Shamir, Boaz ; Rawitz, Dror. / Online scheduling with interval conflicts. 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011. 2011. עמודים 472-483 (Leibniz International Proceedings in Informatics, LIPIcs).
Hermelin, Danny ; Rawitz, Dror. / Optimization problems in multiple subtree graphs. ב-: Discrete Applied Mathematics. 2011 ; כרך 159, מס' 7. עמודים 588-594.
Rawitz, Dror. / Using linear programming for designing and analyzing approximation algorithms. 2011. City University of New York; computer science.
Rawitz, Dror. / Online set packing and competitive router scheduling with structured data. 2011. City University of New York; Computer Science.
Mansour, Yishay ; Patt-Shamir, Boaz ; Rawitz, Dror. / Overflow management with multipart packets. 2011 Proceedings IEEE INFOCOM. Institute of Electrical and Electronics Engineers Inc., 2011. עמודים 2606-2614 (Proceedings - IEEE INFOCOM).
Patt-Shamir, Boaz ; Rawitz, Dror. / Video distribution under multiple constraints. ב-: Theoretical Computer Science. 2011 ; כרך 412, מס' 29. עמודים 3717-3730.
Bar-Yehuda, Reuven ; Hermelin, Danny ; Rawitz, Dror. / Minimum vertex cover in rectangle graphs. ב-: Computational Geometry: Theory and Applications. 2011 ; כרך 44, מס' 6-7. עמודים 356-364.
Rawitz, Dror ; Shahar, Shimon. / Partial multicovering and the d-consecutive ones property. ב-: Discrete Optimization. 2011 ; כרך 8, מס' 4. עמודים 555-567.

2010

Emek, Yuval ; Halldórsson, Magnús M. ; Mansour, Yishay et al. / Online set packing and competitive scheduling of multipart tasks. PODC '10 Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing. ACM, 2010.
Butman, Ayelet ; Hermelin, Danny ; Lewenstein, Moshe et al. / Optimization problems in multiple-interval graphs. ב-: ACM Transactions on Algorithms. 2010 ; כרך 6, מס' 2.
Bar-Yehuda, Reuven ; Hermelin, Danny ; Rawitz, Dror. / Minimum vertex cover in rectangle graphs. Algorithms, ESA 2010 - 18th Annual European Symposium, Proceedings. PART 1. מהדורה 2010. עמודים 255-266 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1).
Emek, Yuval ; Halldórsson, Magnús M. ; Mansour, Yishay et al. / Online set packing and competitive scheduling of multi-part tasks. PODC'10 - Proceedings of the 2010 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery (ACM), 2010. עמודים 440-449 (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).
Bar-Yehuda, Reuven ; Flysher, Guy ; Mestre, Julián et al. / Approximation of partial capacitated vertex cover. ב-: SIAM Journal on Discrete Mathematics. 2010 ; כרך 24, מס' 4. עמודים 1441-1469.
Bar-Yehuda, Reuven ; Hermelin, Danny ; Rawitz, Dror. / An extension of the Nemhauser-Trotter theorem to generalized vertex coverwith applications. ב-: SIAM Journal on Discrete Mathematics. 2010 ; כרך 24, מס' 1. עמודים 287-300.
Bar-Yehuda, Reuven ; Polevoy, Gleb ; Rawitz, Dror. / Bandwidth allocation in cellular networks with multiple interferences. Proceedings of the 6th International Workshop on Foundations of Mobile Computing, DIALM-POMC '10. 2010. עמודים 33-42 (Proceedings of the 6th International Workshop on Foundations of Mobile Computing, DIALM-POMC '10).
Patt-Shamir, Boaz ; Rawitz, Dror. / Vector bin packing with multiple-choice (extended abstract). Algorithm Theory - SWAT 2010 - 12th Scandinavian Symposium and Workshops on Algorithm Theory, Proceedings. 2010. עמודים 248-259 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

2009

Bar-Yehuda, Reuven ; Hermelin, Danny ; Rawitz, Dror. / An extension of the Nemhauser&Trotter Theorem to generalized vertex cover with applications. 7th Workshop on Approximation and Online Algorithms (WAOA). SIAM Journal on Discrete Mathematics, 2009.
Bar-Yehuda, Reuven ; Beder, Michael ; Cohen, Yuval et al. / Resource Allocation in Bounded Degree Trees. ב-: Algorithmica. 2009 ; כרך 54, מס' 1. עמודים 89-106.
Hermelin, Danny ; Rawitz, Dror. / Optimization problems in multiple subtree graphs. Approximation and Online Algorithms - 7th International Workshop, WAOA 2009, Revised Papers. 2009. עמודים 194-204 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Bar-Yehuda, Reuven ; Hermelin, Danny ; Rawitz, Dror. / Extension of the nemhauser and trotter theorem to generalized vertex cover with applications. Approximation and Online Algorithms - 7th International Workshop, WAOA 2009, Revised Papers. 2009. עמודים 13-24 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Cohen, Rami ; Rawitz, Dror ; Raz, Danny. / Time-dependent multi-scheduling of multicast. ב-: ACM Transactions on Algorithms. 2009 ; כרך 6, מס' 1.

2008

Hermelin, Danny ; Rawitz, Dror ; Rizzi, Romeo et al. / The Minimum Substring Cover problem. ב-: Information and Computation. 2008 ; כרך 206, מס' 11. עמודים 1303-1312.
Patt-Shamir, Boaz ; Rawitz, Dror ; Scalosub, Gabriel. / Distributed approximation of cellular coverage. ב-: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2008 ; כרך 5401 LNCS. עמודים 331-345.
Israeli, Amos ; Rawitz, Dror ; Sharon, Oran. / On the complexity of sequential rectangle placement in IEEE 802.16/WiMAX systems. ב-: Information and Computation. 2008 ; כרך 206, מס' 11. עמודים 1334-1345.
Hermelin, Danny ; Rawitz, Dror ; Rizzi, Romeo et al. / The minimum substring cover problem. Approximation and Online Algorithms - 5th International Workshop, WAOA 2007, Revised Papers. Springer Verlag, 2008. עמודים 170-183 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Even, Guy ; Levi, Retsef ; Rawitz, Dror et al. / Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs. ב-: ACM Transactions on Algorithms. 2008 ; כרך 4, מס' 3.
Patt-Shamir, Boaz ; Rawitz, Dror. / Video Distribution Under Multiple Constraints. Distributed Computing Systems, 2008. ICDCS '08. The 28th International Conference on. IEEE, 2008.
Lotker, Zvi ; Patt-Shamir, Boaz ; Rawitz, Dror. / Rent, lease or buy : Randomized algorithms for multislope Ski rental. Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science, STACS 2008. IBFI Schloss Dagstuhl, 2008. עמודים 503-514 (Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science, STACS 2008).
Lotker, Zvi ; Patt-Shamir, Boaz ; Rawitz, Dror. / Ski rental with two general options. ב-: Information Processing Letters. 2008 ; כרך 108, מס' 6. עמודים 365-368.
Crochemore, Maxime ; Hermelin, Danny ; Landau, Gad M. et al. / Approximating the 2-interval pattern problem. ב-: Theoretical Computer Science. 2008 ; כרך 395, מס' 2-3. עמודים 283-297.
Bar-Yehuda, Reuven ; Feldman, Ido ; Rawitz, Dror. / Improved approximation algorithm for convex recoloring of trees. ב-: Theory of Computing Systems. 2008 ; כרך 43, מס' 1. עמודים 3-18.
Patt-Shamir, Boaz ; Rawitz, Dror. / Video distribution under multiple constraints. Proceedings - The 28th International Conference on Distributed Computing Systems, ICDCS 2008. 2008. עמודים 841-848 (Proceedings - The 28th International Conference on Distributed Computing Systems, ICDCS 2008).

2007

Butman, Ayelet ; Hermelin, Danny ; Lewenstein, Moshe et al. / Optimization problems in multiple-interval graphs. Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007. Association for Computing Machinery, 2007. עמודים 268-277 (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).
Butman, Ayelet ; Hermelin, Danny ; Lewenstein, M. et al. / Optimization problems in multiple-interval graphs. 18th ACM-SIAM Symposium on Discrete Algorithms (SODA). ACM, 2007.
Butman, Ayelet ; Hermelin, Danny ; Lewenstein, Moshe et al. / Optimization problems in multiple-interval graphs. ב-: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. 2007 ; כרך 07-09-January-2007.
Bar-Yehuda, Reuven ; Flysher, Guy ; Mestre, Julián et al. / Approximation of partial capacitated vertex cover. Algorithms - ESA 2007 - 15th Annual European Symposium, Proceedings. Springer Verlag, 2007. עמודים 335-346 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Rawitz, Dror. / Admission control with advance reservations in simple networks. ב-: Journal of Discrete Algorithms. 2007 ; כרך 5, מס' 3. עמודים 491-500.
Israeli, Amos ; Rawitz, Dror ; Sharon, Oran. / On the complexity of sequential rectangle placement in IEEE 802.16/WiMAX systems. Algorithms - ESA 2007 - 15th Annual European Symposium, Proceedings. Springer Verlag, 2007. עמודים 570-581 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

2006

Even, Guy ; Rawitz, Dror ; Shahar, Shimon. / Approximation algorithms for capacitated rectangle stabbing. Algorithms and Complexity - 6th Italian Conference, CIAC 2006, Proceedings. Springer Verlag, 2006. עמודים 18-29 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Bar-Yehuda, Reuven ; Beder, Michael ; Cohen, Yuval et al. / Resource allocation in bounded degree trees. Algorithms, ESA 2006 - 14th Annual European Symposium, Proceedings. Springer Verlag, 2006. עמודים 64-75 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Bar-Yehuda, Reuven ; Rawitz, Dror. / A tale of two methods. Theoretical Computer Scienc - Essays in Memory of Shimon Even. Springer Verlag, 2006. עמודים 196-217 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Bar-Yehuda, Reuven ; Rawitz, Dror. / Using fractional primal-dual to schedule split intervals with demands. ב-: Discrete Optimization. 2006 ; כרך 3, מס' 4. עמודים 275-287.
Bar-Yehuda, Reuven ; Feldman, Ido ; Rawitz, Dror. / Improved approximation algorithm for convex recoloring of trees. Approximation and Online Algorithms - Third International Workshop, WAOA 2005, Revised Selected Papers. 2006. עמודים 55-68 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

2005

Even, Guy ; Rawitz, Dror ; Shahar, Shimon. / Hitting sets when the VC-dimension is small. ב-: Information Processing Letters. 2005 ; כרך 95, מס' 2. עמודים 358-362.
Bar-Yehuda, Reuven ; Rawitz, Dror. / On the equivalence between the primal-dual schema and the local ratio technique. ב-: SIAM Journal on Discrete Mathematics. 2005 ; כרך 19, מס' 3. עמודים 762-797.
Bar-Yehuda, Reuven ; Rawitz, Dror. / Using fractional primal-dual to schedule split intervals with demands. ב-: Lecture Notes in Computer Science. 2005 ; כרך 3669. עמודים 714-725.
Bar-Yehuda, Reuven ; Bendel, Keren ; Freund, Ari et al. / The local ratio technique and its application to scheduling and resource allocation problems. ב-: Operations Research/ Computer Science Interfaces Series. 2005 ; כרך 34. עמודים 107-143.

2004

Bar-Yehuda, Reuven ; Bendel, Keren ; Freund, Ari et al. / Local ratio : A unified framework for approximation algorithms in memoriam: Shimon Even 1935-2004. ב-: ACM Computing Surveys. 2004 ; כרך 36, מס' 4. עמודים 422-463.
Bar-Yehuda, Reuven ; Rawitz, Dror. / Local ratio with negative weights. ב-: Operations Research Letters. 2004 ; כרך 32, מס' 6. עמודים 540-546.
Cohen, Rami ; Rawitz, Dror ; Raz, Danny. / Time dependent multi scheduling of multicast. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). עורך / Susanne Albers ; Tomasz Radzik. Springer Verlag, 2004. עמודים 216-227 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Freund, Ari ; Rawitz, Dror. / Combinatorial interpretations of dual fitting and primal fitting. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). עורך / Klaus Jansen ; Roberto Solis-Oba. Springer Verlag, 2004. עמודים 137-150 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

2002

Petrank, Erez ; Rawitz, Dror. / The hardness of cache conscious data placement. ב-: Conference Record of the Annual ACM Symposium on Principles of Programming Languages. 2002 ; עמודים 101-112.
Bar-Yehuda, Reuven ; Rawitz, Dror. / Approximating element-weighted vertex deletion problems for the complete k-partite property. ב-: Journal of Algorithms. 2002 ; כרך 42, מס' 1. עמודים 20-40.

2001

Bar-Yehuda, R. ; Rawitz, D. / Efficient algorithms for integer programs with two variables per constraint. ב-: Algorithmica. 2001 ; כרך 29, מס' 4. עמודים 595-609.

1999

Bar-Yehuda, Reuven ; Rawitz, Dror. / Efficient algorithms for integer programs with two variables per constraint. Algorithms - ESA 1999 - 7th Annual European Symposium, Proceedings. עורך / Jaroslav Nešetřil. Springer Verlag, 1999. עמודים 116-126 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).