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=26
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Finding edge-disjoint paths in partial
k
-trees
X. Zhou
,
S. Tamura
,
T. Nishizeki
Algorithmica
26
(1), 2000, pp. 3-30
Computing mimicking networks
S. Chaudhuri
,
K.V. Subrahmanyam
,
F. Wagner
,
C.D. Zaroliagis
Algorithmica
26
(1), 2000, pp. 31-49
A simplified
{\tilde{O}}(nm)
time edge-splitting algorithm in undirected graphs
H. Nagamochi
,
S. Nakamura
,
T. Ibaraki
Algorithmica
26
(1), 2000, pp. 50-67
On exact solutions for the rectilinear Steiner tree problem - Part I: Theoretical results
U. Föss̈meier
,
M. Kaufmann
Algorithmica
26
(1), 2000, pp. 68-99
Efficient orthogonal drawings of high degree graphs
A. Papakostas
,
I.G. Tollis
Algorithmica
26
(1), 2000, pp. 100-125
Reconstructing the topology of a CAD model - A discrete approach
K. Weihe
,
T. Willhalm
Algorithmica
26
(1), 2000, pp. 126-147
Complexity and modeling aspects of mesh refinement into quadrilaterals
R.H. Möhring
,
M. Müller-Hannemann
Algorithmica
26
(1), 2000, pp. 148-171
Practical performance of efficient minimum cut algorithms
M. Jünger
,
G. Rinaldi
,
S. Thienel
Algorithmica
26
(1), 2000, pp. 172-195
Optimization problems related to zigzag pocket machining
E.M. Arkin
,
M. Held
,
C.L. Smith
Algorithmica
26
(2), 2000, pp. 197-236
Sorting-based selection algorithms for hypercubic networks
P. Berthomé
,
A. Ferreira
,
B.M. Maggs
,
S. Perennes
,
C.G. Plaxton
Algorithmica
26
(2), 2000, pp. 237-254
A simultaneous search problem
E.-C. Chang
,
C. Yap
Algorithmica
26
(2), 2000, pp. 255-262
Parallel algorithms for maximum matching in complements of interval graphs and related problems
M.G. Andrews
,
M.J. Atallah
,
D.Z. Chen
,
D.T. Lee
Algorithmica
26
(2), 2000, pp. 263-289
Fast algorithms to enumerate all common intervals of two permutations
T. Uno
,
M. Yagiura
Algorithmica
26
(2), 2000, pp. 290-309
Parts feeding on a conveyor with a one joint robot
S. Akella
,
W.H. Huang
,
K.M. Lynch
,
M.T. Mason
Algorithmica
26
(3-4), 2000, pp. 313-344
Probabilistic algorithms for efficient grasping and fixturing
M. Teichmann
,
B. Mishra
Algorithmica
26
(3-4), 2000, pp. 345-363
Visibility-based planning of sensor control strategies
A.J. Briggs
,
B.R. Donald
Algorithmica
26
(3-4), 2000, pp. 364-388
Algorithms for sensorless manipulation using a vibrating surface
K.-F. Böhringer
,
V. Bhatt
,
B.R. Donald
,
K. Goldberg
Algorithmica
26
(3-4), 2000, pp. 389-429
Robot motion planning: A game-theoretic foundation
S.M. LaValle
Algorithmica
26
(3-4), 2000, pp. 430-465
Grasping and in-hand manipulation: Geometry and algorithms
A. Sudang
,
J. Ponce
,
N. Srinivasa
Algorithmica
26
(3-4), 2000, pp. 466-493
Geometric eccentricity and the complexity of manipulation plans
A.F. van der Stappen
,
K. Goldberg
,
M.H. Overmars
Algorithmica
26
(3-4), 2000, pp. 494-514
Mobile robot self-localization without explicit landmarks
R.G. Brown
,
B.R. Donald
Algorithmica
26
(3-4), 2000, pp. 515-559
Planning motions of polyhedral parts by rolling
A. Marigo
,
M. Ceccarelli
,
S. Piccinocchi
,
A. Bicchi
Algorithmica
26
(3-4), 2000, pp. 560-576
A general framework for assembly planning: The motion space approach
D. Halperin
,
J.-C. Latombe
,
R.H. Wilson
Algorithmica
26
(3-4), 2000, pp. 577-601