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=7
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Optimal parallel algorithms for point-set and polygon problems
Richard Cole
,
Michael T. Goodrich
Algorithmica
7
(1), 1992, pp. 3-23
Parallel computational geometry of rectangles
Sharat Chandran
,
Sung Kwon Kim
,
David M. Mount
Algorithmica
7
(1), 1992, pp. 25-49
Efficient convexity and domination algorithms for fine- and medium-grain hypercube computers
Ed Cohen
,
Russ Miller
,
Elias M. Sarraf
,
Quentin F. Stout
Algorithmica
7
(1), 1992, pp. 51-75
Data reduction and fast routing: A strategy for efficient algorithms for message-passing parallel computers
Jorge L.C. Sanz
,
Robert Cypher
Algorithmica
7
(1), 1992, pp. 77-89
Optimal randomized parallel algorithms for computational geometry
John H. Reif
,
Sandeep Sen
Algorithmica
7
(1), 1992, pp. 91-117
A proof of the Gilbert-Pollak conjecture on the Steiner Ratio
D.-Z. Du
,
F.K. Hwang
Algorithmica
7
, 1992, pp. 121-135
How to find Steiner minimal trees in Euclidean
d
-space
Warren D. Smith
Algorithmica
7
, 1992, pp. 137-177
On Steiner minimal trees with
L_p
distance
Zi-Cheng Liu
,
Ding-Zhu Du
Algorithmica
7
, 1992, pp. 179-191
Graham's problem on shortest networks for points on a circle
J.H. Rubinstein
,
D.A. Thomas
Algorithmica
7
, 1992, pp. 193-218
Improved computation of plane Steiner minimal trees
E.J. Cockayne
,
D.E. Hewgill
Algorithmica
7
, 1992, pp. 219-229
Steiner minimal trees for a class of zigzag lines
R.S. Booth
,
J.F. Weng
Algorithmica
7
, 1992, pp. 231-246
A linear-time algorithm to construct a rectilinear Steiner minimal tree for
k
-extremal point sets
D.S. Richards
,
J.S. Salowe
Algorithmica
7
, 1992, pp. 247-276
The rectilinear Steiner arborescence problem
Sailesh K. Rao
,
P. Sadayappan
,
Frank K. Hwang
,
Peter W. Shor
Algorithmica
7
, 1992, pp. 277-288
Two new criteria for finding Steiner hulls in Steiner tree problems
J. Scott Provan
Algorithmica
7
, 1992, pp. 289-302
A note on bounding
k
-terminal reliability
Charles J. Colbourn
Algorithmica
7
, 1992, pp. 303-307
Path-distance heuristics for the Steiner problem in undirected networks
Pawel Winter
,
J. MacGregor Smith
Algorithmica
7
, 1992, pp. 309-327
Steiner tree problems
Warren D. Smith
,
Peter W. Shor
Algorithmica
7
, 1992, pp. 329-332
Problems with generalized Steiner problems
Stefan Voss̈
Algorithmica
7
, 1992, pp. 333-335
A paradigm for robust geometric algorithms
John E. Hopcroft
,
Peter J. Kahn
Algorithmica
7
, 1992, pp. 339-380
Randomized incremental construction of Delaunay and Voronoi diagrams
Leonidas J. Guibas
,
Donald E. Knuth
,
Micha Sharir
Algorithmica
7
, 1992, pp. 381-413
Three priority queue applications revisited
Andrew M. Liao
Algorithmica
7
, 1992, pp. 415-427
Maintaining bridge-connected and biconnected components on-line
Jeffery Westbrook
,
Robert E. Tarjan
Algorithmica
7
, 1992, pp. 433-464
Forests, Frames, and Games: Algorithms for matroid sums and applications
Harold N. Gabow
,
Herbert H. Westermann
Algorithmica
7
, 1992, pp. 465-497
A fast algorithm for the generalized parametric minimum cut problem and applications
Dan Gusfield
,
Charles Martel
Algorithmica
7
, 1992, pp. 499-519
A linear-time algorithm for finding an ambitus
B. Mishra
,
R.E. Tarjan
Algorithmica
7
, 1992, pp. 521-554
Seiten 1
2
>