Asaf Levin

ORCID

Publication Activity (10 Years)

Years Active: 2001-2023
Publications (10 Years): 87

Top Venues

Publications

Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder
Online cardinality constrained scheduling. Oper. Res. Lett. 51 (5) (2023)
G. Jaykrishnan, Asaf Levin
Scheduling with cardinality dependent unavailability periods. CoRR (2023)
Asaf Levin
Online Minimization of the Maximum Starting Time: Migration Helps. Algorithmica 85 (8) (2023)
Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder
Online bin covering with limited migration. J. Comput. Syst. Sci. 134 (2023)
Asaf Levin, Tal Shusterman
Weighted throughput in a single machine preemptive scheduling with continuous controllable processing times. Acta Informatica 60 (2) (2023)
Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Asaf Levin, Shmuel Onn
Reducibility bounds of objective functions over the integers. Oper. Res. Lett. 51 (6) (2023)
Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn
High-multiplicity N-fold IP via configuration LP. Math. Program. 200 (1) (2023)
G. Jaykrishnan, Asaf Levin
EPTAS for load balancing problem on parallel machines with a non-renewable resource. Discret. Optim. 48 (Part 1) (2023)
G. Jaykrishnan, Asaf Levin
EPTAS for the dual of splittable bin packing with cardinality constraint. Theor. Comput. Sci. 979 (2023)
Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder
Cardinality Constrained Scheduling in Online Models. STACS (2022)
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
Lower bounds for batched bin packing. J. Comb. Optim. 43 (3) (2022)
Asaf Levin
Comparing the costs of Any Fit algorithms for bin packing. Oper. Res. Lett. 50 (6) (2022)
Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder
Cardinality Constrained Scheduling in Online Models. CoRR (2022)
G. Jaykrishnan, Asaf Levin
EPTAS for the dual of splittable bin packing with cardinality constraint. CoRR (2022)
Martin Koutecký, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn
Approximate separable multichoice optimization over monotone systems. Discret. Optim. 44 (Part) (2022)
Asaf Levin
Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes. Inf. Process. Lett. 174 (2022)
Asaf Levin
The near exact bin covering problem. CoRR (2022)
Asaf Levin
Approximation Schemes for the Generalized Extensible Bin Packing Problem. Algorithmica 84 (2) (2022)
Leah Epstein, Asaf Levin
Starting time minimization for the maximum job variant. Discret. Appl. Math. 307 (2022)
Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn
Parameterized complexity of configuration integer programs. Oper. Res. Lett. 49 (6) (2021)
János Balogh, Leah Epstein, Asaf Levin
More on ordered open end bin packing. J. Sched. 24 (6) (2021)
G. Jaykrishnan, Asaf Levin
EPTAS for load balancing problem on parallel machines with a non-renewable resource. CoRR (2021)
G. Jaykrishnan, Asaf Levin
EPTAS for Load Balancing Problem on Parallel Machines with a Non-renewable Resource. WAOA (2021)
János Balogh, Ilan Reuven Cohen, Leah Epstein, Asaf Levin
Truly Asymptotic Lower Bounds for Online Vector Bin Packing. APPROX-RANDOM (2021)
G. Jaykrishnan, Asaf Levin
EPTAS for parallel identical machine scheduling with time restrictions. CoRR (2021)
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
A New Lower Bound for Classic Online Bin Packing. Algorithmica 83 (7) (2021)
Dorit S. Hochbaum, Asaf Levin, Xu Rao
Complexity, algorithms and applications of the integer network flow with fractional supplies problem. Oper. Res. Lett. 49 (4) (2021)
Leah Epstein, Asaf Levin
A note on a variant of the online open end bin packing problem. Oper. Res. Lett. 48 (6) (2020)
János Balogh, Leah Epstein, Asaf Levin
More on ordered open end bin packing. CoRR (2020)
János Balogh, Leah Epstein, Asaf Levin
Truly asymptotic lower bounds for online vector bin packing. CoRR (2020)
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
Online bin packing with cardinality constraints resolved. J. Comput. Syst. Sci. 112 (2020)
Dorit S. Hochbaum, Asaf Levin, Xu Rao
Algorithms and Complexity for Variants of Covariates Fine Balance. CoRR (2020)
Antoine Deza, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn
Hypergraphic Degree Sequences are Hard. CoRR (2019)
Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder
Online Bin Covering with Limited Migration. CoRR (2019)
Boaz Farbstein, Asaf Levin
Deadline TSP. Theor. Comput. Sci. 771 (2019)
János Balogh, Leah Epstein, Asaf Levin
Lower bounds for online bin covering-type problems. J. Sched. 22 (4) (2019)
Leah Epstein, Asaf Levin
Robust algorithms for total completion time. Discret. Optim. 33 (2019)
Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn
Multitype Integer Monoid Optimization and Applications. CoRR (2019)
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
Lower Bounds for Several Online Variants of Bin Packing. Theory Comput. Syst. 63 (8) (2019)
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
A New Lower Bound for Classic Online Bin Packing. WAOA (2019)
Leah Epstein, Asaf Levin
On the performance guarantee of First Fit for sum coloring. J. Comput. Syst. Sci. 99 (2019)
Antoine Deza, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn
Hypergraphic Degree Sequences are Hard. Bull. EATCS 127 (2019)
Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder
Online Bin Covering with Limited Migration. ESA (2019)
Ishai Kones, Asaf Levin
A Unified Framework for Designing EPTAS for Load Balancing on Parallel Machines. Algorithmica 81 (7) (2019)
Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Asaf Levin, Shmuel Onn
An Algorithmic Theory of Integer Programming. CoRR (2019)
Asaf Levin
Approximation schemes for the generalized extensible bin packing problem. CoRR (2019)
Martin Koutecký, Asaf Levin, Shmuel Onn
A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs. ICALP (2018)
Antoine Deza, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn
Optimization over Degree Sequences. SIAM J. Discret. Math. 32 (3) (2018)
Leah Epstein, Asaf Levin
The benefit of preemption with respect to the ℓp norm. Oper. Res. Lett. 46 (4) (2018)
Boaz Farbstein, Asaf Levin
Discounted Reward TSP. Algorithmica 80 (2) (2018)
Asaf Levin, Aleksander Vainer
Lower bounds on the adaptivity gaps in variants of the stochastic knapsack problem. J. Comb. Optim. 35 (3) (2018)
Leah Epstein, David S. Johnson, Asaf Levin
Min-Sum Bin Packing. J. Comb. Optim. 36 (2) (2018)
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
Online-bounded analysis. J. Sched. 21 (4) (2018)
Ishai Kones, Asaf Levin
A Unified Framework for Designing EPTAS's for Load Balancing on Parallel Machines. CiE (2018)
Martin Koutecký, Asaf Levin, Shmuel Onn
A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs. CoRR (2018)
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
A New and Improved Algorithm for Online Bin Packing. ESA (2018)
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
Batch Coloring of Graphs. Algorithmica 80 (11) (2018)
Dorit S. Hochbaum, Asaf Levin
Weighted matching with pair restrictions. Optim. Lett. 12 (3) (2018)
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
A new lower bound for classic online bin packing. CoRR (2018)
Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann
Improved bounds for randomized preemptive online matching. Inf. Comput. 259 (1) (2018)
Ishai Kones, Asaf Levin
A unified framework for designing EPTAS's for load balancing on parallel machines. CoRR (2018)
Boaz Farbstein, Asaf Levin
Deadline TSP. WAOA (2017)
Martin Koutecký, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn
Approximate Shifted Combinatorial Optimization. CoRR (2017)
Leah Epstein, Asaf Levin, Alan J. Soper, Vitaly A. Strusevich
Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines. SIAM J. Discret. Math. 31 (1) (2017)
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
Online Bin Packing with Cardinality Constraints Resolved. ESA (2017)
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
A new and improved algorithm for online bin packing. CoRR (2017)
Boaz Farbstein, Asaf Levin
Maximum coverage problem with group budget constraints. J. Comb. Optim. 34 (3) (2017)
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
Lower Bounds for Several Online Variants of Bin Packing. WAOA (2017)
Antoine Deza, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn
Optimization over Degree Sequences. CoRR (2017)
Leah Epstein, Asaf Levin
An AFPTAS for variable sized bin packing with general activation costs. J. Comput. Syst. Sci. 84 (2017)
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
Lower bounds for several online variants of bin packing. CoRR (2017)
Reuven Cohen, Mira Gonen, Asaf Levin, Shmuel Onn
On nonlinear multi-covering problems. J. Comb. Optim. 33 (2) (2017)
Leah Epstein, Asaf Levin, Rob van Stee
A Unified Approach to Truthful Scheduling on Related Machines. Math. Oper. Res. 41 (1) (2016)
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
Online Bounded Analysis. CoRR (2016)
Leah Epstein, Asaf Levin
The benefit of preemption for single machine scheduling so as to minimize total weighted completion time. Oper. Res. Lett. 44 (6) (2016)
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
Online Bounded Analysis. CSR (2016)
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
Batch Coloring of Graphs. WAOA (2016)
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
Batch Coloring of Graphs. CoRR (2016)
Asaf Levin, Shmuel Onn
Shifted matroid optimization. Oper. Res. Lett. 44 (4) (2016)
János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin
Online bin packing with cardinality constraints resolved. CoRR (2016)
Leah Epstein, Asaf Levin, Gerhard J. Woeginger
Vertex Cover Meets Scheduling. Algorithmica 74 (3) (2016)
Asaf Levin, Shmuel Onn
Lexicographic Matroid Optimization. CoRR (2015)
Leah Epstein, Asaf Levin, Gerhard J. Woeginger
The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases. Algorithmica 72 (4) (2015)
Boaz Farbstein, Asaf Levin
Min-max cover of a graph with a small number of parts. Discret. Optim. 16 (2015)
Leah Epstein, Csanád Imreh, Asaf Levin, Judit Nagy-György
Online File Caching with Rejection Penalties. Algorithmica 71 (2) (2015)
Asaf Levin, Aleksander Vainer
The benefit of adaptivity in stochastic packing problems with probing. Theor. Comput. Sci. 562 (2015)
János Balogh, József Békési, György Dósa, Leah Epstein, Hans Kellerer, Asaf Levin, Zsolt Tuza
Offline black and white bin packing. Theor. Comput. Sci. 596 (2015)
Leah Epstein, Asaf Levin
Minimum total weighted completion time: Faster approximation schemes. CoRR (2014)
Asaf Levin, Uri Yovel
Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees. J. Comb. Optim. 28 (4) (2014)
Leah Epstein, Asaf Levin
Robust Algorithms for Preemptive Scheduling. Algorithmica 69 (1) (2014)
Leah Epstein, Asaf Levin
An efficient polynomial time approximation scheme for load balancing on uniformly related machines. Math. Program. 147 (1-2) (2014)
Asaf Levin, Aleksander Vainer
Adaptivity in the stochastic blackjack knapsack problem. Theor. Comput. Sci. 516 (2014)
János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin
Online Clustering with Variable Sized Clusters. Algorithmica 65 (2) (2013)
Asaf Levin, Aleksander Vainer
The benefit of adaptivity in the stochastic knapsack problem with dependence on the state of nature. Discret. Optim. 10 (2) (2013)
Asaf Levin, Uri Yovel
Nonoblivious 2-Opt heuristics for the traveling salesman problem. Networks 62 (3) (2013)
Leah Epstein, Asaf Levin
Robust Approximation Schemes for Cube Packing. SIAM J. Optim. 23 (2) (2013)
Leah Epstein, Asaf Levin, Rob van Stee
A unified approach to truthful scheduling on related machines. SODA (2013)
Leah Epstein, Csanád Imreh, Asaf Levin
Bin covering with cardinality constraints. Discret. Appl. Math. 161 (13-14) (2013)
Dorit S. Hochbaum, Asaf Levin
Approximation Algorithms for a Minimization Variant of the Order-Preserving Submatrices and for Biclustering Problems. ACM Trans. Algorithms 9 (2) (2013)
Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann
Improved Bounds for Online Preemptive Matching. STACS (2013)

Asaf Levin.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Asaf Levin