Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Asaf Levin
2010 – today
- 2013
[j74]János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin: Online Clustering with Variable Sized Clusters. Algorithmica 65(2): 251-274 (2013)- [j73]Leah Epstein, Csanád Imreh, Asaf Levin: Bin covering with cardinality constraints. Discrete Applied Mathematics 161(13-14): 1975-1987 (2013)
- [j72]Asaf Levin, Aleksander Vainer: The benefit of adaptivity in the stochastic knapsack problem with dependence on the state of nature. Discrete Optimization 10(2): 147-154 (2013)
- [j71]Dorit S. Hochbaum, Asaf Levin: Approximation Algorithms for a Minimization Variant of the Order-Preserving Submatrices and for Biclustering Problems. ACM Transactions on Algorithms 9(2): 19 (2013)
- [c39]Leah Epstein, Asaf Levin, Rob van Stee: A unified approach to truthful scheduling on related machines. SODA 2013: 1243-1252
- [c38]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]
- [c37]Leah Epstein, Asaf Levin, Gerhard J. Woeginger: The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases. WG 2012: 114-125
- [i7]Leah Epstein, Asaf Levin: An efficient polynomial time approximation scheme for load balancing on uniformly related machines. CoRR abs/1202.4072 (2012)
- [i6]Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann: Improved Bounds for Online Preemptive Matching. CoRR abs/1207.1788 (2012)
- [i5]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. Discrete Optimization 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. Discrete 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. Discrete 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)
- [c36]
- [c35]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 Inf. 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. Discrete Applied Mathematics 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 Journal on Optimization 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)
- [c34]Leah Epstein, Asaf Levin, Rob van Stee: Max-min Online Allocations with a Reordering Buffer. ICALP (1) 2010: 336-347
- [c33]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
- [c32]János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin: Online Clustering with Variable Sized Clusters. MFCS 2010: 282-293
- [c31]Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng, Asaf Levin: Finding mobile data under delay constraints with searching costs. PODC 2010: 297-304
- [c30]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. Discrete Optimization 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. Discrete Math. 23(2): 822-841 (2009)
- [j41]
- [j40]Refael Hassin, Asaf Levin, Maxim Sviridenko: Approximating the minimum quadratic assignment problems. ACM Transactions on Algorithms 6(1) (2009)
- [c29]
- [i4]Asaf Levin, Uri Yovel: Uniform unweighted set cover: The power of non-oblivious local search. CoRR abs/0906.1557 (2009)
- [i3]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)
- [i2]
- [i1]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 Inf. 45(3): 155-175 (2008)
- [j38]Leah Epstein, Asaf Levin: A PTAS for delay minimization in establishing wireless conference calls. Discrete Optimization 5(1): 88-96 (2008)
- [j37]Asaf Levin, Michal Penn: Approximation algorithm for minimizing total latency in machine scheduling with deliveries. Discrete Optimization 5(1): 97-107 (2008)
- [j36]Leah Epstein, Asaf Levin: More on online bin packing with two item sizes. Discrete Optimization 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. Discrete Math. 23(1): 251-264 (2008)
- [j29]Leah Epstein, Asaf Levin: On Bin Packing with Conflicts. SIAM Journal on Optimization 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)
- [c28]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. Discrete Applied Mathematics 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)
- [c27]
- [c26]Leah Epstein, Thomas Erlebach, Asaf Levin: Online Capacitated Interval Coloring. ESCAPE 2007: 243-254
- [c25]
- [c24]Dorit S. Hochbaum, Asaf Levin: Covering the Edges of Bipartite Graphs Using K 2, 2 Graphs. WAOA 2007: 116-127
- [c23]
- [c22]
- 2006
- [j23]Dorit S. Hochbaum, Asaf Levin: Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms. Discrete Optimization 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. Management Science 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 Journal on Optimization 17(2): 311-330 (2006)
- [j17]Refael Hassin, Asaf Levin: The minimum generalized vertex cover problem. ACM Transactions on 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]
- [c21]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
- [c20]
- [c19]Leah Epstein, Asaf Levin: A Robust APTAS for the Classical Bin Packing Problem. ICALP (1) 2006: 214-225
- [c18]Leah Epstein, Thomas Erlebach, Asaf Levin: Variable Sized Online Interval Coloring with Bandwidth. SWAT 2006: 29-40
- [c17]
- [c16]
- [c15]Asaf Levin: Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search. WAOA 2006: 290-301
- 2005
- [j14]Refael Hassin, Asaf Levin: A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem. SIAM J. Comput. 35(1): 189-200 (2005)
- [j13]Leah Epstein, Asaf Levin: The chord version for SONET ADMs minimization. Theor. Comput. Sci. 349(3): 337-346 (2005)
- [c14]Leah Epstein, Asaf Levin: Tracking mobile users. Algorithms for Optimization with Incomplete Information 2005
- [c13]Refael Hassin, Asaf Levin: An Approximation Algorithm for the Minimum Latency Set Cover Problem. ESA 2005: 726-733
- [c12]
- [c11]Leah Epstein, Asaf Levin: The Conference Call Search Problem in Wireless Networks. WAOA 2005: 133-146
- [c10]
- 2004
- [j12]Refael Hassin, Asaf Levin: Approximation Algorithms for Quickest Spanning Tree Problems. Algorithmica 41(1): 43-52 (2004)
- [j11]Jochen Könemann, Asaf Levin, Amitabh Sinha: Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem. Algorithmica 41(2): 117-129 (2004)
- [j10]Refael Hassin, Asaf Levin: Minimum restricted diameter spanning trees. Discrete Applied Mathematics 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]
- 2003
- [j5]Refael Hassin, Asaf Levin: Subgraphs decomposable into two trees and k-edge-connected subgraphs. Discrete Applied Mathematics 126(2-3): 181-195 (2003)
- [j4]Refael Hassin, Asaf Levin, Dana Morad: Lexicographic local search and the p. European Journal of Operational Research 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]
- [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]
- 2001
- [c1]
Coauthor Index
[j74] [j73] [c39] [c38] [j70] [j69] [j68] [j67] [j66] [c37] [i7] [i6] [i5] [j65] [j64] [j63] [j62] [j61] [c36] [c35] [j58] [j57] [j56] [j55] [j54] [j52] [j51] [j50] [c34] [c33] [c32] [c30] [j49] [j48] [j46] [j44] [j42] [c29] [i3] [i2] [i1] [j39] [j38] [j36] [j35] [j31] [j29] [j28] [c28] [j27] [c26] [c25] [c23] [c22] [j16] [c21] [c20] [c19] [c18] [c17] [j13] [c14] [c12] [c11] [c7] [c6]
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-12 21:35 CEST by the dblp team