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=44
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Straight-line drawing algorithms for hierarchical graphs and clustered graphs
Peter Eades
,
Qingwen Feng
,
Xuemin Lin
,
Hiroshi Nagamochi
Algorithmica
44
(1), 2006, pp. 1-32
Multiple spin-block decisions
Peter Damaschke
Algorithmica
44
(1), 2006, pp. 33-48
Combinatorial algorithms for the unsplittable flow problem
Yossi Azar
,
Oded Regev
Algorithmica
44
(1), 2006, pp. 49-66
Drawing planar graphs symmetrically, III: Oneconnected planar graphs
Seok-Hee Hong
,
Peter Eades
Algorithmica
44
(1), 2006, pp. 67-100
Linear time algorithm for approximating a curve by a single-peaked curve
Jinhee Chun
,
Kunihiko Sadakane
,
Takeshi Tokuyama
Algorithmica
44
(2), 2006, pp. 103-115
Computing all immobilizing grasps of a simple polygon with few contacts
Jae-Sook Cheong
,
Herman J. Haverkort
,
A. Frank van der Stappen
Algorithmica
44
(2), 2006, pp. 117-136
The geometric dilation of finite point sets
Annette Ebbers-Baumann
,
Ansgar Grüne
,
Rolf Klein
Algorithmica
44
(2), 2006, pp. 137-149
A dynamic dictionary for priced information with application
Anil Maheshwari
,
Michiel Smid
Algorithmica
44
(2), 2006, pp. 151-165
Geometric restrictions on producible polygonal protein chains
Erik D. Demaine
,
Stefan Langerman
,
Joseph O'Rourke
Algorithmica
44
(2), 2006, pp. 167-181
Exact sampling from perfect matchings of dense regular bipartite graphs
Mark Huber
Algorithmica
44
(3), 2006, pp. 183-193
An efficient algorithm for finding maximum cycle packings in reducible flow graphs
Xujin Chen
,
Wenan Zang
Algorithmica
44
(3), 2006, pp. 195-211
Approximating rooted connectivity augmentation problems
Zeev Nutov
Algorithmica
44
(3), 2006, pp. 213-231
Three-dimensional orthogonal graph drawing with optimal volume
Therese Biedl
,
Torsten Thiele
,
David R. Wood
Algorithmica
44
(3), 2006, pp. 233-255
Augmenting a
(k - 1)
-vertex-connected multigraph to an
l
-edge-connected and
k
-vertex-connected multigraph
Toshimasa Ishii
,
Hiroshi Nagamochi
,
Toshihide Ibaraki
Algorithmica
44
(3), 2006, pp. 257-280
Canonical forms and algorithms for Steiner trees in uniform orientation metrics
M. Brazil
,
D.A. Thomas
,
J.F. Weng
,
M. Zachariasen
Algorithmica
44
(4), 2006, pp. 281-300
Simultaneous optimization via approximate majorization for concave profits or convex costs
Ashish Goel
,
Adam Meyerson
Algorithmica
44
(4), 2006, pp. 301-323
Casting with skewed ejection direction
Hee-Kap Ahn
,
Siu-Wing Cheng
,
Otfried Cheong
Algorithmica
44
(4), 2006, pp. 325-342
Planar graph coloring avoiding monochromatic subgraphs: Trees and paths make it difficult
Hajo Broersma
,
Fedor V. Fomin
,
Jan Kratochvíl
,
Gerhard J. Woeginger
Algorithmica
44
(4), 2006, pp. 343-361
Error compensation in leaf power problems
Michael Dom
,
Jiong Guo
,
Falk Hüffner
,
Rolf Niedermeier
Algorithmica
44
(4), 2006, pp. 363-381