Dror Rawitz

Inf. Comput., 2025

2024

Online Multiset Submodular Cover.

[BibT_eX]

[DOI]

Algorithmica, July, 2024

Weighted microscopic image reconstruction.

[BibT_eX]

[DOI]

Discret. Appl. Math., March, 2024

Graph realization of distance sets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2024

Sparse Graphic Degree Sequences Have Planar Realizations.

[BibT_eX]

[DOI]

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

On Key Parameters Affecting the Realizability of Degree Sequences (Invited Paper).

[BibT_eX]

[DOI]

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

2023

Graph realizations: Maximum degree in vertex neighborhoods.

[BibT_eX]

[DOI]

Discret. Math., September, 2023

Forcibly bipartite and acyclic (uni-)graphic sequences.

[BibT_eX]

[DOI]

Discret. Math., July, 2023

Composed Degree-Distance Realizations of Graphs.

[BibT_eX]

[DOI]

Algorithmica, March, 2023

Overflow management with self-eliminations.

[BibT_eX]

[DOI]

Assaf Rabinowitz

Theor. Comput. Sci., February, 2023

Degree Realization by Bipartite Multigraphs.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2023

2022

On vertex-weighted realizations of acyclic and general graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Maximizing barrier coverage lifetime with static sensors.

[BibT_eX]

[DOI]

Menachem Poss

J. Sched., 2022

The generalized microscopic image reconstruction problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

Vertex-Weighted Graphs: Realizable and Unrealizable Domains.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2022

On Realizing a Single Degree Sequence by a Bipartite Graph (Invited Paper).

[BibT_eX]

[DOI]

Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

Randomized Strategies for Non-additive 3-Slope Ski Rental.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2022

On the Role of the High-Low Partition in Realizing a Degree Sequence by a Bipartite Graph.

[BibT_eX]

[DOI]

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

2021

"Green" barrier coverage with mobile sensors.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Online Budgeted Maximum Coverage.

[BibT_eX]

[DOI]

Adi Rosén

Algorithmica, 2021

Containers Resource Allocation in Dynamic Cloud Environments.

[BibT_eX]

[DOI]

Oren Katz

Danny Raz

Proceedings of the IFIP Networking Conference, 2021

Relaxed and Approximate Graph Realizations.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

Selected Neighbor Degree Forest Realization.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

On Vertex-Weighted Graph Realizations.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

2020

Simple and local independent set approximation.

[BibT_eX]

[DOI]

Ravi B. Boppana

Theor. Comput. Sci., 2020

Vertex-weighted realizations of graphs.

[BibT_eX]

[DOI]

David Peleg

Theor. Comput. Sci., 2020

Efficiently Realizing Interval Sequences.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

Local Search Algorithms for the Maximum Carpool Matching Problem.

[BibT_eX]

[DOI]

Algorithmica, 2020

Minimum Neighboring Degree Realization in Graphs and Trees.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

Distributed approximation of k-service assignment.

[BibT_eX]

[DOI]

Sven Köhler

Distributed Comput., 2019

Service chain placement in SDNs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Graph Realizations: Maximum and Minimum Degree in Vertex Neighborhoods.

[BibT_eX]

[DOI]

CoRR, 2019

Graph Profile Realizations and Applications to Social Networks.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

2018

Growing Half-Balls: Minimizing Storage and Communication Costs in Content Delivery Networks.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Distributed backup placement in networks.

[BibT_eX]

[DOI]

Sven Köhler

Distributed Comput., 2018

Flexible allocation on related machines with assignment restrictions.

[BibT_eX]

[DOI]

Ariella Voloshin

Discret. Appl. Math., 2018

1.5-approximation algorithm for the 2-Convex Recoloring problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Online Generalized Caching with Varying Weights and Costs.

[BibT_eX]

[DOI]

Guy Even

Moti Medina

Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Realizability of Graph Specifications: Characterizations and Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2018

Brief Announcement: Simple and Local Independent Set Approximation.

[BibT_eX]

[DOI]

Ravi B. Boppana

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

Local Ratio.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017

Maximizing Barrier Coverage Lifetime with Mobile Sensors.

[BibT_eX]

[DOI]

Peter Terlecky

SIAM J. Discret. Math., 2017

A Constant Factor Approximation Algorithm for the Storage Allocation Problem.

[BibT_eX]

[DOI]

Michael Beder

Algorithmica, 2017

Set It and Forget It: Approximating the Set Once Strip Cover Problem.

[BibT_eX]

[DOI]

Ben Baumer

Algorithmica, 2017

Local Search Algorithms for Maximum Carpool Matching.

[BibT_eX]

[DOI]

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016

Changing of the guards: Strip cover with duty cycling.

[BibT_eX]

[DOI]

Ben Baumer

Theor. Comput. Sci., 2016

Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems.

[BibT_eX]

[DOI]

Pierre Fraigniaud

Adi Rosén

Algorithmica, 2016

Flexible Cell Selection in Cellular Networks.

[BibT_eX]

[DOI]

Ariella Voloshin

Proceedings of the Algorithms for Sensor Systems, 2016

2015

Bandwidth allocation in cellular networks with multiple interferences.

[BibT_eX]

[DOI]

Gleb Polevoy

Discret. Appl. Math., 2015

The Price of Incorrectly Aggregating Coverage Values in Sensor Selection.

[BibT_eX]

[DOI]

Nooreddin Naghibolhosseini

Matthew P. Johnson

Simon Shamoun

Proceedings of the 2015 International Conference on Distributed Computing in Sensor Systems, 2015

"Green" Barrier Coverage with Mobile Sensors.

[BibT_eX]

[DOI]

Peter Terlecky

Proceedings of the Algorithms and Complexity - 9th International Conference, 2015

2014

Peer-Assisted Timely Report Delivery in Social Swarming Applications.

[BibT_eX]

[DOI]

IEEE Trans. Wirel. Commun., 2014

Competitive router scheduling with structured data.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Optimization problems in dotted interval graphs.

[BibT_eX]

[DOI]

Julián Mestre

Discret. Appl. Math., 2014

Should I stay or should I go? Maximizing lifetime with relays.

[BibT_eX]

[DOI]

Comput. Networks, 2014

To Sample or To Smash? Estimating reachability in large time-varying graphs.

[BibT_eX]

[DOI]

Proceedings of the 2014 SIAM International Conference on Data Mining, 2014

2013

Online Scheduling with Interval Conflicts.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2013

A note on multicovering with disks.

[BibT_eX]

[DOI]

Comput. Geom., 2013

A constant factor approximation algorithm for the storage allocation problem: extended abstract.

[BibT_eX]

[DOI]

Michael Beder

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.

[BibT_eX]

[DOI]

Ben Baumer

Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

2012

Optimizing Information Credibility in Social Swarming Applications.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2012

Rent, Lease, or Buy: Randomized Algorithms for Multislope Ski Rental.

[BibT_eX]

[DOI]

Zvi Lotker

SIAM J. Discret. Math., 2012

Online Set Packing.

[BibT_eX]

[DOI]

Yuval Emek

Jaikumar Radhakrishnan

SIAM J. Comput., 2012

Distributed approximation of cellular coverage.

[BibT_eX]

[DOI]

Gabriel Scalosub

J. Parallel Distributed Comput., 2012

Capacitated Arc Stabbing.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

Vector bin packing with multiple-choice.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

Overflow management with multipart packets.

[BibT_eX]

[DOI]

Comput. Networks, 2012

Growing Half-Balls: Minimizing Storage and Communication Costs in CDNs.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Timely Report Delivery in Social Swarming Applications.

[BibT_eX]

[DOI]

Proceedings of the IEEE 8th International Conference on Distributed Computing in Sensor Systems, 2012

2011

Video distribution under multiple constraints.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Partial multicovering and the d-consecutive ones property.

[BibT_eX]

[DOI]

Discret. Optim., 2011

Optimization problems in multiple subtree graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

Minimum vertex cover in rectangle graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2011

2010

Optimization problems in multiple-interval graphs.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2010

An Extension of the Nemhauser--Trotter Theorem to Generalized Vertex Cover with Applications.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

Approximation of Partial Capacitated Vertex Cover.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

Online set packing and competitive scheduling of multi-part tasks.

[BibT_eX]

[DOI]

Yuval Emek

Jaikumar Radhakrishnan

Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

2009

Time-dependent multi-scheduling of multicast.

[BibT_eX]

[DOI]

Rami Cohen

Danny Raz

ACM Trans. Algorithms, 2009

Resource Allocation in Bounded Degree Trees.

[BibT_eX]

[DOI]

Algorithmica, 2009

Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009

2008

Approximating the 2-interval pattern problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2008

Improved Approximation Algorithm for Convex Recoloring of Trees.

[BibT_eX]

[DOI]

Ido Feldman

Theory Comput. Syst., 2008

Ski rental with two general options.

[BibT_eX]

[DOI]

Zvi Lotker

Inf. Process. Lett., 2008

On the complexity of sequential rectangle placement in IEEE 802.16/WiMAX systems.

[BibT_eX]

[DOI]

Amos Israeli

Oran Sharon

Inf. Comput., 2008

The Minimum Substring Cover problem.

[BibT_eX]

[DOI]

Inf. Comput., 2008

2007

Admission control with advance reservations in simple networks.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2007

2006

Using fractional primal-dual to schedule split intervals with demands.

[BibT_eX]

[DOI]

Discret. Optim., 2006

Approximation Algorithms for Capacitated Rectangle Stabbing.

[BibT_eX]

[DOI]

Guy Even

Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006

A Tale of Two Methods.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 2006

2005

On the Equivalence between the Primal-Dual Schema and the Local Ratio Technique.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2005

The Hardness of Cache Conscious Data Placement.

[BibT_eX]

Erez Petrank

Nord. J. Comput., 2005

Hitting sets when the VC-dimension is small.

[BibT_eX]

[DOI]

Guy Even

Inf. Process. Lett., 2005

2004

Local ratio with negative weights.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2004

Local ratio: A unified framework for approxmation algrithms in memoriam: Shimon Even 1935-2004.

[BibT_eX]

[DOI]

ACM Comput. Surv., 2004

2003

Combinatorial and LP-based methods for designing approximation algorithms.

[BibT_eX]

[DOI]

PhD thesis, 2003

Combinatorial Interpretations of Dual Fitting and Primal Fitting.

[BibT_eX]

[DOI]

Ari Freund

Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

2002

Approximating Element-Weighted Vertex Deletion Problems for the Complete k-Partite Property.

[BibT_eX]

[DOI]

J. Algorithms, 2002

2001

Efficient Algorithms for Integer Programs with Two Variables per Constraint.

[BibT_eX]

[DOI]