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
Hilfe
Suche: Author="Stein, Clifford"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Partitioning planar graphs with costs and weights
Lyudmil Aleksandrov
,
Hristo Djidjev
,
Hua Guo
,
Anil Maheshwari
Lecture Notes in Computer Science
2409
, 2002, pp. 98-110
Maintaining dynamic minimum spanning trees: An experimental study
Giuseppe Cattaneo
,
Pompeo Faruolo
,
Umberto Ferraro Petrillo
,
Giuseppe F. Italiano
Lecture Notes in Computer Science
2409
, 2002, pp. 111-125
Getting more from out-of-core columnsort
Geeta Chaudhry
,
Thomas H. Cormen
Lecture Notes in Computer Science
2409
, 2002, pp. 143-154
An improvement on Tree Selection Sort
Jingchao Chen
Lecture Notes in Computer Science
2409
, 2002, pp. 194-205
An experimental study of prefetching and caching algorithms for the World Wide Web
Massimiliano Curcio
,
Stefano Leonardi
,
Andrea Vitaletti
Lecture Notes in Computer Science
2409
, 2002, pp. 71-85
The treewidth of Java programs
Jens Gustedt
,
Ole A. Mæhle
,
Jan Arne Telle
Lecture Notes in Computer Science
2409
, 2002, pp. 86-97
A compressed breadth-first search for satisfiability
DoRon B. Motter
,
Igor L. Markov
Lecture Notes in Computer Science
2409
, 2002, pp. 29-42
Experimental evaluation of a new shortest path algorithm
Seth Pettie
,
Vijaya Ramachandran
,
Srinath Sridhar
Lecture Notes in Computer Science
2409
, 2002, pp. 126-142
A time-sensitive system for black-box combinatorial optimization
Vinhthuy Phan
,
Pavel Sumazin
,
Steven Skiena
Lecture Notes in Computer Science
2409
, 2002, pp. 16-28
Acceleration of K-means and related clustering algorithms
Steven J. Phillips
Lecture Notes in Computer Science
2409
, 2002, pp. 166-177
On the implementation of MST-based heuristics for the Steiner problem in graphs
Marcus Poggi de Aragão
,
Renato F. Werneck
Lecture Notes in Computer Science
2409
, 2002, pp. 1-15
STAR-tree: An efficient self-adjusting index for moving objects
Cecilia M. Procopiuc
,
Pankaj K. Agarwal
,
Sariel Har-Peled
Lecture Notes in Computer Science
2409
, 2002, pp. 178-193
Evaluating the local ratio algorithm for dynamic storage allocation
Kirk Pruhs
,
Eric Wiewiora
Lecture Notes in Computer Science
2409
, 2002, pp. 60-70
Topological sweep in degenerate cases
Eynat Rafalin
,
Diane Souvaine
,
Ileana Streinu
Lecture Notes in Computer Science
2409
, 2002, pp. 155-165
Using multi-level graphs for timetable information in railway systems
Frank Schulz
,
Dorothea Wagner
,
Christos Zaroliagis
Lecture Notes in Computer Science
2409
, 2002, pp. 43-59
Solutions to selected exercises in scheduling: Theory, algorithms and systems (second edition)
Clifford Stein
Technical Report, 2002
Approximation algorithms for single-source unsplittable flow
Stavros G. Kolliopoulos
,
Clifford Stein
SIAM Journal on Computing
31
(3), 2001-2002, pp. 919-946
Approximation algorithms for the minimum bends Traveling Salesman Problem
Clifford Stein
,
David P. Wagner
Lecture Notes in Computer Science
2081
, 2001, pp. 406-421
Experimental evaluation of approximation algorithms for single-source unsplittable flow
Stavros G. Kolliopoulos
,
Clifford Stein
Lecture Notes in Computer Science
1610
, 1999, pp. 328-344
A
2\frac{2}{3}
superstring approximation algorithm
Chris Armen
,
Clifford Stein
Discrete Applied Mathematics
88
(1-3), 1998, pp. 29-57
Finding real-valued single-source shortest paths in
o(n^3)
expected time
Stavros G. Kolliopoulos
,
Clifford Stein
Journal of Algorithms
28
(1), 1998, pp. 125-141
Approximating disjoint-path problems using greedy algorithms and packing integer programs
Stavros G. Kolliopoulos
,
Clifford Stein
Lecture Notes in Computer Science
1412
, 1998, pp. 153-168
Distributed job scheduling in rings
Perry Fizzano
,
David Karger
,
Clifford Stein
,
Joel Wein
Journal Parallel Distributed Computing
45
(2), 1997, pp. 122-133
Improved approximation algorithms for unsplittable flow problems
Stavros G. Kolliopoulos
,
Clifford Stein
Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, FOCS'97 (Miami Beach, Florida, October 20-22, 1997)
, 1997, pp. 426-435
Task scheduling in networks
Cynthia Phillips
,
Clifford Stein
,
Joel Wein
SIAM Journal on Discrete Mathematics
10
(4), 1997, pp. 573-598
Seiten 1
2
>