Algorithmica, Volume 44, 2006

Volume 44, Number 1, January 2006

• Peter Eades, Qing-Wen Feng, Xuemin Lin, Hiroshi Nagamochi:
  Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. 1-32
  Electronic Edition (link) BibTeX
• Peter Damaschke:
  Multiple Spin-Block Decisions. 33-48
  Electronic Edition (link) BibTeX
• Yossi Azar, Oded Regev:
  Combinatorial Algorithms for the Unsplittable Flow Problem. 49-66
  Electronic Edition (link) BibTeX
• Seok-Hee Hong, Peter Eades:
  Drawing Planar Graphs Symmetrically, III: Oneconnected Planar Graphs. 67-100
  Electronic Edition (link) BibTeX

Volume 44, Number 2, February 2006

• Naoki Katoh:
  Foreword. 101-101
  Electronic Edition (link) BibTeX
• Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama:
  Linear Time Algorithm for Approximating a Curve by a Single-Peaked Curve. 103-115
  Electronic Edition (link) BibTeX
• Jae-Sook Cheong, Herman J. Haverkort, A. Frank van der Stappen:
  Computing All Immobilizing Grasps of a Simple Polygon with Few Contacts. 117-136
  Electronic Edition (link) BibTeX
• Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein:
  The Geometric Dilation of Finite Point Sets. 137-149
  Electronic Edition (link) BibTeX
• Anil Maheshwari, Michiel H. M. Smid:
  A Dynamic Dictionary for Priced Information with Application. 151-165
  Electronic Edition (link) BibTeX
• Erik D. Demaine, Stefan Langerman, Joseph O'Rourke:
  Geometric Restrictions on Producible Polygonal Protein Chains. 167-181
  Electronic Edition (link) BibTeX

Volume 44, Number 3, April 2006

• Mark Huber:
  Exact Sampling from Perfect Matchings of Dense Regular Bipartite Graphs. 183-193
  Electronic Edition (link) BibTeX
• Xujin Chen, Wenan Zang:
  An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs. 195-211
  Electronic Edition (link) BibTeX
• Zeev Nutov:
  Approximating Rooted Connectivity Augmentation Problems. 213-231
  Electronic Edition (link) BibTeX
• Therese C. Biedl, Torsten Thiele, David R. Wood:
  Three-Dimensional Orthogonal Graph Drawing with Optimal Volume. 233-255
  Electronic Edition (link) BibTeX
• Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki:
  Augmenting a (k-1)-Vertex-Connected Multigraph l-Edge-Connected and k-Vertex-Connected Multigraph. 257-280
  Electronic Edition (link) BibTeX

Volume 44, Number 4, May 2006

• Marcus Brazil, D. A. Thomas, J. F. Weng, Martin Zachariasen:
  Canonical Forms and Algorithms for Steiner Trees in Uniform Orientation Metrics. 281-300
  Electronic Edition (link) BibTeX
• Ashish Goel, Adam Meyerson:
  Simultaneous Optimization via Approximate Majorization for Concave Profits or Convex Costs. 301-323
  Electronic Edition (link) BibTeX
• Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong:
  Casting with Skewed Ejection Direction. 325-342
  Electronic Edition (link) BibTeX
• Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger:
  Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult. 343-361
  Electronic Edition (link) BibTeX
• Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier:
  Error Compensation in Leaf Power Problems. 363-381
  Electronic Edition (link) BibTeX