| 2009 |
|---|
| 67 | EE | Leah Epstein,
Thomas Erlebach,
Asaf Levin:
Variable Sized Online Interval Coloring with Bandwidth.
Algorithmica 53(3): 385-401 (2009) |
| 66 | EE | Refael Hassin,
Asaf Levin,
Shlomi Rubinstein:
Approximation algorithms for maximum latency and partial cycle cover.
Discrete Optimization 6(2): 197-205 (2009) |
| 65 | EE | Leah Epstein,
Asaf Levin:
Better bounds for minimizing SONET ADMs.
J. Comput. Syst. Sci. 75(2): 122-136 (2009) |
| 64 | EE | Dorit S. Hochbaum,
Asaf Levin:
The multi-integer set cover and the facility terminal cover problem.
Networks 53(1): 63-66 (2009) |
| 2008 |
|---|
| 63 | EE | Leah Epstein,
Asaf Levin:
Improved Randomized Results for That Interval Selection Problem.
ESA 2008: 381-392 |
| 62 | EE | Leah Epstein,
Asaf Levin,
Rob van Stee:
Two-dimensional packing with conflicts.
Acta Inf. 45(3): 155-175 (2008) |
| 61 | EE | Leah Epstein,
Asaf Levin:
A PTAS for delay minimization in establishing wireless conference calls.
Discrete Optimization 5(1): 88-96 (2008) |
| 60 | EE | Asaf Levin,
Michal Penn:
Approximation algorithm for minimizing total latency in machine scheduling with deliveries.
Discrete Optimization 5(1): 97-107 (2008) |
| 59 | EE | Leah Epstein,
Asaf Levin:
More on online bin packing with two item sizes.
Discrete Optimization 5(4): 705-713 (2008) |
| 58 | EE | Leah Epstein,
Asaf Levin:
Asymptotic fully polynomial approximation schemes for variants of open-end bin packing.
Inf. Process. Lett. 109(1): 32-37 (2008) |
| 57 | EE | 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) |
| 56 | EE | 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) |
| 55 | EE | 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) |
| 54 | EE | Leah Epstein,
Asaf Levin:
An APTAS for Generalized Cost Variable-Sized Bin Packing.
SIAM J. Comput. 38(1): 411-428 (2008) |
| 53 | EE | Leah Epstein,
Asaf Levin,
Rob van Stee:
Online unit clustering: Variations on a theme.
Theor. Comput. Sci. 407(1-3): 85-96 (2008) |
| 2007 |
|---|
| 52 | EE | Leah Epstein,
Thomas Erlebach,
Asaf Levin:
Online Capacitated Interval Coloring.
ESCAPE 2007: 243-254 |
| 51 | EE | Leah Epstein,
Asaf Levin,
Rob van Stee:
Multi-dimensional Packing with Conflicts.
FCT 2007: 288-299 |
| 50 | EE | Asaf Levin:
Approximating min-max k-clustering.
Fair Division 2007 |
| 49 | EE | Dorit S. Hochbaum,
Asaf Levin:
Covering the Edges of Bipartite Graphs Using K 2, 2 Graphs.
WAOA 2007: 116-127 |
| 48 | EE | Leah Epstein,
Asaf Levin:
On the Max Coloring Problem.
WAOA 2007: 142-155 |
| 47 | EE | Leah Epstein,
Asaf Levin:
Minimum Weighted Sum Bin Packing.
WAOA 2007: 218-231 |
| 46 | EE | Leah Epstein,
Asaf Levin:
SONET ADMs Minimization with Divisible Paths.
Algorithmica 49(1): 51-68 (2007) |
| 45 | EE | Refael Hassin,
Asaf Levin:
Flow trees for vertex-capacitated networks.
Discrete Applied Mathematics 155(4): 572-578 (2007) |
| 44 | EE | 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) |
| 43 | EE | Asaf Levin:
The finite horizon investor problem with a budget constraint.
Inf. Process. Lett. 104(1): 21-28 (2007) |
| 2006 |
|---|
| 42 | EE | 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 |
| 41 | EE | Leah Epstein,
Asaf Levin,
Gerhard J. Woeginger:
Graph Coloring with Rejection.
ESA 2006: 364-375 |
| 40 | EE | Leah Epstein,
Asaf Levin:
A Robust APTAS for the Classical Bin Packing Problem.
ICALP (1) 2006: 214-225 |
| 39 | EE | Leah Epstein,
Thomas Erlebach,
Asaf Levin:
Variable Sized Online Interval Coloring with Bandwidth.
SWAT 2006: 29-40 |
| 38 | EE | Leah Epstein,
Asaf Levin:
On Bin Packing with Conflicts.
WAOA 2006: 160-173 |
| 37 | EE | Dorit S. Hochbaum,
Asaf Levin:
The k-Allocation Problem and Its Variants.
WAOA 2006: 253-264 |
| 36 | EE | Asaf Levin:
Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search.
WAOA 2006: 290-301 |
| 35 | EE | Refael Hassin,
Asaf Levin:
The minimum generalized vertex cover problem.
ACM Transactions on Algorithms 2(1): 66-78 (2006) |
| 34 | EE | Dorit S. Hochbaum,
Asaf Levin:
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms.
Discrete Optimization 3(4): 327-340 (2006) |
| 33 | EE | Asaf Levin:
Real time scheduling with a budget: Parametric-search is better than binary search.
Inf. Process. Lett. 99(5): 187-191 (2006) |
| 32 | EE | Esther M. Arkin,
Refael Hassin,
Asaf Levin:
Approximations for minimum and min-max vehicle routing problems.
J. Algorithms 59(1): 1-18 (2006) |
| 31 | EE | Asaf Levin,
Gerhard J. Woeginger:
The constrained minimum weighted sum of job completion times problem.
Math. Program. 108(1): 115-126 (2006) |
| 30 | EE | Leah Epstein,
Asaf Levin:
The conference call search problem in wireless networks.
Theor. Comput. Sci. 359(1-3): 418-429 (2006) |
| 29 | EE | Asaf Levin,
Danny Segev:
Partial multicuts in trees.
Theor. Comput. Sci. 369(1-3): 384-395 (2006) |
| 2005 |
|---|
| 28 | EE | Leah Epstein,
Asaf Levin:
Tracking mobile users.
Algorithms for Optimization with Incomplete Information 2005 |
| 27 | EE | Refael Hassin,
Asaf Levin:
An Approximation Algorithm for the Minimum Latency Set Cover Problem.
ESA 2005: 726-733 |
| 26 | EE | Leah Epstein,
Asaf Levin:
SONET ADMs Minimization with Divisible Paths.
WAOA 2005: 119-132 |
| 25 | EE | Leah Epstein,
Asaf Levin:
The Conference Call Search Problem in Wireless Networks.
WAOA 2005: 133-146 |
| 24 | EE | Asaf Levin,
Danny Segev:
Partial Multicuts in Trees.
WAOA 2005: 320-333 |
| 23 | EE | Refael Hassin,
Asaf Levin:
A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem.
SIAM J. Comput. 35(1): 189-200 (2005) |
| 22 | EE | Leah Epstein,
Asaf Levin:
The chord version for SONET ADMs minimization.
Theor. Comput. Sci. 349(3): 337-346 (2005) |
| 2004 |
|---|
| 21 | EE | Refael Hassin,
Asaf Levin:
Approximation Algorithms for Quickest Spanning Tree Problems.
ESA 2004: 395-402 |
| 20 | EE | Asaf Levin,
Gerhard J. Woeginger:
The Constrained Minimum Weighted Sum of Job Completion Times Problem.
IPCO 2004: 298-307 |
| 19 | EE | Leah Epstein,
Asaf Levin:
Better Bounds for Minimizing SONET ADMs.
WAOA 2004: 281-294 |
| 18 | EE | Leah Epstein,
Asaf Levin:
A PTAS for Delay Minimization in Establishing Wireless Conference Calls.
WAOA 2004: 36-47 |
| 17 | EE | Refael Hassin,
Asaf Levin:
Approximation Algorithms for Quickest Spanning Tree Problems.
Algorithmica 41(1): 43-52 (2004) |
| 16 | EE | Jochen Könemann,
Asaf Levin,
Amitabh Sinha:
Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem.
Algorithmica 41(2): 117-129 (2004) |
| 15 | EE | Refael Hassin,
Asaf Levin:
Minimum restricted diameter spanning trees.
Discrete Applied Mathematics 137(3): 343-357 (2004) |
| 14 | EE | Refael Hassin,
Asaf Levin:
Synthesis of 2-Commodity Flow Networks.
Math. Oper. Res. 29(2): 280-288 (2004) |
| 13 | EE | Asaf Levin:
A better approximation algorithm for the budget prize collecting tree problem.
Oper. Res. Lett. 32(4): 316-319 (2004) |
| 12 | EE | Asaf Levin:
Strongly polynomial-time approximation for a class of bicriteria problems.
Oper. Res. Lett. 32(6): 530-534 (2004) |
| 11 | EE | 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) |
| 2003 |
|---|
| 10 | EE | Refael Hassin,
Asaf Levin:
The Minimum Generalized Vertex Cover Problem.
ESA 2003: 289-300 |
| 9 | EE | Jochen Könemann,
Asaf Levin,
Amitabh Sinha:
Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem.
RANDOM-APPROX 2003: 109-121 |
| 8 | EE | Asaf Levin,
Daniël Paulusma,
Gerhard J. Woeginger:
The Complexity of Graph Contractions.
WG 2003: 322-333 |
| 7 | | Refael Hassin,
Asaf Levin:
Subgraphs decomposable into two trees and k-edge-connected subgraphs.
Discrete Applied Mathematics 126(2-3): 181-195 (2003) |
| 6 | EE | Refael Hassin,
Asaf Levin,
Dana Morad:
Lexicographic local search and the p.
European Journal of Operational Research 151(2): 265-279 (2003) |
| 5 | EE | Refael Hassin,
Asaf Levin:
Minimum spanning tree with hop restrictions.
J. Algorithms 48(1): 220-238 (2003) |
| 4 | EE | Olivier Goldschmidt,
Dorit S. Hochbaum,
Asaf Levin,
Eli V. Olinick:
The SONET edge-partition problem.
Networks 41(1): 13-23 (2003) |
| 2002 |
|---|
| 3 | EE | Refael Hassin,
Asaf Levin:
Minimum Restricted Diameter Spanning Trees.
APPROX 2002: 175-184 |
| 2 | EE | Refael Hassin,
Asaf Levin:
Approximation algorithms for constructing wavelength routing networks.
Networks 40(1): 32-37 (2002) |
| 2001 |
|---|
| 1 | EE | Refael Hassin,
Asaf Levin:
Synthesis of 2-Commodity Flow Networks.
IPCO 2001: 226-235 |
