The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Asaf Levin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Refael Hassin, Asaf Levin
    Minimum Restricted Diameter Spanning Trees. [Citation Graph (0, 0)][DBLP]
    APPROX, 2002, pp:175-184 [Conf]
  2. Leah Epstein, Magnús M. Halldórsson, Asaf Levin, Hadas Shachnai
    Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2006, pp:116-127 [Conf]
  3. Leah Epstein, Asaf Levin
    Tracking mobile users. [Citation Graph (0, 0)][DBLP]
    Algorithms for Optimization with Incomplete Information, 2005, pp:- [Conf]
  4. Leah Epstein, Asaf Levin, Gerhard J. Woeginger
    Graph Coloring with Rejection. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:364-375 [Conf]
  5. Refael Hassin, Asaf Levin
    The Minimum Generalized Vertex Cover Problem. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:289-300 [Conf]
  6. Refael Hassin, Asaf Levin
    Approximation Algorithms for Quickest Spanning Tree Problems. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:395-402 [Conf]
  7. Refael Hassin, Asaf Levin
    An Approximation Algorithm for the Minimum Latency Set Cover Problem. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:726-733 [Conf]
  8. Leah Epstein, Asaf Levin
    A Robust APTAS for the Classical Bin Packing Problem. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:214-225 [Conf]
  9. Refael Hassin, Asaf Levin
    Synthesis of 2-Commodity Flow Networks. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:226-235 [Conf]
  10. Asaf Levin, Gerhard J. Woeginger
    The Constrained Minimum Weighted Sum of Job Completion Times Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 2004, pp:298-307 [Conf]
  11. Jochen Könemann, Asaf Levin, Amitabh Sinha
    Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2003, pp:109-121 [Conf]
  12. Leah Epstein, Thomas Erlebach, Asaf Levin
    Variable Sized Online Interval Coloring with Bandwidth. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:29-40 [Conf]
  13. Asaf Levin
    Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search. [Citation Graph (0, 0)][DBLP]
    WAOA, 2006, pp:290-301 [Conf]
  14. Leah Epstein, Asaf Levin
    On Bin Packing with Conflicts. [Citation Graph (0, 0)][DBLP]
    WAOA, 2006, pp:160-173 [Conf]
  15. Dorit S. Hochbaum, Asaf Levin
    The k-Allocation Problem and Its Variants. [Citation Graph (0, 0)][DBLP]
    WAOA, 2006, pp:253-264 [Conf]
  16. Asaf Levin, Danny Segev
    Partial Multicuts in Trees. [Citation Graph (0, 0)][DBLP]
    WAOA, 2005, pp:320-333 [Conf]
  17. Leah Epstein, Asaf Levin
    A PTAS for Delay Minimization in Establishing Wireless Conference Calls. [Citation Graph (0, 0)][DBLP]
    WAOA, 2004, pp:36-47 [Conf]
  18. Leah Epstein, Asaf Levin
    Better Bounds for Minimizing SONET ADMs. [Citation Graph (0, 0)][DBLP]
    WAOA, 2004, pp:281-294 [Conf]
  19. Leah Epstein, Asaf Levin
    SONET ADMs Minimization with Divisible Paths. [Citation Graph (0, 0)][DBLP]
    WAOA, 2005, pp:119-132 [Conf]
  20. Leah Epstein, Asaf Levin
    The Conference Call Search Problem in Wireless Networks. [Citation Graph (0, 0)][DBLP]
    WAOA, 2005, pp:133-146 [Conf]
  21. Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger
    The Complexity of Graph Contractions. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:322-333 [Conf]
  22. Refael Hassin, Asaf Levin
    Approximation Algorithms for Quickest Spanning Tree Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:41, n:1, pp:43-52 [Journal]
  23. Jochen Könemann, Asaf Levin, Amitabh Sinha
    Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:41, n:2, pp:117-129 [Journal]
  24. Refael Hassin, Asaf Levin
    Subgraphs decomposable into two trees and k-edge-connected subgraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:126, n:2-3, pp:181-195 [Journal]
  25. Refael Hassin, Asaf Levin
    Minimum restricted diameter spanning trees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:137, n:3, pp:343-357 [Journal]
  26. Refael Hassin, Asaf Levin
    Flow trees for vertex-capacitated networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:4, pp:572-578 [Journal]
  27. Asaf Levin
    Real time scheduling with a budget: Parametric-search is better than binary search. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:99, n:5, pp:187-191 [Journal]
  28. Esther M. Arkin, Refael Hassin, Asaf Levin
    Approximations for minimum and min-max vehicle routing problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2006, v:59, n:1, pp:1-18 [Journal]
  29. Refael Hassin, Asaf Levin
    Minimum spanning tree with hop restrictions. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:48, n:1, pp:220-238 [Journal]
  30. Refael Hassin, Asaf Levin
    Synthesis of 2-Commodity Flow Networks. [Citation Graph (0, 0)][DBLP]
    Math. Oper. Res., 2004, v:29, n:2, pp:280-288 [Journal]
  31. Asaf Levin, Gerhard J. Woeginger
    The constrained minimum weighted sum of job completion times problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:108, n:1, pp:115-126 [Journal]
  32. Refael Hassin, Asaf Levin
    Approximation algorithms for constructing wavelength routing networks. [Citation Graph (0, 0)][DBLP]
    Networks, 2002, v:40, n:1, pp:32-37 [Journal]
  33. Olivier Goldschmidt, Dorit S. Hochbaum, Asaf Levin, Eli V. Olinick
    The SONET edge-partition problem. [Citation Graph (0, 0)][DBLP]
    Networks, 2003, v:41, n:1, pp:13-23 [Journal]
  34. Asaf Levin
    A better approximation algorithm for the budget prize collecting tree problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:4, pp:316-319 [Journal]
  35. Asaf Levin
    Strongly polynomial-time approximation for a class of bicriteria problems. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:6, pp:530-534 [Journal]
  36. Refael Hassin, Asaf Levin
    An efficient polynomial time approximation scheme for the constrained minimum spanning tree problem using matroid intersection. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:2, pp:261-268 [Journal]
  37. Refael Hassin, Asaf Levin
    A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:1, pp:189-200 [Journal]
  38. Refael Hassin, Asaf Levin
    The minimum generalized vertex cover problem. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2006, v:2, n:1, pp:66-78 [Journal]
  39. Leah Epstein, Asaf Levin
    The chord version for SONET ADMs minimization. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:349, n:3, pp:337-346 [Journal]
  40. Leah Epstein, Asaf Levin
    The conference call search problem in wireless networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:359, n:1-3, pp:418-429 [Journal]
  41. Asaf Levin, Danny Segev
    Partial multicuts in trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:384-395 [Journal]
  42. Refael Hassin, Asaf Levin, Dana Morad
    Lexicographic local search and the p. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2003, v:151, n:2, pp:265-279 [Journal]
  43. Leah Epstein, Asaf Levin, Rob van Stee
    Multi-dimensional Packing with Conflicts. [Citation Graph (0, 0)][DBLP]
    FCT, 2007, pp:288-299 [Conf]
  44. Leah Epstein, Thomas Erlebach, Asaf Levin
    Online Capacitated Interval Coloring. [Citation Graph (0, 0)][DBLP]
    ESCAPE, 2007, pp:243-254 [Conf]
  45. Asaf Levin
    The finite horizon investor problem with a budget constraint. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:104, n:1, pp:21-28 [Journal]
  46. Eli Brosh, Asaf Levin, Yuval Shavitt
    Approximation and heuristic algorithms for minimum-delay application-layer multicast trees. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2007, v:15, n:2, pp:473-484 [Journal]

  47. Approximating min-max k-clustering. [Citation Graph (, )][DBLP]


  48. Improved Randomized Results for That Interval Selection Problem. [Citation Graph (, )][DBLP]


  49. Max-min Online Allocations with a Reordering Buffer. [Citation Graph (, )][DBLP]


  50. Universal Sequencing on a Single Machine. [Citation Graph (, )][DBLP]


  51. Online Clustering with Variable Sized Clusters. [Citation Graph (, )][DBLP]


  52. Finding mobile data under delay constraints with searching costs. [Citation Graph (, )][DBLP]


  53. Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model. [Citation Graph (, )][DBLP]


  54. Minimum Weighted Sum Bin Packing. [Citation Graph (, )][DBLP]


  55. On the Max Coloring Problem. [Citation Graph (, )][DBLP]


  56. Covering the Edges of Bipartite Graphs Using K 2, 2 Graphs. [Citation Graph (, )][DBLP]


  57. On Equilibria for ADM Minimization Games. [Citation Graph (, )][DBLP]


  58. Two-dimensional packing with conflicts. [Citation Graph (, )][DBLP]


  59. SONET ADMs Minimization with Divisible Paths. [Citation Graph (, )][DBLP]


  60. Variable Sized Online Interval Coloring with Bandwidth. [Citation Graph (, )][DBLP]


  61. Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs. [Citation Graph (, )][DBLP]


  62. Uniform unweighted set cover: The power of non-oblivious local search [Citation Graph (, )][DBLP]


  63. AFPTAS results for common variants of bin packing: A new method to handle the small items [Citation Graph (, )][DBLP]


  64. Bin packing with general cost structures [Citation Graph (, )][DBLP]


  65. Improved approximation guarantees for weighted matching in the semi-streaming model [Citation Graph (, )][DBLP]


  66. On the sum minimization version of the online bin covering problem. [Citation Graph (, )][DBLP]


Search in 0.030secs, Finished in 0.032secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002