Algorithmica, Volume 38, 2003/2004

Volume 38, Number 1, October 2003

• Remco C. Veltkamp:
  Shape Algorithmics. 1-4
  Electronic Edition (link) BibTeX
• Ulrich Eckhardt, Helene Reiter:
  Polygonal Representations of Digital Sets. 5-23
  Electronic Edition (link) BibTeX
• Isabelle Sivignon, Florent Dupont, Jean-Marc Chassery:
  Decomposition of a Three-Dimensional Discrete Object Surface into Discrete Plane Pieces. 25-43
  Electronic Edition (link) BibTeX
• Helmut Alt, Christian Knauer, Carola Wenk:
  Comparison of Distance Measures for Planar Curves. 45-58
  Electronic Edition (link) BibTeX
• Martin Gavrilov, Piotr Indyk, Rajeev Motwani, Suresh Venkatasubramanian:
  Combinatorial and Experimental Methods for Approximate Point Pattern Matching. 59-90
  Electronic Edition (link) BibTeX
• Bodo Rosenhahn, Christian Perwass, Gerald Sommer:
  Free-Form Pose Estimation by Using Twist Representations. 91-113
  Electronic Edition (link) BibTeX
• L. Paul Chew, Klara Kedem:
  Finding the Consensus Shape for a Protein Family. 115-129
  Electronic Edition (link) BibTeX
• Ovidiu Daescu:
  New Results on Path Approximation. 131-143
  Electronic Edition (link) BibTeX
• Alon Efrat, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Günter Rote, Carola Wenk:
  Covering with Ellipses. 145-160
  Electronic Edition (link) BibTeX
• Prosenjit Bose, Pat Morin:
  Testing the Quality of Manufactured Disks and Balls. 161-177
  Electronic Edition (link) BibTeX
• Tamal K. Dey, Wulue Zhao:
  Approximating the Medial Axis from the Voronoi Diagram with a Convergence Guarantee. 179-200
  Electronic Edition (link) BibTeX
• Michael M. Kazhdan, Bernard Chazelle, David P. Dobkin, Thomas A. Funkhouser, Szymon Rusinkiewicz:
  A Reflective Symmetry Descriptor for 3D Models. 201-225
  Electronic Edition (link) BibTeX
• Michela Mortara, Giuseppe Patanè, Michela Spagnuolo, Bianca Falcidieno, Jarek Rossignac:
  Blowing Bubbles for Multi-Scale Analysis and Decomposition of Triangle Meshes. 227-248
  Electronic Edition (link) BibTeX
• Valerio Pascucci, Kree Cole-McLaughlin:
  Parallel Computation of the Topology of Level Sets. 249-268
  Electronic Edition (link) BibTeX

Volume 38, Number 2, November 2003

• Tadao Takaoka:
  Foreword. 269-270
  Electronic Edition (link) BibTeX
• Xiao Zhou, Takao Nishizeki:
  Multicolorings of Series-Parallel Graphs. 271-297
  Electronic Edition (link) BibTeX
• Danny Z. Chen, Xiaodong Wu:
  Efficient Algorithms for k-Terminal Cuts on Planar Graphs. 299-316
  Electronic Edition (link) BibTeX
• David Bremner, Ferran Hurtado, Suneeta Ramaswami, Vera Sacristan:
  Small Strictly Convex Quadrilateral Meshes of Point Sets. 317-339
  Electronic Edition (link) BibTeX
• Sheung-Hung Poon, Chan-Su Shin, Tycho Strijk, Takeaki Uno, Alexander Wolff:
  Labeling Points with Weights. 341-362
  Electronic Edition (link) BibTeX
• Rudolf Fleischer, Hisashi Koga:
  Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness. 363-376
  Electronic Edition (link) BibTeX
• Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen:
  Computing the Quartet Distance between Evolutionary Trees in Time O(n log n). 377-395
  Electronic Edition (link) BibTeX
• Xuemin Lin:
  Delay Optimization in Quorum Consensus. 397-413
  Electronic Edition (link) BibTeX

Volume 38, Number 3, December 2003

• Klaus Jansen, Samir Khuller:
  Guest Editors' Introduction. 415-416
  Electronic Edition (link) BibTeX
• Refael Hassin, R. Ravi, F. Sibel Salman:
  Approximation Algorithms for a Capacitated Network Design Problem. 417-431
  Electronic Edition (link) BibTeX
• Kamal Jain, Vijay V. Vazirani:
  An Approximation Algorithm for the Fault Tolerant Metric Facility Location Problem. 433-439
  Electronic Edition (link) BibTeX
• Jochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha:
  Improved Approximations for Tour and Tree Covers. 441-449
  Electronic Edition (link) BibTeX
• Venkatesan Guruswami:
  Inapproximability Results for Set Splitting and Satisfiability Problems with No Mixed Clauses. 451-469
  Electronic Edition (link) BibTeX
• Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum:
  The Relative Complexity of Approximate Counting Problems. 471-500
  Electronic Edition (link) BibTeX
• Sándor P. Fekete, Henk Meijer:
  Maximum Dispersion and Geometric Maximum Weight Cliques. 501-511
  Electronic Edition (link) BibTeX

Volume 38, Number 4, January 2004

• Xiaotie Deng, Haodi Feng, Pixing Zhang, Yuzhong Zhang, Hong Zhu:
  Minimizing Mean Completion Time in a Batch Processing System. 513-528
  Electronic Edition (link) BibTeX
• Mao-cheng Cai, Xiaotie Deng, Lusheng Wang:
  Minimum k Arborescences with Bandwidth Constraints. 529-537
  Electronic Edition (link) BibTeX
• Zhi-Zhong Chen, Xin He:
  Disk Embeddings of Planar Graphs. 539-576
  Electronic Edition (link) BibTeX
• Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink:
  Computing a (1+epsilon)-Approximate Geometric Minimum-Diameter Spanning Tree. 577-589
  Electronic Edition (link) BibTeX
• Frédéric Chazal, Véronique Maume-Deschamps, Brigitte Vallée:
  Erratum to 'Dynamical Sources in Information Theory: Fundamental Intervals and Word Prefixes'. 591-596
  Electronic Edition (link) BibTeX
• Rajiv Gandhi, Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan:
  Algorithms for Minimizing Response Time in Broadcast Scheduling. 597-608
  Electronic Edition (link) BibTeX