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: Journal=Algorithmica AND Volume=40
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Computing optimal diameter-bounded polygon partitions
Mirela Damian
,
Sriram V. Pemmaraju
Algorithmica
40
(1), 2004, pp. 1-14
An efficient fixed parameter tractable algorithm for 1-sided crossing minimization
Vida Dujmović
,
Sue Whitesides
Algorithmica
40
(1), 2004, pp. 15-31
Engineering a lightweight suffix array construction algorithm
Giovanni Manzini
,
Paolo Ferragina
Algorithmica
40
(1), 2004, pp. 33-50
Minimum cycle bases for network graphs
Franziska Berger
,
Peter Gritzmann
,
Sven de Vries
Algorithmica
40
(1), 2004, pp. 51-62
The Hausdorff Voronoi diagram of point clusters in the plane
Evanthia Papadopoulou
Algorithmica
40
(2), 2004, pp. 63-82
Using nondeterminism to design efficient deterministic algorithms
Jianer Chen
,
Donald K. Firesen
,
Weijia Jia
,
Iyad A. Kanj
Algorithmica
40
(2), 2004, pp. 83-97
A conjecture on Wiener indices in combinatorial chemistry
Yih-En Andrew Ban
,
Sergey Bereg
,
Nabil H. Mustafa
Algorithmica
40
(2), 2004, pp. 99-117
Nearly linear time minimum spanning tree maintenance for transient node failures
Enrico Nardelli
,
Guido Proietti
,
Peter Widmayer
Algorithmica
40
(2), 2004, pp. 119-132
New results in minimum-comparison sorting
Marcin Peczarski
Algorithmica
40
(2), 2004, pp. 133-145
Pattern matching for sets of segments
Alon Efrat
,
Piotr Indyk
,
Suresh Venkatasubramanian
Algorithmica
40
(3), 2004, pp. 147-160
A linear-time approximation scheme for maximum weight triangulation of convex polygons
Jianbo Qian
,
Cao An Wang
Algorithmica
40
(3), 2004, pp. 161-172
Multidimensional cube packing
Yoshiharu Kohayakawa
,
Flavio Keidi Miyazawa
,
Prabhakar Raghavan
,
Yoshiko Wakabayashi
Algorithmica
40
(3), 2004, pp. 173-187
Approximation schemes for degree-restricted MST and red-blue separation problems
Sanjeev Arora
,
Kevin Chang
Algorithmica
40
(3), 2004, pp. 189-210
Diameter and treewidth in minor-closed graph families, revisited
Erik D. Demaine
,
Mohammad Taghi Hajiaghayi
Algorithmica
40
(3), 2004, pp. 211-215
Approximating min sum set cover
Uriel Feige
,
László Lovász
,
Prasad Tetali
Algorithmica
40
(4), 2004, pp. 219-234
Sum coloring of bipartite graphs with bounded degree
Michaƚ Maƚafiejski
,
Krzysztof Giaro
,
Robert Janczewski
,
Marek Kubale
Algorithmica
40
(4), 2004, pp. 235-244
Prima-dual algorithms for connected facility location problems
Chaitanya Swamy
,
Amit Kumar
Algorithmica
40
(4), 2004, pp. 245-269
The power of priority algorithms for facility location and set cover
Spyros Angelopoulos
,
Allan Borodin
Algorithmica
40
(4), 2004, pp. 271-291
Admission control in networks with advance reservations
Liane Lewin-Eytan
,
Joseph (Seffi) Naor
,
Ariel Orda
Algorithmica
40
(4), 2004, pp. 293-304
Non-clairvoyant scheduling for minimizing mean slowdown
Nikhil Bansal
,
Kedar Dhamdhere
,
Jochen Könemann
,
Amitabh Sinha
Algorithmica
40
(4), 2004, pp. 305-318
On-line dial-a-ride problems under a restricted information model
Maarten Lipmann
,
Xiwen Lu
,
Willem E. de Paepe
,
Rene A. Sitters
,
Leen Stougie
Algorithmica
40
(4), 2004, pp. 319-329