Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="van Stee, Rob"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Maximizing the minimum load: The cost of selfishness
Xujin Chen
,
Leah Epstein
,
Elena Kleiman
,
Rob van Stee
Theoretical Computer Science
482
, 2013, pp. 9-19
A truthful constant approximation for maximizing the minimum load on related machines
George Christodoulou
,
Annamária Kovács
,
Rob van Stee
Theoretical Computer Science
489-490
, 2013, pp. 88-98
Two for one: Tight approximation of 2D bin packing work
Rolf Harren
,
Klaus Jansen
,
Lars Prädel
,
Ulrich M. Schwarz
,
Rob van Stee
International Journal of Foundations of Computer Science
24
(8), 2013, pp. 1299-1327
A note on sorting buffers offline
Ho-Leung Chan
,
Nicole Megow
,
René Sitters
,
Rob van Stee
Theoretical Computer Science
423
, 2012, pp. 11-18
Approximation schemes for packing splittable items with cardinality constraints
Leah Epstein
,
Asaf Levin
,
Rob van Stee
Algorithmica
62
(1-2), 2012, pp. 102-129
The price of anarchy on uniformly related machines revisited
Leah Epstein
,
Rob van Stee
Information and Computation
212
, 2012, pp. 37-54
An improved algorithm for online rectangle filling
Rob van Stee
Theoretical Computer Science
423
, 2012, pp. 59-74
Max-min online allocations with a reordering buffer
Leah Epstein
,
Asaf Levin
,
Rob van Stee
SIAM Journal on Discrete Mathematics
25
(3), 2011, pp. 1230-1250
Improved results for a memory allocation problem
Leah Epstein
,
Rob van Stee
Theory of Computing Systems
48
(1), 2011, pp. 79-92
A
(5/3+\epsilon)
-approximation for strip packing
Rolf Harren
,
Klaus Jansen
,
Lars Prädel
,
Rob van Stee
Lecture Notes in Computer Science
6844
, 2011, pp. 475-487
Max-min online allocations with a reordering buffer
Leah Epstein
,
Asaf Levin
,
Rob van Stee
Lecture Notes in Computer Science
6198
, 2010, pp. 336-347
Maximizing the minimum load for selfish agents
Leah Epstein
,
Rob van Stee
Theoretical Computer Science
411
(1), 2010, pp. 44-57
Paging with request sets
Leah Epstein
,
Rob van Stee
,
Tami Tamir
Theory of Computing Systems
44
(1), 2009, pp. 67-81
Two-dimensional packing with conflicts
Leah Epstein
,
Asaf Levin
,
Rob van Stee
Acta Informatica
45
(3), 2008, pp. 155-175
Online unit clustering: Variations on a theme
Leah Epstein
,
Asaf Levin
,
Rob van Stee
Theoretical Computer Science
407
(1-3), 2008, pp. 85-96
Packing rectangles into 2OPT bins using rotations
Rolf Harren
,
Rob van Stee
Lecture Notes in Computer Science
5124
, 2008, pp. 306-318
Speed scaling of tasks with precedence constraints
Kirk Pruhs
,
Rob van Stee
,
Patchrawat Uthaisombut
Theory of Computing Systems
43
(1), 2008, pp. 67-80
A study of integrated document and connection caching in the WWW
Susanne Albers
,
Rob van Stee
Algorithmica
47
(3), 2007, pp. 239-252
Paging with connections: FIFO strikes again
Leah Epstein
,
Yanir Kleiman
,
Jiȓí Sgall
,
Rob van Stee
Theoretical Computer Science
377
(1-3), 2007, pp. 55-64
Improved results for a memory allocation problem
Leah Epstein
,
Rob van Stee
Lecture Notes in Computer Science
4619
, 2007, pp. 362-373
Paging with request sets
Leah Epstein
,
Rob van Stee
,
Tami Tamir
Lecture Notes in Computer Science
4059
, 2006, pp. 124-135
Online square and cube packing
Leah Epstein
,
Rob van Stee
Acta Informatica
41
(9), 2005, pp. 595-606
Online bin packing with resource augmentation
Leah Epstein
,
Rob van Stee
Lecture Notes in Computer Science
3351
, 2005, pp. 23-35
This side up!
Leah Epstein
,
Rob van Stee
Lecture Notes in Computer Science
3351
, 2005, pp. 48-60
Optimal online algorithms for multidimensional packing problems
Leah Epstein
,
Rob van Stee
SIAM Journal on Computing
35
(2), 2005, pp. 431-448
Seiten 1
2
>