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 YEAR=2003
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Approximate coloring of uniform hypergraphs
Michael Krivelevich
,
Benny Sudakov
Journal of Algorithms
49
(1), 2003, pp. 2-12
Finding an optimal path without growing the tree
Danny Z. Chen
,
Ovidiu Daescu
,
Xiaobo (Sharon) Hu
,
Jinhui Xu
Journal of Algorithms
49
(1), 2003, pp. 13-41
Fitting points on the real line and its application to RH mapping
Johan Håstad
,
Lars Ivansson
,
Jens Lagergren
Journal of Algorithms
49
(1), 2003, pp. 42-62
Maximizing job completions online
Bala Kalyanasundaram
,
Kirk R. Pruhs
Journal of Algorithms
49
(1), 2003, pp. 63-85
Fully dynamic shortest paths in digraphs with arbitrary arc weights
Daniele Frigioni
,
Alberto Marchetti-Spaccamela
,
Umberto Nanni
Journal of Algorithms
49
(1), 2003, pp. 86-113
\Delta
-stepping: A parallelizable shortest path algorithm
U. Meyer
,
P. Sanders
Journal of Algorithms
49
(1), 2003, pp. 114-152
The moving-target Traveling Salesman problem
C.S. Helvig
,
Gabriel Robins
,
Alex Zelikovsky
Journal of Algorithms
49
(1), 2003, pp. 153-174
Techniques for scheduling with rejection
Daniel W. Engels
,
David R. Karger
,
Stavros G. Kolliopoulos
,
Sudipta Sengupta
,
R.N. Uma
,
Joel Wein
Journal of Algorithms
49
(1), 2003, pp. 175-191
Analogs & duals of the MAST problem for sequences & trees
Michael Fellows
,
Michael Hallett
,
Ulrike Stege
Journal of Algorithms
49
(1), 2003, pp. 192-216
Dispatching in perfectly-periodic schedules
Zvika Brakerski
,
Vladimir Dreizin
,
Boaz Patt-Shamir
Journal of Algorithms
49
(2), 2003, pp. 219-239
Inplace 2D matching in compressed images
Amihood Amir
,
Gad M. Landau
,
Dina Sokol
Journal of Algorithms
49
(2), 2003, pp. 240-261
Matching planar maps
Helmut Alt
,
Alon Efrat
,
Günter Rote
,
Carola Wenk
Journal of Algorithms
49
(2), 2003, pp. 262-283
Computing homotopic shortest paths in the plane
Sergei Bespamyatnikh
Journal of Algorithms
49
(2), 2003, pp. 284-303
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
Seiten 1
2
3
>