Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAsaf Levin
Person information
- affiliation: Technion, Faculty of Industrial Engineering and Management, Haifa, Israel
- affiliation (former): Tel-Aviv University, Department of Statistics and Operations Research, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j128]Asaf Levin
, Tal Shusterman:
Weighted throughput in a single machine preemptive scheduling with continuous controllable processing times. Acta Informatica 60(2): 101-122 (2023)- [j127]Asaf Levin:
Online Minimization of the Maximum Starting Time: Migration Helps. Algorithmica 85(8): 2238-2259 (2023) - [j126]G. Jaykrishnan, Asaf Levin:
EPTAS for load balancing problem on parallel machines with a non-renewable resource. Discret. Optim. 48(Part 1): 100775 (2023) - [j125]Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder:
Online bin covering with limited migration. J. Comput. Syst. Sci. 134: 42-72 (2023) - [j124]Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn:
High-multiplicity N-fold IP via configuration LP. Math. Program. 200(1): 199-227 (2023) - [j123]Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder:
Online cardinality constrained scheduling. Oper. Res. Lett. 51(5): 533-539 (2023) - [j122]G. Jaykrishnan, Asaf Levin:
EPTAS for the dual of splittable bin packing with cardinality constraint. Theor. Comput. Sci. 979: 114202 (2023) - [i35]G. Jaykrishnan, Asaf Levin:
Scheduling with cardinality dependent unavailability periods. CoRR abs/2306.10904 (2023) - 2022
- [j121]Asaf Levin:
Approximation Schemes for the Generalized Extensible Bin Packing Problem. Algorithmica 84(2): 325-343 (2022) - [j120]Leah Epstein, Asaf Levin:
Starting time minimization for the maximum job variant. Discret. Appl. Math. 307: 79-87 (2022) - [j119]Martin Koutecký, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn:
Approximate separable multichoice optimization over monotone systems. Discret. Optim. 44(Part): 100629 (2022) - [j118]Asaf Levin:
Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes. Inf. Process. Lett. 174: 106211 (2022) - [j117]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): 613-629 (2022) - [j116]Asaf Levin:
Comparing the costs of Any Fit algorithms for bin packing. Oper. Res. Lett. 50(6): 646-649 (2022) - [c50]Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder:
Cardinality Constrained Scheduling in Online Models. STACS 2022: 28:1-28:15 - [i34]Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder:
Cardinality Constrained Scheduling in Online Models. CoRR abs/2201.05113 (2022) - [i33]Asaf Levin:
The near exact bin covering problem. CoRR abs/2202.10904 (2022) - [i32]G. Jaykrishnan, Asaf Levin:
EPTAS for the dual of splittable bin packing with cardinality constraint. CoRR abs/2204.04685 (2022) - 2021
- [j115]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): 2047-2062 (2021) - [j114]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): 559-564 (2021) - [j113]Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn:
Parameterized complexity of configuration integer programs. Oper. Res. Lett. 49(6): 908-913 (2021) - [j112]János Balogh, Leah Epstein, Asaf Levin:
More on ordered open end bin packing. J. Sched. 24(6): 589-614 (2021) - [c49]János Balogh, Ilan Reuven Cohen, Leah Epstein, Asaf Levin:
Truly Asymptotic Lower Bounds for Online Vector Bin Packing. APPROX-RANDOM 2021: 8:1-8:18 - [c48]G. Jaykrishnan, Asaf Levin:
EPTAS for Load Balancing Problem on Parallel Machines with a Non-renewable Resource. WAOA 2021: 99-116 - [e1]Christos Kaklamanis, Asaf Levin:
Approximation and Online Algorithms - 18th International Workshop, WAOA 2020, Virtual Event, September 9-10, 2020, Revised Selected Papers. Lecture Notes in Computer Science 12806, Springer 2021, ISBN 978-3-030-80878-5 [contents] - [i31]G. Jaykrishnan, Asaf Levin:
EPTAS for load balancing problem on parallel machines with a non-renewable resource. CoRR abs/2108.04071 (2021) - [i30]G. Jaykrishnan, Asaf Levin:
EPTAS for parallel identical machine scheduling with time restrictions. CoRR abs/2111.06692 (2021) - 2020
- [j111]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: 34-49 (2020) - [j110]Leah Epstein, Asaf Levin:
A note on a variant of the online open end bin packing problem. Oper. Res. Lett. 48(6): 844-849 (2020) - [i29]János Balogh, Leah Epstein, Asaf Levin:
Truly asymptotic lower bounds for online vector bin packing. CoRR abs/2008.00811 (2020) - [i28]Dorit S. Hochbaum, Asaf Levin, Xu Rao:
Algorithms and Complexity for Variants of Covariates Fine Balance. CoRR abs/2009.08172 (2020) - [i27]János Balogh, Leah Epstein, Asaf Levin:
More on ordered open end bin packing. CoRR abs/2010.07119 (2020)
2010 – 2019
- 2019
- [j109]Ishai Kones, Asaf Levin:
A Unified Framework for Designing EPTAS for Load Balancing on Parallel Machines. Algorithmica 81(7): 3025-3046 (2019) - [j108]Leah Epstein, Asaf Levin:
Robust algorithms for total completion time. Discret. Optim. 33: 70-86 (2019) - [j107]Antoine Deza, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn:
Hypergraphic Degree Sequences are Hard. Bull. EATCS 127 (2019) - [j106]Leah Epstein, Asaf Levin:
On the performance guarantee of First Fit for sum coloring. J. Comput. Syst. Sci. 99: 91-105 (2019) - [j105]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): 1757-1780 (2019) - [j104]János Balogh, Leah Epstein, Asaf Levin:
Lower bounds for online bin covering-type problems. J. Sched. 22(4): 487-497 (2019) - [j103]Boaz Farbstein, Asaf Levin:
Deadline TSP. Theor. Comput. Sci. 771: 83-92 (2019) - [c47]Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder:
Online Bin Covering with Limited Migration. ESA 2019: 18:1-18:14 - [c46]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: 18-28 - [i26]Antoine Deza, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn:
Hypergraphic Degree Sequences are Hard. CoRR abs/1901.02272 (2019) - [i25]Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Asaf Levin, Shmuel Onn:
An Algorithmic Theory of Integer Programming. CoRR abs/1904.01361 (2019) - [i24]Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder:
Online Bin Covering with Limited Migration. CoRR abs/1904.06543 (2019) - [i23]Asaf Levin:
Approximation schemes for the generalized extensible bin packing problem. CoRR abs/1905.09750 (2019) - [i22]Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn:
Multitype Integer Monoid Optimization and Applications. CoRR abs/1909.07326 (2019) - 2018
- [j102]Boaz Farbstein, Asaf Levin:
Discounted Reward TSP. Algorithmica 80(2): 472-495 (2018) - [j101]Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin:
Batch Coloring of Graphs. Algorithmica 80(11): 3293-3315 (2018) - [j100]Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann:
Improved bounds for randomized preemptive online matching. Inf. Comput. 259(1): 31-40 (2018) - [j99]Asaf Levin, Aleksander Vainer:
Lower bounds on the adaptivity gaps in variants of the stochastic knapsack problem. J. Comb. Optim. 35(3): 794-813 (2018) - [j98]Leah Epstein, David S. Johnson, Asaf Levin:
Min-Sum Bin Packing. J. Comb. Optim. 36(2): 508-531 (2018) - [j97]Dorit S. Hochbaum, Asaf Levin:
Weighted matching with pair restrictions. Optim. Lett. 12(3): 649-659 (2018) - [j96]Leah Epstein, Asaf Levin:
The benefit of preemption with respect to the ℓp norm. Oper. Res. Lett. 46(4): 462-468 (2018) - [j95]Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin:
Online-bounded analysis. J. Sched. 21(4): 429-441 (2018) - [j94]Antoine Deza, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn:
Optimization over Degree Sequences. SIAM J. Discret. Math. 32(3): 2067-2079 (2018) - [c45]Ishai Kones, Asaf Levin:
A Unified Framework for Designing EPTAS's for Load Balancing on Parallel Machines. CiE 2018: 224-233 - [c44]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: 5:1-5:14 - [c43]Martin Koutecký, Asaf Levin, Shmuel Onn:
A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs. ICALP 2018: 85:1-85:14 - [i21]Martin Koutecký, Asaf Levin, Shmuel Onn:
A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs. CoRR abs/1802.05859 (2018) - [i20]Ishai Kones, Asaf Levin:
A unified framework for designing EPTAS's for load balancing on parallel machines. CoRR abs/1802.09828 (2018) - [i19]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 abs/1807.05554 (2018) - 2017
- [j93]Reuven Cohen, Mira Gonen, Asaf Levin, Shmuel Onn:
On nonlinear multi-covering problems. J. Comb. Optim. 33(2): 645-659 (2017) - [j92]Boaz Farbstein, Asaf Levin:
Maximum coverage problem with group budget constraints. J. Comb. Optim. 34(3): 725-735 (2017) - [j91]Leah Epstein, Asaf Levin:
An AFPTAS for variable sized bin packing with general activation costs. J. Comput. Syst. Sci. 84: 79-96 (2017) - [j90]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): 101-123 (2017) - [c42]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: 10:1-10:14 - [c41]Boaz Farbstein, Asaf Levin:
Deadline TSP. WAOA 2017: 52-65 - [c40]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: 102-117 - [i18]Martin Koutecký, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn:
Approximate Shifted Combinatorial Optimization. CoRR abs/1706.02075 (2017) - [i17]Antoine Deza, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn:
Optimization over Degree Sequences. CoRR abs/1706.03951 (2017) - [i16]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 abs/1707.01728 (2017) - [i15]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 abs/1708.03228 (2017) - 2016
- [j89]Leah Epstein, Asaf Levin, Gerhard J. Woeginger:
Vertex Cover Meets Scheduling. Algorithmica 74(3): 1148-1173 (2016) - [j88]Leah Epstein, Asaf Levin, Rob van Stee:
A Unified Approach to Truthful Scheduling on Related Machines. Math. Oper. Res. 41(1): 332-351 (2016) - [j87]Asaf Levin, Shmuel Onn:
Shifted matroid optimization. Oper. Res. Lett. 44(4): 535-539 (2016) - [j86]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): 772-774 (2016) - [c39]Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin:
Online Bounded Analysis. CSR 2016: 131-145 - [c38]Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin:
Batch Coloring of Graphs. WAOA 2016: 52-64 - [r1]Asaf Levin:
Approximation Schemes for Makespan Minimization. Encyclopedia of Algorithms 2016: 131-133 - [i14]Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin:
Online Bounded Analysis. CoRR abs/1602.06708 (2016) - [i13]János Balogh, József Békési, György Dósa, Leah Epstein, Asaf Levin:
Online bin packing with cardinality constraints resolved. CoRR abs/1608.06415 (2016) - [i12]Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin:
Batch Coloring of Graphs. CoRR abs/1610.02997 (2016) - 2015
- [j85]Leah Epstein, Csanád Imreh, Asaf Levin, Judit Nagy-György:
Online File Caching with Rejection Penalties. Algorithmica 71(2): 279-306 (2015) - [j84]Leah Epstein, Asaf Levin, Gerhard J. Woeginger:
The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases. Algorithmica 72(4): 1130-1171 (2015) - [j83]Boaz Farbstein, Asaf Levin:
Min-max cover of a graph with a small number of parts. Discret. Optim. 16: 51-61 (2015) - [j82]Asaf Levin, Aleksander Vainer:
The benefit of adaptivity in stochastic packing problems with probing. Theor. Comput. Sci. 562: 513-523 (2015) - [j81]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: 92-101 (2015) - [i11]Asaf Levin, Shmuel Onn:
Lexicographic Matroid Optimization. CoRR abs/1507.00447 (2015) - 2014
- [j80]Leah Epstein, Asaf Levin:
Robust Algorithms for Preemptive Scheduling. Algorithmica 69(1): 26-57 (2014) - [j79]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): 726-747 (2014) - [j78]Leah Epstein, Asaf Levin:
An efficient polynomial time approximation scheme for load balancing on uniformly related machines. Math. Program. 147(1-2): 1-23 (2014) - [j77]Asaf Levin, Aleksander Vainer:
Adaptivity in the stochastic blackjack knapsack problem. Theor. Comput. Sci. 516: 121-126 (2014) - [i10]Leah Epstein, Asaf Levin:
Minimum total weighted completion time: Faster approximation schemes. CoRR abs/1404.1059 (2014) - 2013
- [j76]János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin:
Online Clustering with Variable Sized Clusters. Algorithmica 65(2): 251-274 (2013) - [j75]Leah Epstein, Csanád Imreh, Asaf Levin:
Bin covering with cardinality constraints. Discret. Appl. Math. 161(13-14): 1975-1987 (2013) - [j74]Asaf Levin, Aleksander Vainer:
The benefit of adaptivity in the stochastic knapsack problem with dependence on the state of nature. Discret. Optim. 10(2): 147-154 (2013) - [j73]Asaf Levin, Uri Yovel:
Nonoblivious 2-Opt heuristics for the traveling salesman problem. Networks 62(3): 201-219 (2013) - [j72]Leah Epstein, Asaf Levin:
Robust Approximation Schemes for Cube Packing. SIAM J. Optim. 23(2): 1310-1343 (2013) - [j71]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): 19:1-19:12 (2013) - [c37]Leah Epstein, Asaf Levin, Rob van Stee:
A unified approach to truthful scheduling on related machines. SODA 2013: 1243-1252 - [c36]Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann:
Improved Bounds for Online Preemptive Matching. STACS 2013: 389-399 - 2012
- [j70]Leah Epstein, Asaf Levin, Rob van Stee:
Approximation Schemes for Packing Splittable Items with Cardinality Constraints. Algorithmica 62(1-2): 102-129 (2012) - [j69]Leah Epstein, Asaf Levin:
On Equilibria for ADM Minimization Games. Algorithmica 63(1-2): 246-273 (2012) - [j68]Leah Epstein, Asaf Levin:
Bin packing with general cost structures. Math. Program. 132(1-2): 355-391 (2012) - [j67]Leah Epstein, Asaf Levin, Alberto Marchetti-Spaccamela, Nicole Megow, Julián Mestre, Martin Skutella, Leen Stougie:
Universal Sequencing on an Unreliable Machine. SIAM J. Comput. 41(3): 565-586 (2012) - [j66]Leah Epstein, Asaf Levin:
On the max coloring problem. Theor. Comput. Sci. 462: 23-38 (2012) - [c35]Leah Epstein, Asaf Levin, Gerhard J. Woeginger:
The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases. WG 2012: 114-125 - [i9]Leah Epstein, Asaf Levin:
An efficient polynomial time approximation scheme for load balancing on uniformly related machines. CoRR abs/1202.4072 (2012) - [i8]Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann:
Improved Bounds for Online Preemptive Matching. CoRR abs/1207.1788 (2012) - [i7]Leah Epstein, Asaf Levin, Rob van Stee:
A unified approach to truthful scheduling on related machines. CoRR abs/1207.3523 (2012) - 2011
- [j65]Leah Epstein, Lene M. Favrholdt, Asaf Levin:
Online variable-sized bin packing with conflicts. Discret. Optim. 8(2): 333-343 (2011) - [j64]Leah Epstein, Sven Oliver Krumke, Asaf Levin, Heike Sperber:
Selfish bin coloring. J. Comb. Optim. 22(4): 531-548 (2011) - [j63]Leah Epstein, Asaf Levin, Gerhard J. Woeginger:
Graph coloring with rejection. J. Comput. Syst. Sci. 77(2): 439-447 (2011) - [j62]Leah Epstein, Asaf Levin, Rob van Stee:
Max-min Online Allocations with a Reordering Buffer. SIAM J. Discret. Math. 25(3): 1230-1250 (2011) - [j61]Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev:
Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model. SIAM J. Discret. Math. 25(3): 1251-1265 (2011) - [j60]Asaf Levin, Uri Yovel:
Uniform unweighted set cover: The power of non-oblivious local search. Theor. Comput. Sci. 412(12-14): 1033-1053 (2011) - [c34]Leah Epstein, Asaf Levin:
Robust Algorithms for Preemptive Scheduling. ESA 2011: 567-578 - [c33]Leah Epstein, Csanád Imreh, Asaf Levin, Judit Nagy-György:
On Variants of File Caching. ICALP (1) 2011: 195-206 - 2010
- [j59]Dorit S. Hochbaum, Asaf Levin:
How to allocate review tasks for robust ranking. Acta Informatica 47(5-6): 325-345 (2010) - [j58]Leah Epstein, Asaf Levin, Betzalel Menahem:
Minimization of SONET ADMs in ring networks revisited. Computing 87(1-2): 3-19 (2010) - [j57]János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin:
On the sum minimization version of the online bin covering problem. Discret. Appl. Math. 158(13): 1381-1393 (2010) - [j56]Leah Epstein, Asaf Levin:
Randomized algorithms for online bounded bidding. Inf. Process. Lett. 110(12-13): 503-506 (2010) - [j55]Leah Epstein, Csanád Imreh, Asaf Levin:
Class Constrained Bin Covering. Theory Comput. Syst. 46(2): 246-260 (2010)