Asaf Levin - RankMe

237 papers A* 3A 13B 30C 1Misc 1Journal 177Unranked 11

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Better and simpler reducibility bounds over the integers. Discret. Optim. Asaf Levin
2026	J	`jnl`	Makespan minimization for ordinal cardinality constrained scheduling. Discret. Appl. Math. Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder
2026	J	`jnl`	More on online cardinality constrained bin packing with small cardinality bounds. Theor. Comput. Sci. János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2026	J	`jnl`	Semi-online models for cardinality constrained bin packing. J. Sched. Leah Epstein, Asaf Levin
2025	B	`conf`	(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs. IPCO Christoph Hunkenschröder, Martin Koutecký, Asaf Levin, Tung Anh Vu
2025	J	`jnl`	(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs. CoRR Christoph Hunkenschröder, Martin Koutecký, Asaf Levin, Tung Anh Vu
2025	B	`conf`	An EPTAS for Minimizing the Total Weighted Completion Time of Jobs with Release Dates on Uniformly Related Machines. MFCS Leah Epstein, Asaf Levin
2025	B	`conf`	An Efficient Polynomial Time Approximation Scheme for Minimizing the Total Weighted Completion Time on Uniformly Related Machines. WADS Leah Epstein, Asaf Levin
2025	J	`jnl`	Better and Simpler Reducibility Bounds over the Integers. CoRR Asaf Levin
2025	A	`conf`	Efficient Approximation Schemes for Scheduling on a Stochastic Number of Machines. STACS Leah Epstein, Asaf Levin
2025	B	`conf`	Lower Bounds for Several Standard Bin Packing Algorithms in the Random Order Model. WADS Leah Epstein, Asaf Levin
2025	J	`jnl`	Sparse Integer Programming Is Fixed-Parameter Tractable. Math. Oper. Res. Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Asaf Levin, Shmuel Onn
2024	J	`jnl`	APTAS for bin packing with general cost structures. CoRR G. Jaykrishnan, Asaf Levin
2024	J	`jnl`	EPTAS for parallel identical machine scheduling with time restrictions. J. Comb. Optim. G. Jaykrishnan, Asaf Levin
2024	J	`jnl`	Efficient approximation schemes for scheduling on a stochastic number of machines. CoRR Leah Epstein, Asaf Levin
2024	J	`jnl`	Scheduling with cardinality dependent unavailability periods. Eur. J. Oper. Res. G. Jaykrishnan, Asaf Levin
2024	J	`jnl`	Selecting intervals to optimize the design of observational studies subject to fine balance constraints. J. Comb. Optim. Asaf Levin
2024	J	`jnl`	The Near Exact Bin Covering Problem. Algorithmica Asaf Levin
2024	B	`conf`	Tight Lower Bounds for Block-Structured Integer Programs. IPCO Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Alexandra Lassota, Asaf Levin
2024	J	`jnl`	Tight Lower Bounds for Block-Structured Integer Programs. CoRR Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Alexandra Lassota, Asaf Levin
2023	J	`jnl`	Algorithms and Complexities of Matching Variants in Covariate Balancing. Oper. Res. Dorit S. Hochbaum, Asaf Levin, Xu Rao
2023	J	`jnl`	EPTAS for load balancing problem on parallel machines with a non-renewable resource. Discret. Optim. G. Jaykrishnan, Asaf Levin
2023	J	`jnl`	EPTAS for the dual of splittable bin packing with cardinality constraint. Theor. Comput. Sci. G. Jaykrishnan, Asaf Levin
2023	J	`jnl`	High-multiplicity N-fold IP via configuration LP. Math. Program. Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn
2023	J	`jnl`	Online Minimization of the Maximum Starting Time: Migration Helps. Algorithmica Asaf Levin
2023	J	`jnl`	Online bin covering with limited migration. J. Comput. Syst. Sci. Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder
2023	J	`jnl`	Online cardinality constrained scheduling. Oper. Res. Lett. Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder
2023	J	`jnl`	Reducibility bounds of objective functions over the integers. Oper. Res. Lett. Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Asaf Levin, Shmuel Onn
2023	J	`jnl`	Scheduling with cardinality dependent unavailability periods. CoRR G. Jaykrishnan, Asaf Levin
2023	J	`jnl`	Weighted throughput in a single machine preemptive scheduling with continuous controllable processing times. Acta Informatica Asaf Levin, Tal Shusterman
2022	J	`jnl`	Approximate separable multichoice optimization over monotone systems. Discret. Optim. Martin Koutecký, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn
2022	J	`jnl`	Approximation Schemes for the Generalized Extensible Bin Packing Problem. Algorithmica Asaf Levin
2022	A	`conf`	Cardinality Constrained Scheduling in Online Models. STACS Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder
2022	J	`jnl`	Cardinality Constrained Scheduling in Online Models. CoRR Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder
2022	J	`jnl`	Comparing the costs of Any Fit algorithms for bin packing. Oper. Res. Lett. Asaf Levin
2022	J	`jnl`	EPTAS for the dual of splittable bin packing with cardinality constraint. CoRR G. Jaykrishnan, Asaf Levin
2022	J	`jnl`	Lower bounds for batched bin packing. J. Comb. Optim. János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2022	J	`jnl`	Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes. Inf. Process. Lett. Asaf Levin
2022	J	`jnl`	Starting time minimization for the maximum job variant. Discret. Appl. Math. Leah Epstein, Asaf Levin
2022	J	`jnl`	The near exact bin covering problem. CoRR Asaf Levin
2021	J	`jnl`	A New Lower Bound for Classic Online Bin Packing. Algorithmica János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2021	B	`ed.`	Approximation and Online Algorithms - 18th International Workshop, WAOA 2020, Virtual Event, September 9-10, 2020, Revised Selected Papers WAOA Christos Kaklamanis, Asaf Levin
2021	J	`jnl`	Complexity, algorithms and applications of the integer network flow with fractional supplies problem. Oper. Res. Lett. Dorit S. Hochbaum, Asaf Levin, Xu Rao
2021	B	`conf`	EPTAS for Load Balancing Problem on Parallel Machines with a Non-renewable Resource. WAOA G. Jaykrishnan, Asaf Levin
2021	J	`jnl`	EPTAS for load balancing problem on parallel machines with a non-renewable resource. CoRR G. Jaykrishnan, Asaf Levin
2021	J	`jnl`	EPTAS for parallel identical machine scheduling with time restrictions. CoRR G. Jaykrishnan, Asaf Levin
2021	J	`jnl`	More on ordered open end bin packing. J. Sched. János Balogh, Leah Epstein, Asaf Levin
2021	J	`jnl`	Parameterized complexity of configuration integer programs. Oper. Res. Lett. Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn
2021	—	`conf`	Truly Asymptotic Lower Bounds for Online Vector Bin Packing. APPROX-RANDOM János Balogh, Ilan Reuven Cohen, Leah Epstein, Asaf Levin
2020	J	`jnl`	A note on a variant of the online open end bin packing problem. Oper. Res. Lett. Leah Epstein, Asaf Levin
2020	J	`jnl`	Algorithms and Complexity for Variants of Covariates Fine Balance. CoRR Dorit S. Hochbaum, Asaf Levin, Xu Rao
2020	J	`jnl`	More on ordered open end bin packing. CoRR János Balogh, Leah Epstein, Asaf Levin
2020	J	`jnl`	Online bin packing with cardinality constraints resolved. J. Comput. Syst. Sci. János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2020	J	`jnl`	Truly asymptotic lower bounds for online vector bin packing. CoRR János Balogh, Leah Epstein, Asaf Levin
2019	B	`conf`	A New Lower Bound for Classic Online Bin Packing. WAOA János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2019	J	`jnl`	A Unified Framework for Designing EPTAS for Load Balancing on Parallel Machines. Algorithmica Ishai Kones, Asaf Levin
2019	J	`jnl`	An Algorithmic Theory of Integer Programming. CoRR Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Asaf Levin, Shmuel Onn
2019	J	`jnl`	Approximation schemes for the generalized extensible bin packing problem. CoRR Asaf Levin
2019	J	`jnl`	Deadline TSP. Theor. Comput. Sci. Boaz Farbstein, Asaf Levin
2019	J	`jnl`	Hypergraphic Degree Sequences are Hard. CoRR Antoine Deza, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn
2019	J	`jnl`	Hypergraphic Degree Sequences are Hard. Bull. EATCS Antoine Deza, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn
2019	J	`jnl`	Lower Bounds for Several Online Variants of Bin Packing. Theory Comput. Syst. János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2019	J	`jnl`	Lower bounds for online bin covering-type problems. J. Sched. János Balogh, Leah Epstein, Asaf Levin
2019	J	`jnl`	Multitype Integer Monoid Optimization and Applications. CoRR Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn
2019	J	`jnl`	On the performance guarantee of First Fit for sum coloring. J. Comput. Syst. Sci. Leah Epstein, Asaf Levin
2019	A	`conf`	Online Bin Covering with Limited Migration. ESA Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder
2019	J	`jnl`	Online Bin Covering with Limited Migration. CoRR Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder
2019	J	`jnl`	Robust algorithms for total completion time. Discret. Optim. Leah Epstein, Asaf Levin
2018	A	`conf`	A New and Improved Algorithm for Online Bin Packing. ESA János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2018	A*	`conf`	A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs. ICALP Martin Koutecký, Asaf Levin, Shmuel Onn
2018	J	`jnl`	A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs. CoRR Martin Koutecký, Asaf Levin, Shmuel Onn
2018	C	`conf`	A Unified Framework for Designing EPTAS's for Load Balancing on Parallel Machines. CiE Ishai Kones, Asaf Levin
2018	J	`jnl`	A new lower bound for classic online bin packing. CoRR János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2018	J	`jnl`	A unified framework for designing EPTAS's for load balancing on parallel machines. CoRR Ishai Kones, Asaf Levin
2018	J	`jnl`	Batch Coloring of Graphs. Algorithmica Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
2018	J	`jnl`	Discounted Reward TSP. Algorithmica Boaz Farbstein, Asaf Levin
2018	J	`jnl`	Improved bounds for randomized preemptive online matching. Inf. Comput. Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann
2018	J	`jnl`	Lower bounds on the adaptivity gaps in variants of the stochastic knapsack problem. J. Comb. Optim. Asaf Levin, Aleksander Vainer
2018	J	`jnl`	Min-Sum Bin Packing. J. Comb. Optim. Leah Epstein, David S. Johnson, Asaf Levin
2018	J	`jnl`	Online-bounded analysis. J. Sched. Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
2018	J	`jnl`	Optimization over Degree Sequences. SIAM J. Discret. Math. Antoine Deza, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn
2018	J	`jnl`	The benefit of preemption with respect to the ℓp norm. Oper. Res. Lett. Leah Epstein, Asaf Levin
2018	J	`jnl`	Weighted matching with pair restrictions. Optim. Lett. Dorit S. Hochbaum, Asaf Levin
2017	J	`jnl`	A new and improved algorithm for online bin packing. CoRR János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2017	J	`jnl`	An AFPTAS for variable sized bin packing with general activation costs. J. Comput. Syst. Sci. Leah Epstein, Asaf Levin
2017	J	`jnl`	Approximate Shifted Combinatorial Optimization. CoRR Martin Koutecký, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn
2017	B	`conf`	Deadline TSP. WAOA Boaz Farbstein, Asaf Levin
2017	B	`conf`	Lower Bounds for Several Online Variants of Bin Packing. WAOA János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2017	J	`jnl`	Lower bounds for several online variants of bin packing. CoRR János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2017	J	`jnl`	Maximum coverage problem with group budget constraints. J. Comb. Optim. Boaz Farbstein, Asaf Levin
2017	J	`jnl`	On nonlinear multi-covering problems. J. Comb. Optim. Reuven Cohen, Mira Gonen, Asaf Levin, Shmuel Onn
2017	A	`conf`	Online Bin Packing with Cardinality Constraints Resolved. ESA János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2017	J	`jnl`	Optimization over Degree Sequences. CoRR Antoine Deza, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn
2017	J	`jnl`	Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines. SIAM J. Discret. Math. Leah Epstein, Asaf Levin, Alan J. Soper, Vitaly A. Strusevich
2016	J	`jnl`	A Unified Approach to Truthful Scheduling on Related Machines. Math. Oper. Res. Leah Epstein, Asaf Levin, Rob van Stee
2016	—	`ch.`	Approximation Schemes for Makespan Minimization. Encyclopedia of Algorithms Asaf Levin
2016	B	`conf`	Batch Coloring of Graphs. WAOA Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
2016	J	`jnl`	Batch Coloring of Graphs. CoRR Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
2016	Misc	`conf`	Online Bounded Analysis. CSR Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
2016	J	`jnl`	Online Bounded Analysis. CoRR Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
2016	J	`jnl`	Online bin packing with cardinality constraints resolved. CoRR János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
2016	J	`jnl`	Shifted matroid optimization. Oper. Res. Lett. Asaf Levin, Shmuel Onn
2016	J	`jnl`	The benefit of preemption for single machine scheduling so as to minimize total weighted completion time. Oper. Res. Lett. Leah Epstein, Asaf Levin
2016	J	`jnl`	Vertex Cover Meets Scheduling. Algorithmica Leah Epstein, Asaf Levin, Gerhard J. Woeginger
2015	J	`jnl`	Lexicographic Matroid Optimization. CoRR Asaf Levin, Shmuel Onn
2015	J	`jnl`	Min-max cover of a graph with a small number of parts. Discret. Optim. Boaz Farbstein, Asaf Levin
2015	J	`jnl`	Offline black and white bin packing. Theor. Comput. Sci. János Balogh, József Békési, György Dósa, Leah Epstein, Hans Kellerer, Asaf Levin, Zsolt Tuza
2015	J	`jnl`	Online File Caching with Rejection Penalties. Algorithmica Leah Epstein, Csanád Imreh, Asaf Levin, Judit Nagy-György
2015	J	`jnl`	The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases. Algorithmica Leah Epstein, Asaf Levin, Gerhard J. Woeginger
2015	J	`jnl`	The benefit of adaptivity in stochastic packing problems with probing. Theor. Comput. Sci. Asaf Levin, Aleksander Vainer
2014	J	`jnl`	Adaptivity in the stochastic blackjack knapsack problem. Theor. Comput. Sci. Asaf Levin, Aleksander Vainer
2014	J	`jnl`	An efficient polynomial time approximation scheme for load balancing on uniformly related machines. Math. Program. Leah Epstein, Asaf Levin
2014	J	`jnl`	Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees. J. Comb. Optim. Asaf Levin, Uri Yovel
2014	J	`jnl`	Minimum total weighted completion time: Faster approximation schemes. CoRR Leah Epstein, Asaf Levin
2014	J	`jnl`	Robust Algorithms for Preemptive Scheduling. Algorithmica Leah Epstein, Asaf Levin
2013	A*	`conf`	A unified approach to truthful scheduling on related machines. SODA Leah Epstein, Asaf Levin, Rob van Stee
2013	J	`jnl`	Approximation Algorithms for a Minimization Variant of the Order-Preserving Submatrices and for Biclustering Problems. ACM Trans. Algorithms Dorit S. Hochbaum, Asaf Levin
2013	J	`jnl`	Bin covering with cardinality constraints. Discret. Appl. Math. Leah Epstein, Csanád Imreh, Asaf Levin
2013	A	`conf`	Improved Bounds for Online Preemptive Matching. STACS Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann
2013	J	`jnl`	Nonoblivious 2-Opt heuristics for the traveling salesman problem. Networks Asaf Levin, Uri Yovel
2013	J	`jnl`	Online Clustering with Variable Sized Clusters. Algorithmica János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin
2013	J	`jnl`	Robust Approximation Schemes for Cube Packing. SIAM J. Optim. Leah Epstein, Asaf Levin
2013	J	`jnl`	The benefit of adaptivity in the stochastic knapsack problem with dependence on the state of nature. Discret. Optim. Asaf Levin, Aleksander Vainer
2012	J	`jnl`	A unified approach to truthful scheduling on related machines CoRR Leah Epstein, Asaf Levin, Rob van Stee
2012	J	`jnl`	An efficient polynomial time approximation scheme for load balancing on uniformly related machines CoRR Leah Epstein, Asaf Levin
2012	J	`jnl`	Approximation Schemes for Packing Splittable Items with Cardinality Constraints. Algorithmica Leah Epstein, Asaf Levin, Rob van Stee
2012	J	`jnl`	Bin packing with general cost structures. Math. Program. Leah Epstein, Asaf Levin
2012	J	`jnl`	Improved Bounds for Online Preemptive Matching CoRR Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann
2012	J	`jnl`	On Equilibria for ADM Minimization Games. Algorithmica Leah Epstein, Asaf Levin
2012	J	`jnl`	On the max coloring problem. Theor. Comput. Sci. Leah Epstein, Asaf Levin
2012	B	`conf`	The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases. WG Leah Epstein, Asaf Levin, Gerhard J. Woeginger
2012	J	`jnl`	Universal Sequencing on an Unreliable Machine. SIAM J. Comput. Leah Epstein, Asaf Levin, Alberto Marchetti-Spaccamela, Nicole Megow, Julián Mestre, Martin Skutella, Leen Stougie
2011	J	`jnl`	Graph coloring with rejection. J. Comput. Syst. Sci. Leah Epstein, Asaf Levin, Gerhard J. Woeginger
2011	J	`jnl`	Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model. SIAM J. Discret. Math. Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev
2011	J	`jnl`	Max-min Online Allocations with a Reordering Buffer. SIAM J. Discret. Math. Leah Epstein, Asaf Levin, Rob van Stee
2011	—	`conf`	On Variants of File Caching. ICALP (1) Leah Epstein, Csanád Imreh, Asaf Levin, Judit Nagy-György
2011	J	`jnl`	Online variable-sized bin packing with conflicts. Discret. Optim. Leah Epstein, Lene M. Favrholdt, Asaf Levin
2011	A	`conf`	Robust Algorithms for Preemptive Scheduling. ESA Leah Epstein, Asaf Levin
2011	J	`jnl`	Selfish bin coloring. J. Comb. Optim. Leah Epstein, Sven Oliver Krumke, Asaf Levin, Heike Sperber
2011	J	`jnl`	Uniform unweighted set cover: The power of non-oblivious local search. Theor. Comput. Sci. Asaf Levin, Uri Yovel
2010	J	`jnl`	AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items. SIAM J. Optim. Leah Epstein, Asaf Levin
2010	J	`jnl`	Class Constrained Bin Covering. Theory Comput. Syst. Leah Epstein, Csanád Imreh, Asaf Levin
2010	J	`jnl`	Class constrained bin packing revisited. Theor. Comput. Sci. Leah Epstein, Csanád Imreh, Asaf Levin
2010	J	`jnl`	Covering the edges of bipartite graphs using K Theor. Comput. Sci. Dorit S. Hochbaum, Asaf Levin
2010	A*	`conf`	Finding mobile data under delay constraints with searching costs. PODC Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng, Asaf Levin
2010	J	`jnl`	How to allocate review tasks for robust ranking. Acta Informatica Dorit S. Hochbaum, Asaf Levin
2010	A	`conf`	Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model. STACS Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev
2010	J	`jnl`	Improved randomized results for the interval selection problem. Theor. Comput. Sci. Leah Epstein, Asaf Levin
2010	—	`conf`	Max-min Online Allocations with a Reordering Buffer. ICALP (1) Leah Epstein, Asaf Levin, Rob van Stee
2010	J	`jnl`	Minimization of SONET ADMs in ring networks revisited. Computing Leah Epstein, Asaf Levin, Betzalel Menahem
2010	J	`jnl`	On the sum minimization version of the online bin covering problem. Discret. Appl. Math. János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin
2010	B	`conf`	Online Clustering with Variable Sized Clusters. MFCS János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin
2010	J	`jnl`	Randomized algorithms for online bounded bidding. Inf. Process. Lett. Leah Epstein, Asaf Levin
2010	J	`jnl`	Tight results for Next Fit and Worst Fit with resource augmentation. Theor. Comput. Sci. Joan Boyar, Leah Epstein, Asaf Levin
2010	B	`conf`	Universal Sequencing on a Single Machine. IPCO Leah Epstein, Asaf Levin, Alberto Marchetti-Spaccamela, Nicole Megow, Julián Mestre, Martin Skutella, Leen Stougie
2009	J	`jnl`	A generalized minimum cost ACM Trans. Algorithms Asaf Levin
2009	J	`jnl`	A robust APTAS for the classical bin packing problem. Math. Program. Leah Epstein, Asaf Levin
2009	J	`jnl`	AFPTAS results for common variants of bin packing: A new method to handle the small items CoRR Leah Epstein, Asaf Levin
2009	J	`jnl`	Approximating the minimum quadratic assignment problems. ACM Trans. Algorithms Refael Hassin, Asaf Levin, Maxim Sviridenko
2009	J	`jnl`	Approximation algorithms for maximum latency and partial cycle cover. Discret. Optim. Refael Hassin, Asaf Levin, Shlomi Rubinstein
2009	J	`jnl`	Better bounds for minimizing SONET ADMs. J. Comput. Syst. Sci. Leah Epstein, Asaf Levin
2009	J	`jnl`	Bin packing with general cost structures CoRR Leah Epstein, Asaf Levin
2009	J	`jnl`	Improved approximation guarantees for weighted matching in the semi-streaming model CoRR Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev
2009	J	`jnl`	Monotone Covering Problems with an Additional Covering Constraint. Math. Oper. Res. José R. Correa, Asaf Levin
2009	B	`conf`	On Equilibria for ADM Minimization Games. SAGT Leah Epstein, Asaf Levin
2009	J	`jnl`	Online Capacitated Interval Coloring. SIAM J. Discret. Math. Leah Epstein, Thomas Erlebach, Asaf Levin
2009	J	`jnl`	The multi-integer set cover and the facility terminal cover problem. Networks Dorit S. Hochbaum, Asaf Levin
2009	J	`jnl`	Uniform unweighted set cover: The power of non-oblivious local search CoRR Asaf Levin, Uri Yovel
2009	J	`jnl`	Variable Sized Online Interval Coloring with Bandwidth. Algorithmica Leah Epstein, Thomas Erlebach, Asaf Levin
2009	J	`jnl`	Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs. Algorithmica Leah Epstein, Magnús M. Halldórsson, Asaf Levin, Hadas Shachnai
2008	J	`jnl`	A Faster, Better Approximation Algorithm for the Minimum Latency Problem. SIAM J. Comput. Aaron Archer, Asaf Levin, David P. Williamson
2008	J	`jnl`	A PTAS for delay minimization in establishing wireless conference calls. Discret. Optim. Leah Epstein, Asaf Levin
2008	J	`jnl`	An APTAS for Generalized Cost Variable-Sized Bin Packing. SIAM J. Comput. Leah Epstein, Asaf Levin
2008	J	`jnl`	Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search. SIAM J. Discret. Math. Asaf Levin
2008	J	`jnl`	Approximation algorithm for minimizing total latency in machine scheduling with deliveries. Discret. Optim. Asaf Levin, Michal Penn
2008	J	`jnl`	Asymptotic fully polynomial approximation schemes for variants of open-end bin packing. Inf. Process. Lett. Leah Epstein, Asaf Levin
2008	A	`conf`	Improved Randomized Results for That Interval Selection Problem. ESA Leah Epstein, Asaf Levin
2008	J	`jnl`	More on online bin packing with two item sizes. Discret. Optim. Leah Epstein, Asaf Levin
2008	J	`jnl`	On Bin Packing with Conflicts. SIAM J. Optim. Leah Epstein, Asaf Levin
2008	J	`jnl`	Online unit clustering: Variations on a theme. Theor. Comput. Sci. Leah Epstein, Asaf Levin, Rob van Stee
2008	J	`jnl`	The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases. Networks Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger
2008	J	`jnl`	The computational complexity of graph contractions II: Two tough polynomially solvable cases. Networks Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger
2008	J	`jnl`	Two-dimensional packing with conflicts. Acta Informatica Leah Epstein, Asaf Levin, Rob van Stee
2007	—	`conf`	Approximating min-max k-clustering. Fair Division Asaf Levin
2007	J	`jnl`	Approximation and heuristic algorithms for minimum-delay application-layer multicast trees. IEEE/ACM Trans. Netw. Eli Brosh, Asaf Levin, Yuval Shavitt
2007	B	`conf`	Covering the Edges of Bipartite Graphs Using WAOA Dorit S. Hochbaum, Asaf Levin
2007	J	`jnl`	Flow trees for vertex-capacitated networks. Discret. Appl. Math. Refael Hassin, Asaf Levin
2007	B	`conf`	Minimum Weighted Sum Bin Packing. WAOA Leah Epstein, Asaf Levin
2007	B	`conf`	Multi-dimensional Packing with Conflicts. FCT Leah Epstein, Asaf Levin, Rob van Stee
2007	B	`conf`	On the Max Coloring Problem. WAOA Leah Epstein, Asaf Levin
2007	—	`conf`	Online Capacitated Interval Coloring. ESCAPE Leah Epstein, Thomas Erlebach, Asaf Levin
2007	J	`jnl`	SONET ADMs Minimization with Divisible Paths. Algorithmica Leah Epstein, Asaf Levin
2007	J	`jnl`	The finite horizon investor problem with a budget constraint. Inf. Process. Lett. Asaf Levin
2006	—	`conf`	A Robust APTAS for the Classical Bin Packing Problem. ICALP (1) Leah Epstein, Asaf Levin
2006	B	`conf`	Approximating the Unweighted WAOA Asaf Levin
2006	J	`jnl`	Approximations for minimum and min-max vehicle routing problems. J. Algorithms Esther M. Arkin, Refael Hassin, Asaf Levin
2006	J	`jnl`	Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms. Discret. Optim. Dorit S. Hochbaum, Asaf Levin
2006	A	`conf`	Graph Coloring with Rejection. ESA Leah Epstein, Asaf Levin, Gerhard J. Woeginger
2006	J	`jnl`	Methodologies and Algorithms for Group-Rankings Decision. Manag. Sci. Dorit S. Hochbaum, Asaf Levin
2006	B	`conf`	On Bin Packing with Conflicts. WAOA Leah Epstein, Asaf Levin
2006	J	`jnl`	Optimizing over Consecutive 1's and Circular 1's Constraints. SIAM J. Optim. Dorit S. Hochbaum, Asaf Levin
2006	J	`jnl`	Partial multicuts in trees. Theor. Comput. Sci. Asaf Levin, Danny Segev
2006	J	`jnl`	Real time scheduling with a budget: Parametric-search is better than binary search. Inf. Process. Lett. Asaf Levin
2006	B	`conf`	The WAOA Dorit S. Hochbaum, Asaf Levin
2006	J	`jnl`	The conference call search problem in wireless networks. Theor. Comput. Sci. Leah Epstein, Asaf Levin
2006	J	`jnl`	The constrained minimum weighted sum of job completion times problem. Math. Program. Asaf Levin, Gerhard J. Woeginger
2006	J	`jnl`	The minimum generalized vertex cover problem. ACM Trans. Algorithms Refael Hassin, Asaf Levin
2006	—	`conf`	Variable Sized Online Interval Coloring with Bandwidth. SWAT Leah Epstein, Thomas Erlebach, Asaf Levin
2006	—	`conf`	Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs. APPROX-RANDOM Leah Epstein, Magnús M. Halldórsson, Asaf Levin, Hadas Shachnai
2005	J	`jnl`	A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem. SIAM J. Comput. Refael Hassin, Asaf Levin
2005	A	`conf`	An Approximation Algorithm for the Minimum Latency Set Cover Problem. ESA Refael Hassin, Asaf Levin
2005	J	`jnl`	Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem. Algorithmica Jochen Könemann, Asaf Levin, Amitabh Sinha
2005	J	`jnl`	Approximation Algorithms for Quickest Spanning Tree Problems. Algorithmica Refael Hassin, Asaf Levin
2005	B	`conf`	Partial Multicuts in Trees. WAOA Asaf Levin, Danny Segev
2005	B	`conf`	SONET ADMs Minimization with Divisible Paths. WAOA Leah Epstein, Asaf Levin
2005	B	`conf`	The Conference Call Search Problem in Wireless Networks. WAOA Leah Epstein, Asaf Levin
2005	J	`jnl`	The chord version for SONET ADMs minimization. Theor. Comput. Sci. Leah Epstein, Asaf Levin
2005	—	`conf`	Tracking mobile users. Algorithms for Optimization with Incomplete Information Leah Epstein, Asaf Levin
2004	B	`conf`	A PTAS for Delay Minimization in Establishing Wireless Conference Calls. WAOA Leah Epstein, Asaf Levin
2004	J	`jnl`	A better approximation algorithm for the budget prize collecting tree problem. Oper. Res. Lett. Asaf Levin
2004	J	`jnl`	An efficient polynomial time approximation scheme for the constrained minimum spanning tree problem using matroid intersection. SIAM J. Comput. Refael Hassin, Asaf Levin
2004	A	`conf`	Approximation Algorithms for Quickest Spanning Tree Problems. ESA Refael Hassin, Asaf Levin
2004	B	`conf`	Better Bounds for Minimizing SONET ADMs. WAOA Leah Epstein, Asaf Levin
2004	J	`jnl`	Minimum restricted diameter spanning trees. Discret. Appl. Math. Refael Hassin, Asaf Levin
2004	J	`jnl`	Strongly polynomial-time approximation for a class of bicriteria problems. Oper. Res. Lett. Asaf Levin
2004	J	`jnl`	Synthesis of 2-Commodity Flow Networks. Math. Oper. Res. Refael Hassin, Asaf Levin
2004	B	`conf`	The Constrained Minimum Weighted Sum of Job Completion Times Problem. IPCO Asaf Levin, Gerhard J. Woeginger
2003	—	`conf`	Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem. RANDOM-APPROX Jochen Könemann, Asaf Levin, Amitabh Sinha
2003	J	`jnl`	Lexicographic local search and the p. Eur. J. Oper. Res. Refael Hassin, Asaf Levin, Dana Morad
2003	J	`jnl`	Minimum spanning tree with hop restrictions. J. Algorithms Refael Hassin, Asaf Levin
2003	J	`jnl`	Subgraphs decomposable into two trees and k-edge-connected subgraphs. Discret. Appl. Math. Refael Hassin, Asaf Levin
2003	B	`conf`	The Complexity of Graph Contractions. WG Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger
2003	A	`conf`	The Minimum Generalized Vertex Cover Problem. ESA Refael Hassin, Asaf Levin
2003	J	`jnl`	The SONET edge-partition problem. Networks Olivier Goldschmidt, Dorit S. Hochbaum, Asaf Levin, Eli V. Olinick
2002	J	`jnl`	Approximation algorithms for constructing wavelength routing networks. Networks Refael Hassin, Asaf Levin
2002	—	`conf`	Minimum Restricted Diameter Spanning Trees. APPROX Refael Hassin, Asaf Levin
2001	B	`conf`	Synthesis of 2-Commodity Flow Networks. IPCO Refael Hassin, Asaf Levin