Dror Rawitz
Orcid: 0000-0003-0323-6097
According to our database1,
Dror Rawitz
authored at least 98 papers
between 2001 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Proceedings of the Structural Information and Communication Complexity, 2024
Proceedings of the Combinatorial Algorithms - 35th International Workshop, 2024
2023
Discret. Math., September, 2023
Proceedings of the Structural Information and Communication Complexity, 2023
2022
Theor. Comput. Sci., 2022
Proceedings of the WALCOM: Algorithms and Computation, 2022
Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022
Proceedings of the Structural Information and Communication Complexity, 2022
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022
On the Role of the High-Low Partition in Realizing a Degree Sequence by a Bipartite Graph.
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022
2021
Proceedings of the IFIP Networking Conference, 2021
Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021
Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021
Proceedings of the Algorithms and Complexity - 12th International Conference, 2021
2020
Proceedings of the 28th Annual European Symposium on Algorithms, 2020
2019
Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019
2018
Growing Half-Balls: Minimizing Storage and Communication Costs in Content Delivery Networks.
SIAM J. Discret. Math., 2018
Discret. Appl. Math., 2018
Discret. Appl. Math., 2018
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018
Proceedings of the Structural Information and Communication Complexity, 2018
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018
2017
SIAM J. Discret. Math., 2017
Algorithmica, 2017
Algorithmica, 2017
Proceedings of the 25th Annual European Symposium on Algorithms, 2017
2016
Algorithmica, 2016
Proceedings of the Algorithms for Sensor Systems, 2016
2015
Discret. Appl. Math., 2015
Proceedings of the 2015 International Conference on Distributed Computing in Sensor Systems, 2015
Proceedings of the Algorithms and Complexity - 9th International Conference, 2015
2014
IEEE Trans. Wirel. Commun., 2014
Comput. Networks, 2014
Proceedings of the 2014 SIAM International Conference on Data Mining, 2014
2013
A constant factor approximation algorithm for the storage allocation problem: extended abstract.
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013
Brief announcement: set it and forget it - approximating the set once strip cover problem.
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013
2012
IEEE Trans. Parallel Distributed Syst., 2012
SIAM J. Discret. Math., 2012
J. Parallel Distributed Comput., 2012
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012
Proceedings of the IEEE 8th International Conference on Distributed Computing in Sensor Systems, 2012
2011
2010
An Extension of the Nemhauser--Trotter Theorem to Generalized Vertex Cover with Applications.
SIAM J. Discret. Math., 2010
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010
2009
Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications.
Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009
2008
Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs.
ACM Trans. Algorithms, 2008
Theory Comput. Syst., 2008
Inf. Comput., 2008
2007
J. Discrete Algorithms, 2007
2006
Discret. Optim., 2006
Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006
2005
SIAM J. Discret. Math., 2005
The Hardness of Cache Conscious Data Placement.
Nord. J. Comput., 2005
2004
Local ratio: A unified framework for approxmation algrithms in memoriam: Shimon Even 1935-2004.
ACM Comput. Surv., 2004
2003
PhD thesis, 2003
Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003
2002
Approximating Element-Weighted Vertex Deletion Problems for the Complete k-Partite Property.
J. Algorithms, 2002
2001
Algorithmica, 2001