Asaf Levin

According to our database1, Asaf Levin
  • authored at least 149 papers between 2001 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines.
SIAM J. Discrete Math., 2017

An AFPTAS for variable sized bin packing with general activation costs.
J. Comput. Syst. Sci., 2017

On nonlinear multi-covering problems.
J. Comb. Optim., 2017

Lower bounds for several online variants of bin packing.
CoRR, 2017

Approximate Shifted Combinatorial Optimization.
CoRR, 2017

A new and improved algorithm for online bin packing.
CoRR, 2017

2016
Approximation Schemes for Makespan Minimization.
Encyclopedia of Algorithms, 2016

Shifted matroid optimization.
Oper. Res. Lett., 2016

The benefit of preemption for single machine scheduling so as to minimize total weighted completion time.
Oper. Res. Lett., 2016

A Unified Approach to Truthful Scheduling on Related Machines.
Math. Oper. Res., 2016

Batch Coloring of Graphs.
CoRR, 2016

Online Bounded Analysis.
CoRR, 2016

Online bin packing with cardinality constraints resolved.
CoRR, 2016

Vertex Cover Meets Scheduling.
Algorithmica, 2016

Batch Coloring of Graphs.
Proceedings of the Approximation and Online Algorithms - 14th International Workshop, 2016

Online Bounded Analysis.
Proceedings of the Computer Science - Theory and Applications, 2016

2015
The benefit of adaptivity in stochastic packing problems with probing.
Theor. Comput. Sci., 2015

Offline black and white bin packing.
Theor. Comput. Sci., 2015

Min-max cover of a graph with a small number of parts.
Discrete Optimization, 2015

Lexicographic Matroid Optimization.
CoRR, 2015

The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases.
Algorithmica, 2015

Online File Caching with Rejection Penalties.
Algorithmica, 2015

2014
Adaptivity in the stochastic blackjack knapsack problem.
Theor. Comput. Sci., 2014

An efficient polynomial time approximation scheme for load balancing on uniformly related machines.
Math. Program., 2014

Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees.
J. Comb. Optim., 2014

Minimum total weighted completion time: Faster approximation schemes.
CoRR, 2014

Robust Algorithms for Preemptive Scheduling.
Algorithmica, 2014

2013
Approximation Algorithms for a Minimization Variant of the Order-Preserving Submatrices and for Biclustering Problems.
ACM Trans. Algorithms, 2013

Robust Approximation Schemes for Cube Packing.
SIAM Journal on Optimization, 2013

Nonoblivious 2-Opt heuristics for the traveling salesman problem.
Networks, 2013

The benefit of adaptivity in the stochastic knapsack problem with dependence on the state of nature.
Discrete Optimization, 2013

Bin covering with cardinality constraints.
Discrete Applied Mathematics, 2013

Online Clustering with Variable Sized Clusters.
Algorithmica, 2013

Improved Bounds for Online Preemptive Matching.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

A unified approach to truthful scheduling on related machines.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2012
On the max coloring problem.
Theor. Comput. Sci., 2012

Universal Sequencing on an Unreliable Machine.
SIAM J. Comput., 2012

Bin packing with general cost structures.
Math. Program., 2012

A unified approach to truthful scheduling on related machines
CoRR, 2012

Improved Bounds for Online Preemptive Matching
CoRR, 2012

An efficient polynomial time approximation scheme for load balancing on uniformly related machines
CoRR, 2012

Approximation Schemes for Packing Splittable Items with Cardinality Constraints.
Algorithmica, 2012

On Equilibria for ADM Minimization Games.
Algorithmica, 2012

The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

2011
Uniform unweighted set cover: The power of non-oblivious local search.
Theor. Comput. Sci., 2011

Max-min Online Allocations with a Reordering Buffer.
SIAM J. Discrete Math., 2011

Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model.
SIAM J. Discrete Math., 2011

Graph coloring with rejection.
J. Comput. Syst. Sci., 2011

Selfish bin coloring.
J. Comb. Optim., 2011

Online variable-sized bin packing with conflicts.
Discrete Optimization, 2011

On Variants of File Caching.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Robust Algorithms for Preemptive Scheduling.
Proceedings of the Algorithms - ESA 2011, 2011

2010
Covering the edges of bipartite graphs using K2, 2 graphs.
Theor. Comput. Sci., 2010

Improved randomized results for the interval selection problem.
Theor. Comput. Sci., 2010

Class constrained bin packing revisited.
Theor. Comput. Sci., 2010

Tight results for Next Fit and Worst Fit with resource augmentation.
Theor. Comput. Sci., 2010

AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items.
SIAM Journal on Optimization, 2010

Class Constrained Bin Covering.
Theory Comput. Syst., 2010

Randomized algorithms for online bounded bidding.
Inf. Process. Lett., 2010

On the sum minimization version of the online bin covering problem.
Discrete Applied Mathematics, 2010

Minimization of SONET ADMs in ring networks revisited.
Computing, 2010

How to allocate review tasks for robust ranking.
Acta Inf., 2010

Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model.
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Finding mobile data under delay constraints with searching costs.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Online Clustering with Variable Sized Clusters.
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

Universal Sequencing on a Single Machine.
Proceedings of the Integer Programming and Combinatorial Optimization, 2010

Max-min Online Allocations with a Reordering Buffer.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009
A generalized minimum cost k-clustering.
ACM Trans. Algorithms, 2009

Approximating the minimum quadratic assignment problems.
ACM Trans. Algorithms, 2009

Online Capacitated Interval Coloring.
SIAM J. Discrete Math., 2009

The multi-integer set cover and the facility terminal cover problem.
Networks, 2009

A robust APTAS for the classical bin packing problem.
Math. Program., 2009

Monotone Covering Problems with an Additional Covering Constraint.
Math. Oper. Res., 2009

Better bounds for minimizing SONET ADMs.
J. Comput. Syst. Sci., 2009

Approximation algorithms for maximum latency and partial cycle cover.
Discrete Optimization, 2009

Improved approximation guarantees for weighted matching in the semi-streaming model
CoRR, 2009

Bin packing with general cost structures
CoRR, 2009

AFPTAS results for common variants of bin packing: A new method to handle the small items
CoRR, 2009

Uniform unweighted set cover: The power of non-oblivious local search
CoRR, 2009

Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs.
Algorithmica, 2009

Variable Sized Online Interval Coloring with Bandwidth.
Algorithmica, 2009

On Equilibria for ADM Minimization Games.
Proceedings of the Algorithmic Game Theory, Second International Symposium, 2009

2008
Online unit clustering: Variations on a theme.
Theor. Comput. Sci., 2008

On Bin Packing with Conflicts.
SIAM Journal on Optimization, 2008

Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search.
SIAM J. Discrete Math., 2008

An APTAS for Generalized Cost Variable-Sized Bin Packing.
SIAM J. Comput., 2008

A Faster, Better Approximation Algorithm for the Minimum Latency Problem.
SIAM J. Comput., 2008

The computational complexity of graph contractions II: Two tough polynomially solvable cases.
Networks, 2008

The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases.
Networks, 2008

Asymptotic fully polynomial approximation schemes for variants of open-end bin packing.
Inf. Process. Lett., 2008

Approximation algorithm for minimizing total latency in machine scheduling with deliveries.
Discrete Optimization, 2008

More on online bin packing with two item sizes.
Discrete Optimization, 2008

A PTAS for delay minimization in establishing wireless conference calls.
Discrete Optimization, 2008

Two-dimensional packing with conflicts.
Acta Inf., 2008

Improved Randomized Results for That Interval Selection Problem.
Proceedings of the Algorithms, 2008

2007
Approximation and heuristic algorithms for minimum-delay application-layer multicast trees.
IEEE/ACM Trans. Netw., 2007

The finite horizon investor problem with a budget constraint.
Inf. Process. Lett., 2007

Flow trees for vertex-capacitated networks.
Discrete Applied Mathematics, 2007

SONET ADMs Minimization with Divisible Paths.
Algorithmica, 2007

Covering the Edges of Bipartite Graphs Using K 2, 2 Graphs.
Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007

Minimum Weighted Sum Bin Packing.
Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007

On the Max Coloring Problem.
Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007

Multi-dimensional Packing with Conflicts.
Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

Online Capacitated Interval Coloring.
Proceedings of the Combinatorics, 2007

Approximating min-max k-clustering.
Proceedings of the Fair Division, 24.06. - 29.06.2007, 2007

2006
Partial multicuts in trees.
Theor. Comput. Sci., 2006

The conference call search problem in wireless networks.
Theor. Comput. Sci., 2006

The minimum generalized vertex cover problem.
ACM Trans. Algorithms, 2006

Optimizing over Consecutive 1's and Circular 1's Constraints.
SIAM Journal on Optimization, 2006

The constrained minimum weighted sum of job completion times problem.
Math. Program., 2006

Methodologies and Algorithms for Group-Rankings Decision.
Management Science, 2006

Approximations for minimum and min-max vehicle routing problems.
J. Algorithms, 2006

Real time scheduling with a budget: Parametric-search is better than binary search.
Inf. Process. Lett., 2006

Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms.
Discrete Optimization, 2006

Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search.
Proceedings of the Approximation and Online Algorithms, 4th International Workshop, 2006

The k-Allocation Problem and Its Variants.
Proceedings of the Approximation and Online Algorithms, 4th International Workshop, 2006

On Bin Packing with Conflicts.
Proceedings of the Approximation and Online Algorithms, 4th International Workshop, 2006

Variable Sized Online Interval Coloring with Bandwidth.
Proceedings of the Algorithm Theory, 2006

A Robust APTAS for the Classical Bin Packing Problem.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Graph Coloring with Rejection.
Proceedings of the Algorithms, 2006

Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs.
Proceedings of the Approximation, 2006

2005
The chord version for SONET ADMs minimization.
Theor. Comput. Sci., 2005

A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem.
SIAM J. Comput., 2005

Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem.
Algorithmica, 2005

Approximation Algorithms for Quickest Spanning Tree Problems.
Algorithmica, 2005

Partial Multicuts in Trees.
Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

The Conference Call Search Problem in Wireless Networks.
Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

SONET ADMs Minimization with Divisible Paths.
Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

An Approximation Algorithm for the Minimum Latency Set Cover Problem.
Proceedings of the Algorithms, 2005

Tracking mobile users.
Proceedings of the Algorithms for Optimization with Incomplete Information, 2005

2004
An efficient polynomial time approximation scheme for the constrained minimum spanning tree problem using matroid intersection.
SIAM J. Comput., 2004

Strongly polynomial-time approximation for a class of bicriteria problems.
Oper. Res. Lett., 2004

A better approximation algorithm for the budget prize collecting tree problem.
Oper. Res. Lett., 2004

Synthesis of 2-Commodity Flow Networks.
Math. Oper. Res., 2004

Minimum restricted diameter spanning trees.
Discrete Applied Mathematics, 2004

Better Bounds for Minimizing SONET ADMs.
Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

A PTAS for Delay Minimization in Establishing Wireless Conference Calls.
Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

The Constrained Minimum Weighted Sum of Job Completion Times Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 2004

Approximation Algorithms for Quickest Spanning Tree Problems.
Proceedings of the Algorithms, 2004

2003
The SONET edge-partition problem.
Networks, 2003

Minimum spanning tree with hop restrictions.
J. Algorithms, 2003

Lexicographic local search and the p.
European Journal of Operational Research, 2003

Subgraphs decomposable into two trees and k-edge-connected subgraphs.
Discrete Applied Mathematics, 2003

The Complexity of Graph Contractions.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem.
Proceedings of the Approximation, 2003

The Minimum Generalized Vertex Cover Problem.
Proceedings of the Algorithms, 2003

2002
Approximation algorithms for constructing wavelength routing networks.
Networks, 2002

Minimum Restricted Diameter Spanning Trees.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002

2001
Synthesis of 2-Commodity Flow Networks.
Proceedings of the Integer Programming and Combinatorial Optimization, 2001


  Loading...