How helpers hasten h-relationsSANDERS, Peter; SOLIS-OBA, Roberto.Journal of algorithms (Print). 2001, Vol 41, Num 1, pp 86-98, issn 0196-6774Article

A simple OPT + 1 algorithm for cutting stock under the modified integer round-up property assumptionJANSEN, Klaus; SOLIS-OBA, Roberto.Information processing letters. 2011, Vol 111, Num 10, pp 479-482, issn 0020-0190, 4 p.Article

Approximation algorithms for bounded facility location problemsKRYSTA, Piotr; SOLIS-OBA, Roberto.Journal of combinatorial optimization. 2001, Vol 5, Num 2, pp 233-247, issn 1382-6905Article

Approximation and Online AlgorithmsJANSEN, Klaus; SOLIS-OBA, Roberto.Theoretical computer science. 2006, Vol 361, Num 2-3, issn 0304-3975, 228 p.Serial Issue

An asymptotic fully polynomial time approximation scheme for bin coveringJANSEN, Klaus; SOLIS-OBA, Roberto.Theoretical computer science. 2003, Vol 306, Num 1-3, pp 543-551, issn 0304-3975, 9 p.Article

Approximation and online algorithms (Budapest, 16-18 September 2003, revised papers)Jansen, Klaus; Solis-Oba, Roberto.Lecture notes in computer science. 2004, issn 0302-9743, isbn 3-540-21079-2, VIII, 268 p, isbn 3-540-21079-2Conference Proceedings

Efficient algorithms for robustness in resource allocation and scheduling problemsFREDERICKSON, Greg N; SOLIS-OBA, Roberto.Theoretical computer science. 2006, Vol 352, Num 1-3, pp 250-265, issn 0304-3975, 16 p.Article

Incremental algorithms for Facility Location and κ-MedianFOTAKIS, Dimitris.Theoretical computer science. 2006, Vol 361, Num 2-3, pp 275-313, issn 0304-3975, 39 p.Article

Minimum sum multicoloring on the edges of treesMARX, Daniel.Theoretical computer science. 2006, Vol 361, Num 2-3, pp 133-149, issn 0304-3975, 17 p.Article

Minimum sum multicoloring on the edges of treesMARX, Daniel.Lecture notes in computer science. 2004, pp 214-226, issn 0302-9743, isbn 3-540-21079-2, 13 p.Conference Paper

Online deadline scheduling: Team adversary and restartLEE, Jae-Ha.Lecture notes in computer science. 2004, pp 206-213, issn 0302-9743, isbn 3-540-21079-2, 8 p.Conference Paper

An asymptotic fully polynomial time approximation scheme for bin coveringJANSEN, Klaus; SOLIS-OBA, Roberto.Lecture notes in computer science. 2002, pp 175-186, issn 0302-9743, isbn 3-540-00142-5, 12 p.Conference Paper

Asymmetry in k-center variantsGØRTZ, Inge Li; WIRTH, Anthony.Theoretical computer science. 2006, Vol 361, Num 2-3, pp 188-199, issn 0304-3975, 12 p.Article

Optimal on-line algorithms to minimize makespan on two machines with resource augmentationEPSTEIN, Leah; GANOT, Arik.Lecture notes in computer science. 2004, pp 109-122, issn 0302-9743, isbn 3-540-21079-2, 14 p.Conference Paper

Combinatorial interpretations of dual fitting and primal fittingFREUND, Ari; RAWITZ, Dror.Lecture notes in computer science. 2004, pp 137-150, issn 0302-9743, isbn 3-540-21079-2, 14 p.Conference Paper

On the approximability of the minimum fundamental cycle basis problemGALBIATIL, Giulia; AMALDI, Edoardo.Lecture notes in computer science. 2004, pp 151-164, issn 0302-9743, isbn 3-540-21079-2, 14 p.Conference Paper

Online coloring of intervals with bandwidthADAMY, Udo; ERLEBACH, Thomas.Lecture notes in computer science. 2004, pp 1-12, issn 0302-9743, isbn 3-540-21079-2, 12 p.Conference Paper

The pledge algorithm reconsidered under errors in sensors and motionKAMPHANS, Tom; LANGETEPE, Elmar.Lecture notes in computer science. 2004, pp 165-178, issn 0302-9743, isbn 3-540-21079-2, 14 p.Conference Paper

Scheduling to minimize average completion time revisited: Deterministic on-line algorithmsMEGOW, Nicole; SCHULZ, Andreas S.Lecture notes in computer science. 2004, pp 227-234, issn 0302-9743, isbn 3-540-21079-2, 8 p.Conference Paper

Approximation algorithms for the k-median problemSOLIS-OBA, Roberto.Efficient approximation and online algorithms (recent progress on classical combinatorial optimization problems and new applications). Lecture notes in computer science. 2006, pp 292-320, issn 0302-9743, isbn 3-540-32212-4, 1Vol, 29 p.Book Chapter

On-line extensible bin packing with unequal bin sizesDESHI YE; GUOCHUAN ZHANG.Lecture notes in computer science. 2004, pp 235-247, issn 0302-9743, isbn 3-540-21079-2, 13 p.Conference Paper

Load balancing of temporary tasks in the ℓ_p normAZAR, Yossi; EPSTEIN, Amir; EPSTEIN, Leah et al.Theoretical computer science. 2006, Vol 361, Num 2-3, pp 314-328, issn 0304-3975, 15 p.Article

Tradeoffs in worst-case equilibriaAWERBUCH, Baruch; AZAR, Yossi; RICHTER, Yossi et al.Theoretical computer science. 2006, Vol 361, Num 2-3, pp 200-209, issn 0304-3975, 10 p.Article

On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problemsUMA, R. N; WEIN, Joel; WILLIAMSON, David P et al.Theoretical computer science. 2006, Vol 361, Num 2-3, pp 241-256, issn 0304-3975, 16 p.Article

Approximation algorithms for scheduling jobs with chain precedence constraintsJANSEN, Klaus; SOLIS-OBA, Roberto.Lecture notes in computer science. 2004, pp 105-112, issn 0302-9743, isbn 3-540-21946-3, 8 p.Conference Paper