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
- 2024
[j134]Asaf Levin
:
The Near Exact Bin Covering Problem. Algorithmica 86(6): 2041-2066 (2024)- [j133]G. Jaykrishnan, Asaf Levin:
Scheduling with cardinality dependent unavailability periods. Eur. J. Oper. Res. 316(2): 443-458 (2024) - [j132]G. Jaykrishnan, Asaf Levin:
EPTAS for parallel identical machine scheduling with time restrictions. J. Comb. Optim. 47(2): 10 (2024) - [j131]Asaf Levin:
Selecting intervals to optimize the design of observational studies subject to fine balance constraints. J. Comb. Optim. 47(3): 33 (2024) - [c51]Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Alexandra Lassota, Asaf Levin:
Tight Lower Bounds for Block-Structured Integer Programs. IPCO 2024: 224-237 - [i38]Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Alexandra Lassota, Asaf Levin:
Tight Lower Bounds for Block-Structured Integer Programs. CoRR abs/2402.17290 (2024) - [i37]G. Jaykrishnan, Asaf Levin:
APTAS for bin packing with general cost structures. CoRR abs/2407.07677 (2024) - [i36]Leah Epstein, Asaf Levin:
Efficient approximation schemes for scheduling on a stochastic number of machines. CoRR abs/2409.10155 (2024) - 2023
- [j130]Asaf Levin, Tal Shusterman:
Weighted throughput in a single machine preemptive scheduling with continuous controllable processing times. Acta Informatica 60(2): 101-122 (2023) - [j129]Asaf Levin:
Online Minimization of the Maximum Starting Time: Migration Helps. Algorithmica 85(8): 2238-2259 (2023) - [j128]G. Jaykrishnan, Asaf Levin:
EPTAS for load balancing problem on parallel machines with a non-renewable resource. Discret. Optim. 48(Part 1): 100775 (2023) - [j127]Dorit S. Hochbaum, Asaf Levin, Xu Rao:
Algorithms and Complexities of Matching Variants in Covariate Balancing. Oper. Res. 71(5): 1800-1814 (2023) - [j126]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) - [j125]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) - [j124]Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder:
Online cardinality constrained scheduling. Oper. Res. Lett. 51(5): 533-539 (2023) - [j123]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): 595-598 (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) - [j54]Leah Epstein, Asaf Levin:
AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items. SIAM J. Optim. 20(6): 3121-3145 (2010) - [j53]Dorit S. Hochbaum, Asaf Levin:
Covering the edges of bipartite graphs using K2, 2 graphs. Theor. Comput. Sci. 411(1): 1-9 (2010) - [j52]Joan Boyar, Leah Epstein, Asaf Levin:
Tight results for Next Fit and Worst Fit with resource augmentation. Theor. Comput. Sci. 411(26-28): 2572-2580 (2010) - [j51]Leah Epstein, Csanád Imreh, Asaf Levin:
Class constrained bin packing revisited. Theor. Comput. Sci. 411(34-36): 3073-3089 (2010) - [j50]Leah Epstein, Asaf Levin:
Improved randomized results for the interval selection problem. Theor. Comput. Sci. 411(34-36): 3129-3135 (2010) - [c32]Leah Epstein, Asaf Levin, Rob van Stee:
Max-min Online Allocations with a Reordering Buffer. ICALP (1) 2010: 336-347 - [c31]Leah Epstein, Asaf Levin, Alberto Marchetti-Spaccamela, Nicole Megow, Julián Mestre, Martin Skutella, Leen Stougie:
Universal Sequencing on a Single Machine. IPCO 2010: 230-243 - [c30]János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin:
Online Clustering with Variable Sized Clusters. MFCS 2010: 282-293 - [c29]Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng, Asaf Levin:
Finding mobile data under delay constraints with searching costs. PODC 2010: 297-304 - [c28]Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev:
Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model. STACS 2010: 347-358
2000 – 2009
- 2009
- [j49]Leah Epstein, Thomas Erlebach, Asaf Levin:
Variable Sized Online Interval Coloring with Bandwidth. Algorithmica 53(3): 385-401 (2009) - [j48]Leah Epstein, Magnús M. Halldórsson, Asaf Levin, Hadas Shachnai:
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs. Algorithmica 55(4): 643-665 (2009) - [j47]Refael Hassin, Asaf Levin, Shlomi Rubinstein:
Approximation algorithms for maximum latency and partial cycle cover. Discret. Optim. 6(2): 197-205 (2009) - [j46]Leah Epstein, Asaf Levin:
Better bounds for minimizing SONET ADMs. J. Comput. Syst. Sci. 75(2): 122-136 (2009) - [j45]José R. Correa, Asaf Levin:
Monotone Covering Problems with an Additional Covering Constraint. Math. Oper. Res. 34(1): 238-248 (2009) - [j44]Leah Epstein, Asaf Levin:
A robust APTAS for the classical bin packing problem. Math. Program. 119(1): 33-49 (2009) - [j43]Dorit S. Hochbaum, Asaf Levin:
The multi-integer set cover and the facility terminal cover problem. Networks 53(1): 63-66 (2009) - [j42]Leah Epstein, Thomas Erlebach, Asaf Levin:
Online Capacitated Interval Coloring. SIAM J. Discret. Math. 23(2): 822-841 (2009) - [j41]Asaf Levin:
A generalized minimum cost k-clustering. ACM Trans. Algorithms 5(4): 36:1-36:10 (2009) - [j40]Refael Hassin, Asaf Levin, Maxim Sviridenko:
Approximating the minimum quadratic assignment problems. ACM Trans. Algorithms 6(1): 18:1-18:10 (2009) - [c27]Leah Epstein, Asaf Levin:
On Equilibria for ADM Minimization Games. SAGT 2009: 347-358 - [i6]Asaf Levin, Uri Yovel:
Uniform unweighted set cover: The power of non-oblivious local search. CoRR abs/0906.1557 (2009) - [i5]Leah Epstein, Asaf Levin:
AFPTAS results for common variants of bin packing: A new method to handle the small items. CoRR abs/0906.5050 (2009) - [i4]Leah Epstein, Asaf Levin:
Bin packing with general cost structures. CoRR abs/0906.5051 (2009) - [i3]Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev:
Improved approximation guarantees for weighted matching in the semi-streaming model. CoRR abs/0907.0305 (2009) - 2008
- [j39]Leah Epstein, Asaf Levin, Rob van Stee:
Two-dimensional packing with conflicts. Acta Informatica 45(3): 155-175 (2008) - [j38]Leah Epstein, Asaf Levin:
A PTAS for delay minimization in establishing wireless conference calls. Discret. Optim. 5(1): 88-96 (2008) - [j37]Asaf Levin, Michal Penn:
Approximation algorithm for minimizing total latency in machine scheduling with deliveries. Discret. Optim. 5(1): 97-107 (2008) - [j36]Leah Epstein, Asaf Levin:
More on online bin packing with two item sizes. Discret. Optim. 5(4): 705-713 (2008) - [j35]Leah Epstein, Asaf Levin:
Asymptotic fully polynomial approximation schemes for variants of open-end bin packing. Inf. Process. Lett. 109(1): 32-37 (2008) - [j34]Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger:
The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases. Networks 51(3): 178-189 (2008) - [j33]Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger:
The computational complexity of graph contractions II: Two tough polynomially solvable cases. Networks 52(1): 32-56 (2008) - [j32]Aaron Archer, Asaf Levin, David P. Williamson:
A Faster, Better Approximation Algorithm for the Minimum Latency Problem. SIAM J. Comput. 37(5): 1472-1498 (2008) - [j31]Leah Epstein, Asaf Levin:
An APTAS for Generalized Cost Variable-Sized Bin Packing. SIAM J. Comput. 38(1): 411-428 (2008) - [j30]Asaf Levin:
Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search. SIAM J. Discret. Math. 23(1): 251-264 (2008) - [j29]Leah Epstein, Asaf Levin:
On Bin Packing with Conflicts. SIAM J. Optim. 19(3): 1270-1298 (2008) - [j28]Leah Epstein, Asaf Levin, Rob van Stee:
Online unit clustering: Variations on a theme. Theor. Comput. Sci. 407(1-3): 85-96 (2008) - [c26]Leah Epstein, Asaf Levin:
Improved Randomized Results for That Interval Selection Problem. ESA 2008: 381-392 - 2007
- [j27]Leah Epstein, Asaf Levin:
SONET ADMs Minimization with Divisible Paths. Algorithmica 49(1): 51-68 (2007) - [j26]Refael Hassin, Asaf Levin:
Flow trees for vertex-capacitated networks. Discret. Appl. Math. 155(4): 572-578 (2007) - [j25]Asaf Levin:
The finite horizon investor problem with a budget constraint. Inf. Process. Lett. 104(1): 21-28 (2007) - [j24]Eli Brosh, Asaf Levin, Yuval Shavitt:
Approximation and heuristic algorithms for minimum-delay application-layer multicast trees. IEEE/ACM Trans. Netw. 15(2): 473-484 (2007) - [c25]Leah Epstein, Thomas Erlebach, Asaf Levin:
Online Capacitated Interval Coloring. ESCAPE 2007: 243-254 - [c24]Leah Epstein, Asaf Levin, Rob van Stee:
Multi-dimensional Packing with Conflicts. FCT 2007: 288-299 - [c23]Dorit S. Hochbaum, Asaf Levin:
Covering the Edges of Bipartite Graphs Using K 2, 2 Graphs. WAOA 2007: 116-127 - [c22]Leah Epstein, Asaf Levin:
On the Max Coloring Problem. WAOA 2007: 142-155 - [c21]Leah Epstein, Asaf Levin:
Minimum Weighted Sum Bin Packing. WAOA 2007: 218-231 - [i2]Asaf Levin:
Approximating min-max k-clustering. Fair Division 2007 - 2006
- [j23]Dorit S. Hochbaum, Asaf Levin:
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms. Discret. Optim. 3(4): 327-340 (2006) - [j22]Asaf Levin:
Real time scheduling with a budget: Parametric-search is better than binary search. Inf. Process. Lett. 99(5): 187-191 (2006) - [j21]Esther M. Arkin, Refael Hassin, Asaf Levin:
Approximations for minimum and min-max vehicle routing problems. J. Algorithms 59(1): 1-18 (2006) - [j20]Dorit S. Hochbaum, Asaf Levin:
Methodologies and Algorithms for Group-Rankings Decision. Manag. Sci. 52(9): 1394-1408 (2006) - [j19]Asaf Levin, Gerhard J. Woeginger:
The constrained minimum weighted sum of job completion times problem. Math. Program. 108(1): 115-126 (2006) - [j18]Dorit S. Hochbaum, Asaf Levin:
Optimizing over Consecutive 1's and Circular 1's Constraints. SIAM J. Optim. 17(2): 311-330 (2006) - [j17]Refael Hassin, Asaf Levin:
The minimum generalized vertex cover problem. ACM Trans. Algorithms 2(1): 66-78 (2006) - [j16]Leah Epstein, Asaf Levin:
The conference call search problem in wireless networks. Theor. Comput. Sci. 359(1-3): 418-429 (2006) - [j15]Asaf Levin, Danny Segev:
Partial multicuts in trees. Theor. Comput. Sci. 369(1-3): 384-395 (2006) - [c20]Leah Epstein, Magnús M. Halldórsson, Asaf Levin, Hadas Shachnai:
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs. APPROX-RANDOM 2006: 116-127 - [c19]Leah Epstein, Asaf Levin, Gerhard J. Woeginger:
Graph Coloring with Rejection. ESA 2006: 364-375 - [c18]Leah Epstein, Asaf Levin:
A Robust APTAS for the Classical Bin Packing Problem. ICALP (1) 2006: 214-225 - [c17]Leah Epstein, Thomas Erlebach, Asaf Levin:
Variable Sized Online Interval Coloring with Bandwidth. SWAT 2006: 29-40 - [c16]Leah Epstein, Asaf Levin:
On Bin Packing with Conflicts. WAOA 2006: 160-173 - [c15]Dorit S. Hochbaum, Asaf Levin:
The k-Allocation Problem and Its Variants. WAOA 2006: 253-264 - [c14]Asaf Levin:
Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search. WAOA 2006: 290-301 - 2005
- [j14]Refael Hassin, Asaf Levin:
Approximation Algorithms for Quickest Spanning Tree Problems. Algorithmica 41(1): 43-52 (2005) - [j13]Jochen Könemann, Asaf Levin, Amitabh Sinha:
Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem. Algorithmica 41(2): 117-129 (2005) - [j12]Refael Hassin, Asaf Levin:
A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem. SIAM J. Comput. 35(1): 189-200 (2005) - [j11]Leah Epstein, Asaf Levin:
The chord version for SONET ADMs minimization. Theor. Comput. Sci. 349(3): 337-346 (2005) - [c13]Refael Hassin, Asaf Levin:
An Approximation Algorithm for the Minimum Latency Set Cover Problem. ESA 2005: 726-733 - [c12]Leah Epstein, Asaf Levin:
SONET ADMs Minimization with Divisible Paths. WAOA 2005: 119-132 - [c11]Leah Epstein, Asaf Levin:
The Conference Call Search Problem in Wireless Networks. WAOA 2005: 133-146 - [c10]Asaf Levin, Danny Segev:
Partial Multicuts in Trees. WAOA 2005: 320-333 - [i1]Leah Epstein, Asaf Levin:
Tracking mobile users. Algorithms for Optimization with Incomplete Information 2005 - 2004
- [j10]Refael Hassin, Asaf Levin:
Minimum restricted diameter spanning trees. Discret. Appl. Math. 137(3): 343-357 (2004) - [j9]Refael Hassin, Asaf Levin:
Synthesis of 2-Commodity Flow Networks. Math. Oper. Res. 29(2): 280-288 (2004) - [j8]Asaf Levin:
A better approximation algorithm for the budget prize collecting tree problem. Oper. Res. Lett. 32(4): 316-319 (2004) - [j7]Asaf Levin:
Strongly polynomial-time approximation for a class of bicriteria problems. Oper. Res. Lett. 32(6): 530-534 (2004) - [j6]Refael Hassin, Asaf Levin:
An efficient polynomial time approximation scheme for the constrained minimum spanning tree problem using matroid intersection. SIAM J. Comput. 33(2): 261-268 (2004) - [c9]Refael Hassin, Asaf Levin:
Approximation Algorithms for Quickest Spanning Tree Problems. ESA 2004: 395-402 - [c8]Asaf Levin, Gerhard J. Woeginger:
The Constrained Minimum Weighted Sum of Job Completion Times Problem. IPCO 2004: 298-307 - [c7]Leah Epstein, Asaf Levin:
A PTAS for Delay Minimization in Establishing Wireless Conference Calls. WAOA 2004: 36-47 - [c6]Leah Epstein, Asaf Levin:
Better Bounds for Minimizing SONET ADMs. WAOA 2004: 281-294 - 2003
- [j5]Refael Hassin, Asaf Levin:
Subgraphs decomposable into two trees and k-edge-connected subgraphs. Discret. Appl. Math. 126(2-3): 181-195 (2003) - [j4]Refael Hassin, Asaf Levin, Dana Morad:
Lexicographic local search and the p. Eur. J. Oper. Res. 151(2): 265-279 (2003) - [j3]Refael Hassin, Asaf Levin:
Minimum spanning tree with hop restrictions. J. Algorithms 48(1): 220-238 (2003) - [j2]Olivier Goldschmidt, Dorit S. Hochbaum, Asaf Levin, Eli V. Olinick:
The SONET edge-partition problem. Networks 41(1): 13-23 (2003) - [c5]Refael Hassin, Asaf Levin:
The Minimum Generalized Vertex Cover Problem. ESA 2003: 289-300 - [c4]Jochen Könemann, Asaf Levin, Amitabh Sinha:
Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem. RANDOM-APPROX 2003: 109-121 - [c3]Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger:
The Complexity of Graph Contractions. WG 2003: 322-333 - 2002
- [j1]Refael Hassin, Asaf Levin:
Approximation algorithms for constructing wavelength routing networks. Networks 40(1): 32-37 (2002) - [c2]Refael Hassin, Asaf Levin:
Minimum Restricted Diameter Spanning Trees. APPROX 2002: 175-184 - 2001
- [c1]Refael Hassin, Asaf Levin:
Synthesis of 2-Commodity Flow Networks. IPCO 2001: 226-235
Coauthor Index
[i36] [j126] [j124] [j120] [j117] [c50] [i34] [j115] [j112] [c49] [j111] [j110] [i29] [i27] [j108] [j106] [j105] [j104] [c47] [c46] [i24] [j101] [j100] [j98] [j96] [j95] [c44] [i19] [j91] [j90] [c42] [c40] [i16] [i15] [j89] [j88] [j86] [c39] [c38] [i14] [i13] [i12] [j85] [j84] [j81] [j80] [j78] [i10] [j76] [j75] [j72] [c37] [c36] [j70] [j69] [j68] [j67] [j66] [c35] [i9] [i8] [i7] [j65] [j64] [j63] [j62] [j61] [c34] [c33] [j58] [j57] [j56] [j55] [j54] [j52] [j51] [j50] [c32] [c31] [c30] [c28] [j49] [j48] [j46] [j44] [j42] [c27] [i5] [i4] [i3] [j39] [j38] [j36] [j35] [j31] [j29] [j28] [c26] [j27] [c25] [c24] [c22] [c21] [j16] [c20] [c19] [c18] [c17] [c16] [j11] [c12] [c11] [i1] [c7] [c6]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-14 23:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
