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=J. Algorithms AND Volume=48
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A linear lower bound on index size for text retrieval
Erik D. Demaine
,
Alejandro López-Ortiz
Journal of Algorithms
48
(1), 2003, pp. 2-15
Making data structures confluently persistent
Amos Fiat
,
Haim Kaplan
Journal of Algorithms
48
(1), 2003, pp. 16-58
Competitive on-line stream merging algorithms for media-on-demand
Amotz Bar-Noy
,
Richard E. Ladner
Journal of Algorithms
48
(1), 2003, pp. 59-90
Average-case complexity of single-source shortest-paths algorithms: Lower and upper bounds
Ulrich Meyer
Journal of Algorithms
48
(1), 2003, pp. 91-134
Approximation algorithms for TSP with neighborhoods in the plane
Adrian Dumitrescu
,
Joseph S.B. Mitchell
Journal of Algorithms
48
(1), 2003, pp. 135-159
Robust algorithms for restricted domains
Vijay Raghavan
,
Jeremy Spinrad
Journal of Algorithms
48
(1), 2003, pp. 160-172
Performance study of phylogenetic methods: (Unweighted) quartet methods and neighbor-joining
Katherine St. John
,
Tandy Warnow
,
Bernard M.E. Moret
,
Lisa Vawter
Journal of Algorithms
48
(1), 2003, pp. 173-193
An efficient graph algorithm for dominance constraints
Ernst Althaus
,
Denys Duchier
,
Alexander Koller
,
Kurt Mehlhorn
,
Joachim Niehren
,
Sven Thiel
Journal of Algorithms
48
(1), 2003, pp. 194-219
Minimum spanning tree with hop restrictions
Refael Hassin
,
Asaf Levin
Journal of Algorithms
48
(1), 2003, pp. 220-238
Packing cycles in undirected graphs
Alberto Caprara
,
Alessandro Panconesi
,
Romeo Rizzi
Journal of Algorithms
48
(1), 2003, pp. 239-256
Capacitated vertex covering
Sudipto Guha
,
Refael Hassin
,
Samir Khuller
,
Einat Or
Journal of Algorithms
48
(1), 2003, pp. 257-270
A better algorithm for sequencing with release and delivery times on identical machines
Nodari Vakhania
Journal of Algorithms
48
(2), 2003, pp. 273-293
New text indexing functionalities of the compressed suffix arrays
Kunihiko Sadakane
Journal of Algorithms
48
(2), 2003, pp. 294-313
Scheduling data transfers in a network and the set scheduling problem
Ashish Goel
,
Monika R. Henzinger
,
Serge Plotkin
,
Eva Tardos
Journal of Algorithms
48
(2), 2003, pp. 314-332
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
Gruia Cȃlinescu
,
Cristina G. Fernandes
,
Bruce Reed
Journal of Algorithms
48
(2), 2003, pp. 333-359
Vector assignment problems: A general framework
Leah Epstein
,
Tamir Tassa
Journal of Algorithms
48
(2), 2003, pp. 360-384
Optimal mappings with minimum number of connected components in tree-to-tree comparison problems
Pascal Ferraro
,
Christophe Godin
Journal of Algorithms
48
(2), 2003, pp. 385-406
Dynamic TCP acknowledgment in the LogP model
Jens S. Frederiksen
,
Kim S. Larsen
,
John Noga
,
Patchrawat Uthaisombut
Journal of Algorithms
48
(2), 2003, pp. 407-428
A constant factor approximation algorithm for the fault-tolerant facility location problem
Sudipto Guha
,
Adam Meyerson
,
Kamesh Munagala
Journal of Algorithms
48
(2), 2003, pp. 429-440
Compact floor-planning via orderly spanning trees
Chien-Chih Liao
,
Hsueh-I Lu
,
Hsu-Chun Yen
Journal of Algorithms
48
(2), 2003, pp. 441-451