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=9
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The slab dividing approach to solve the Euclidean
P
-center problem
R.Z. Hwang
,
R.C.T. Lee
,
R.C. Chang
Algorithmica
9
(1), 1993, pp. 1-22
A parallel algorithm for approximating the minimum cycle cover
Philip Klein
,
Clifford Stein
Algorithmica
9
(1), 1993, pp. 23-31
Packet routing on grids of processors
Manfred Kunde
Algorithmica
9
(1), 1993, pp. 32-46
Parity conditions in homotopic knock-knee routing
Michael Kaufmann
,
F. Miller Maley
Algorithmica
9
(1), 1993, pp. 47-63
On combinded phase 1-phase 2 projective methods for linear programming
Michael J. Todd
,
Yufei Wang
Algorithmica
9
(1), 1993, pp. 64-83
Maximum
k
-covering of weighted transitive graphs with applications
M. Sarrafzadeh
,
R.D. Lou
Algorithmica
9
(1), 1993, pp. 84-100
Asymptotic component densities in programmable gate arrays realizing all circuits of a given size
T. Berger
,
A. Hekstra
,
A. Orlitsky
Algorithmica
9
, 1993, pp. 101-127
Constructing the Voronoi diagram of a set of line segments in parallel
Michael T. Goodrich
,
Colm O'DĂșnlaing
,
Chee K. Yap
Algorithmica
9
, 1993, pp. 128-141
Duality of constrained Voronoi diagrams and Delaunay triangulations
Barry Joe
,
Cao An Wang
Algorithmica
9
, 1993, pp. 142-155
A faster parallel algorithm fo a matrix searching problem
Mikhail J. Atallah
Algorithmica
9
, 1993, pp. 156-167
Fast linear expected-time algorithms for computing maxima and convex hulls
Jon L. Bentley
,
Kenneth L. Clarkson
,
David B. Levine
Algorithmica
9
, 1993, pp. 168-183
On partial updating in a potential reduction linear programming algorithm of Kojima, Mizuno, and Yoshise
Robert A. Bosch
,
Kurt M. Anstreicher
Algorithmica
9
, 1993, pp. 184-197
A linear algorithm for the all-bidirectional-edges problem on planar graphs
P.B. Ramprasad
,
C. Pandu Rangan
Algorithmica
9
, 1993, pp. 199-216
Efficient parallel recognition of some circular arc graphs, I
Chen Lin
Algorithmica
9
, 1993, pp. 217-238
Clocked adversaries for hashing
Richard J. Lipton
,
Jeffrey F. Naughton
Algorithmica
9
, 1993, pp. 239-252
Packings in two dimensions: Asymptotic average-case analysis of algorithms
E.G., Jr. Coffman
,
P.W. Shor
Algorithmica
9
, 1993, pp. 253-277
Seven fingers allow force-torque closure grasps on any convex polyhedron
Walter Meyer
Algorithmica
9
, 1993, pp. 278-292
Single-layer cylindrical compaction
Richard Anderson
,
Simon Kahan
,
Martine Schlag
Algorithmica
9
, 1993, pp. 293-312
Sieve algorithms for perfect power testing
Eric Bach
,
Jonathan Sorenson
Algorithmica
9
, 1993, pp. 313-328
A semidynamic construction of higher-order Voronoi diagrams and its randomized analysis
Jean-Daniel Boissonnat
,
Olivier Devillers
,
Monique Teillaud
Algorithmica
9
, 1993, pp. 329-356
Optimal parallel algorithms for multiple updates of minimum spanning trees
Shaunak Pawagi
,
Owen Kaser
Algorithmica
9
, 1993, pp. 357-381
Tiling a polygon with parallelograms
Richard Kenyon
Algorithmica
9
, 1993, pp. 382-397
The searching over separators strategy to solve some
NP
-hard problems in subexponential time
R.Z. Hwang
,
R.C. Chang
,
R.C.T. Lee
Algorithmica
9
, 1993, pp. 398-423
Schedulers for larger classes of pinwheel instances
M.Y. Chan
,
Francis Chin
Algorithmica
9
, 1993, pp. 425-462
An 11/6-approximation algorithm for the network Steiner problem
A.Z. Zelikovsky
Algorithmica
9
, 1993, pp. 463-470
Seiten 1
2
>