The finite horizon investor problem with a budget constraintLEVIN, Asaf.Information processing letters. 2007, Vol 104, Num 1, pp 21-28, issn 0020-0190, 8 p.Article

Real time scheduling with a budget : Parametric-search is better than binary searchLEVIN, Asaf.Information processing letters. 2006, Vol 99, Num 5, pp 187-191, issn 0020-0190, 5 p.Article

APPROXIMATING THE UNWEIGHTED k-SET COVER PROBLEM: GREEDY MEETS LOCAL SEARCHLEVIN, Asaf.SIAM journal on discrete mathematics (Print). 2010, Vol 23, Num 1, pp 251-264, issn 0895-4801, 14 p.Article

Improved randomized results for the interval selection problemEPSTEIN, Leah; LEVIN, Asaf.Theoretical computer science. 2010, Vol 411, Num 34-36, pp 3129-3135, issn 0304-3975, 7 p.Article

Flow trees for vertex-capacitated networksHASSIN, Refael; LEVIN, Asaf.Discrete applied mathematics. 2007, Vol 155, Num 4, pp 572-578, issn 0166-218X, 7 p.Article

The chord version for SONET ADMs minimizationEPSTEIN, Leah; LEVIN, Asaf.Theoretical computer science. 2005, Vol 349, Num 3, pp 337-346, issn 0304-3975, 10 p.Article

Robust Algorithms for Preemptive SchedulingEPSTEIN, Leah; LEVIN, Asaf.Algorithmica. 2014, Vol 69, Num 1, pp 26-57, issn 0178-4617, 32 p.Article

Uniform unweighted set cover: The power of non-oblivious local searchLEVIN, Asaf; YOVEL, Uri.Theoretical computer science. 2011, Vol 412, Num 12-14, pp 1033-1053, issn 0304-3975, 21 p.Article

How to allocate review tasks for robust rankingHOCHBAUM, Dorit S; LEVIN, Asaf.Acta informatica. 2010, Vol 47, Num 5-6, pp 325-345, issn 0001-5903, 21 p.Article

Partial multicuts in treesLEVIN, Asaf; SEGEY, Danny.Theoretical computer science. 2006, Vol 369, Num 1-3, pp 384-395, issn 0304-3975, 12 p.Article

An approximation algorithm for the minimum latency set cover problemHASSIN, Refael; LEVIN, Asaf.Lecture notes in computer science. 2005, pp 726-733, issn 0302-9743, isbn 3-540-29118-0, 1Vol, 8 p.Conference Paper

Nonoblivious 2-Opt Heuristics for the Traveling Salesman ProblemLEVIN, Asaf; YOVEL, Uri.Networks (New York, NY). 2013, Vol 62, Num 3, pp 201-219, issn 0028-3045, 19 p.Article

Asymptotic fully polynomial approximation schemes for variants of open-end bin packingEPSTEIN, Leah; LEVIN, Asaf.Information processing letters. 2008, Vol 109, Num 1, pp 32-37, issn 0020-0190, 6 p.Article

Methodologies and algorithms for group-rankings decisionHOCHBAUM, Dorit S; LEVIN, Asaf.Management science. 2006, Vol 52, Num 9, pp 1394-1408, issn 0025-1909, 15 p.Article

Minimum restricted diameter spanning treesHASSIN, Refael; LEVIN, Asaf.Discrete applied mathematics. 2004, Vol 137, Num 3, pp 343-357, issn 0166-218X, 15 p.Article

Approximation algorithms for constructing wavelength routing networksHASSIN, Refael; LEVIN, Asaf.Networks (New York, NY). 2002, Vol 40, Num 1, pp 32-37, issn 0028-3045Article

A robust APTAS for the classical bin packing problemEPSTEIN, Leah; LEVIN, Asaf.Mathematical programming (Print). 2009, Vol 119, Num 1, pp 33-49, issn 0025-5610, 17 p.Article

A better-than-greedy approximation algorithm for the minimum set cover problemHASSIN, Refael; LEVIN, Asaf.SIAM journal on computing (Print). 2006, Vol 35, Num 1, pp 189-200, issn 0097-5397, 12 p.Article

The conference call search problem in wireless networksEPSTEIN, Leah; LEVIN, Asaf.Theoretical computer science. 2006, Vol 359, Num 1-3, pp 418-429, issn 0304-3975, 12 p.Article

Subgraphs decomposable into two trees and k-edge-connected subgraphsHASSIN, Refael; LEVIN, Asaf.Discrete applied mathematics. 2003, Vol 126, Num 2-3, pp 181-195, issn 0166-218X, 15 p.Article

Bin packing with general cost structuresEPSTEIN, Leah; LEVIN, Asaf.Mathematical programming (Print). 2012, Vol 132, Num 1-2, pp 355-391, issn 0025-5610, 37 p.Article

On Equilibria for ADM Minimization GamesEPSTEIN, Leah; LEVIN, Asaf.Algorithmica. 2012, Vol 63, Num 1-2, pp 246-273, issn 0178-4617, 28 p.Article

AN APTAS FOR GENERALIZED COST VARIABLE-SIZED BIN PACKINGEPSTEIN, Leah; LEVIN, Asaf.SIAM journal on computing (Print). 2008, Vol 38, Num 1, pp 411-428, issn 0097-5397, 18 p.Article

SONET ADMs minimization with divisible pathsEPSTEIN, Leah; LEVIN, Asaf.Algorithmica. 2007, Vol 49, Num 1, pp 51-68, issn 0178-4617, 18 p.Article

An efficient polynomial time approximation scheme for the constrained minimum spanning tree problem using matroid intersectionHASSIN, Refael; LEVIN, Asaf.SIAM journal on computing (Print). 2004, Vol 33, Num 2, pp 261-268, issn 0097-5397, 8 p.Article