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=28
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The optimal alphabetic tree problem revisited
Lawrence L. Larmore
,
Teresa M. Przytycka
Journal of Algorithms
28
(1), 1998, pp. 1-20
The variance of two game tree algorithms
Yanjun Zhang
Journal of Algorithms
28
(1), 1998, pp. 21-39
Fast distributed construction of small
k
-dominating sets and applications
Shay Kutten
,
David Peleg
Journal of Algorithms
28
(1), 1998, pp. 40-66
Distributed paging for general networks
Baruch Awerbuch
,
Yair Bartal
,
Amos Fiat
Journal of Algorithms
28
(1), 1998, pp. 67-104
A better approximation ratio for the minimum size
k
-edge-connected spanning subgraph problem
Cristina G. Fernandes
Journal of Algorithms
28
(1), 1998, pp. 105-124
Finding real-valued single-source shortest paths in
o(n^3)
expected time
Stavros G. Kolliopoulos
,
Clifford Stein
Journal of Algorithms
28
(1), 1998, pp. 125-141
Bicriteria network design problems
Madhav V. Marathe
,
R. Ravi
,
Ravi Sundaram
,
S.S. Ravi
,
Daniel J. Rosenkrantz
,
Harry B. Hunt III
Journal of Algorithms
28
(1), 1998, pp. 142-171
Transformations on words
Dominique Foata
,
Guo-Niu Han
Journal of Algorithms
28
(1), 1998, pp. 172-191
Problems
Samir Khuller
Journal of Algorithms
28
(1), 1998, pp. 192-195
Triply-logarithmic parallel upper and lower bounds for minimum and range minima over small domains
Omer Berkman
,
Yossi Matias
,
Prabhakar Ragde
Journal of Algorithms
28
(2), 1998, pp. 197-215
The recognition of double Euler trails in series-parallel networks
Tung-Yang Ho
,
Ting-Yi Sung
,
Lih-Hsing Hsu
,
Chang-Hsiung Tsai
,
Jeng-Yan Hwang
Journal of Algorithms
28
(2), 1998, pp. 216-257
Quadripartite sort
Jing-Chao Chen
Journal of Algorithms
28
(2), 1998, pp. 258-271
Minimum fill-in on circle and circular-arc graphs
T. Kloks
,
D. Kratsch
,
C.K. Wong
Journal of Algorithms
28
(2), 1998, pp. 272-289
A randomized parallel algorithm for planar graph isomorphism
Hillel Gazit
,
John H. Reif
Journal of Algorithms
28
(2), 1998, pp. 290-314
Efficient computation of rectilinear geodesic Voronoi neighbor in the presence of obstacles
Pinaki Mitra
,
Subhas C. Nandy
Journal of Algorithms
28
(2), 1998, pp. 315-338
Minimum color sum of bipartite graphs
Amotz Bar-Noy
,
Guy Kortsarz
Journal of Algorithms
28
(2), 1998, pp. 339-365