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=22
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An efficient implementation of a scaling minimum-cost flow algorithm
Andrew V. Goldberg
Journal of Algorithms
22
(1), 1997, pp. 1-29
Using selective path-doubling for parallel shortest-path computations
Edith Cohen
Journal of Algorithms
22
(1), 1997, pp. 30-56
Connecting the maximum number of nodes in the grid to the boundary with nonintersecting line segments
Leonidas Palios
Journal of Algorithms
22
(1), 1997, pp. 57-92
On-line load balancing of temporary tasks
Yossi Azar
,
Bala Kalyanasundaram
,
Serge Plotkin
,
Kirk R. Pruhs
,
Orli Waarts
Journal of Algorithms
22
(1), 1997, pp. 93-110
Deterministic permutation routing on meshes
Jop F. Sibeyn
,
Bogdan S. Chlebus
,
Michael Kaufmann
Journal of Algorithms
22
(1), 1997, pp. 111-141
Constructing piecewise linear homeomorphisms of simple polygons
Himanshu Gupta
,
Rephael Wenger
Journal of Algorithms
22
(1), 1997, pp. 142-157
Slide - The key to polynomial end-to-end communication
Yehuda Afek
,
Baruch Awerbuch
,
Eli Gafni
,
Yishay Mansour
,
Adi Rosén
,
Nir Shavit
Journal of Algorithms
22
(1), 1997, pp. 158-186
Improved approximation algorithms for weighted 2- and 3-vertex connectivity augmentation problems
Michal Penn
,
Haya Shasha-Krupnik
Journal of Algorithms
22
(1), 1997, pp. 187-196
Reliable broadcasting in logarithmic time with Byzantine link failures
Piotr Berman
,
Krzysztof Diks
,
Andrzej Pelc
Journal of Algorithms
22
(2), 1997, pp. 199-211
Optimal parametric search on graphs of bounded tree-width
David Fernández-Baca
,
Giora Slutzki
Journal of Algorithms
22
(2), 1997, pp. 212-240
Approximation algorithms for Steiner and directed multicuts
Philip N. Klein
,
Serge A. Plotkin
,
Satish Rao
,
Éva Tardos
Journal of Algorithms
22
(2), 1997, pp. 241-269
A uniform approach to the analysis of trie structures that store prefixing-keys
Pilar de la Torre
,
David T. Kao
Journal of Algorithms
22
(2), 1997, pp. 270-295
Dynamic text indexing under string updates
Paolo Ferragina
Journal of Algorithms
22
(2), 1997, pp. 296-328
On the average running time of odd-even merge sort
Christine Rüb
Journal of Algorithms
22
(2), 1997, pp. 329-346
On dynamic algorithms for algebraic problems
John H. Reif
,
Stephen R. Tate
Journal of Algorithms
22
(2), 1997, pp. 347-371
Directed graph pattern matching and topological embedding
James Jianghai Fu
Journal of Algorithms
22
(2), 1997, pp. 372-391