Остановите войну!
for scientists:
default search action
Asaf Levin
- > Home > Persons > Asaf Levin
Publications
- 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) - [j124]Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder:
Online cardinality constrained scheduling. Oper. Res. Lett. 51(5): 533-539 (2023) - 2022
- [j120]Leah Epstein, Asaf Levin:
Starting time minimization for the maximum job variant. Discret. Appl. Math. 307: 79-87 (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) - [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) - 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) - [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 - 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) - [i27]János Balogh, Leah Epstein, Asaf Levin:
More on ordered open end bin packing. CoRR abs/2010.07119 (2020) - 2019
- [j108]Leah Epstein, Asaf Levin:
Robust algorithms for total completion time. Discret. Optim. 33: 70-86 (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) - [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 - [i24]Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder:
Online Bin Covering with Limited Migration. CoRR abs/1904.06543 (2019) - 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) - [j98]Leah Epstein, David S. Johnson, Asaf Levin:
Min-Sum Bin Packing. J. Comb. Optim. 36(2): 508-531 (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) - [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 - [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
- [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 - [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 - [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) - [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 - [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) - [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) - 2014
- [j80]Leah Epstein, Asaf Levin:
Robust Algorithms for Preemptive Scheduling. Algorithmica 69(1): 26-57 (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) - [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) - [j72]Leah Epstein, Asaf Levin:
Robust Approximation Schemes for Cube Packing. SIAM J. Optim. 23(2): 1310-1343 (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) - [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
- [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) - [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 - [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 - 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) - [j46]Leah Epstein, Asaf Levin:
Better bounds for minimizing SONET ADMs. J. Comput. Syst. Sci. 75(2): 122-136 (2009) - [j44]Leah Epstein, Asaf Levin:
A robust APTAS for the classical bin packing problem. Math. Program. 119(1): 33-49 (2009) - [j42]Leah Epstein, Thomas Erlebach, Asaf Levin:
Online Capacitated Interval Coloring. SIAM J. Discret. Math. 23(2): 822-841 (2009) - [c27]Leah Epstein, Asaf Levin:
On Equilibria for ADM Minimization Games. SAGT 2009: 347-358 - [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) - [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) - [j31]Leah Epstein, Asaf Levin:
An APTAS for Generalized Cost Variable-Sized Bin Packing. SIAM J. Comput. 38(1): 411-428 (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) - [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 - [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 - 2006
- [j16]Leah Epstein, Asaf Levin:
The conference call search problem in wireless networks. Theor. Comput. Sci. 359(1-3): 418-429 (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 - 2005
- [j11]Leah Epstein, Asaf Levin:
The chord version for SONET ADMs minimization. Theor. Comput. Sci. 349(3): 337-346 (2005) - [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 - [i1]Leah Epstein, Asaf Levin:
Tracking mobile users. Algorithms for Optimization with Incomplete Information 2005 - 2004
- [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
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-04-21 18:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint