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=41
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An experimental analysis of simple, distributed vertex coloring algorithms
Irene Finocchi
,
Alessandro Panconesi
,
Riccardo Silvestri
Algorithmica
41
(1), 2005, pp. 1-23
Computing diameter in the streaming and sliding-window models
Joan Feigenbaum
,
Sampath Kannan
,
Jian Zhang
Algorithmica
41
(1), 2005, pp. 25-41
Approximation algorithms for quickest spanning tree problems
Refael Hassin
,
Asaf Levin
Algorithmica
41
(1), 2005, pp. 43-52
A polynomial time approximation scheme for minimum cost delay-constrained multicast tree under a Steiner topology
Guoliang Xue
,
Wei Xiao
Algorithmica
41
(1), 2005, pp. 53-72
Graph searching, elimination trees, and a generalization of bandwidth
Fedor V. Fomin
,
Pinar Heggernes
,
Jan Arne Telle
Algorithmica
41
(2), 2005, pp. 73-87
New techniques for regular expression searching
Gonzalo Navarro
,
Mathieu Raffinot
Algorithmica
41
(2), 2005, pp. 89-116
Approximating the degree-bounded minimum diameter spanning tree problem
Jochen Könemann
,
Asaf Levin
,
Amitabh Sinha
Algorithmica
41
(2), 2005, pp. 117-129
A branch-checking algorithm for all-pairs shortest paths
Cees Duin
Algorithmica
41
(2), 2005, pp. 131-145
Fast algorithms for computing the smallest
k
-enclosing circle
Sariel Har-Peled
,
Soham Mazumdar
Algorithmica
41
(3), 2005, pp. 147-157
Matching polyhedral terrains using overlays of envelopes
Vladlen Koltun
,
Carola Wenk
Algorithmica
41
(3), 2005, pp. 159-183
How fast is the
k
-means method?
Sariel Har-Peled
,
Bardia Sadri
Algorithmica
41
(3), 2005, pp. 185-202
Bit-parallel witnesses and their applications to approximate string matching
Heikki Hyyrö
,
Gonzalo Navarro
Algorithmica
41
(3), 2005, pp. 203-231
Geographic quorum system approximations
Paz Carmi
,
Shlomi Dolev
,
Sariel Har-Peled
,
Matthew J. Katz
,
Michael Segal
Algorithmica
41
(4), 2005, pp. 233-244
Exponential speedup of fixed-parameter algorithms for classes of graphs excluding single-crossing graphs as minors
Erik D. Demaine
,
Mohammadtaghi Hajiaghayi
,
Dimitrios M. Thilikos
Algorithmica
41
(4), 2005, pp. 245-267
Optimal two-description scalar quantizer design
Sorina Dumitrescu
,
Xiaolin Wu
Algorithmica
41
(4), 2005, pp. 269-287
Inserting an edge into a planar graph
Carsten Gutwenger
,
Petra Mutzel
,
René Weiskircher
Algorithmica
41
(4), 2005, pp. 289-308
New approximation results for the maximum scatter TSP
Yi-Jen Chiang
Algorithmica
41
(4), 2005, pp. 309-341