Volume 38,
Number 1,
October 2003
- Remco C. Veltkamp:
Shape Algorithmics.
1-4
- Ulrich Eckhardt, Helene Reiter:
Polygonal Representations of Digital Sets.
5-23
- Isabelle Sivignon, Florent Dupont, Jean-Marc Chassery:
Decomposition of a Three-Dimensional Discrete Object Surface into Discrete Plane Pieces.
25-43
- Helmut Alt, Christian Knauer, Carola Wenk:
Comparison of Distance Measures for Planar Curves.
45-58
- Martin Gavrilov, Piotr Indyk, Rajeev Motwani, Suresh Venkatasubramanian:
Combinatorial and Experimental Methods for Approximate Point Pattern Matching.
59-90
- Bodo Rosenhahn, Christian Perwass, Gerald Sommer:
Free-Form Pose Estimation by Using Twist Representations.
91-113
- L. Paul Chew, Klara Kedem:
Finding the Consensus Shape for a Protein Family.
115-129
- Ovidiu Daescu:
New Results on Path Approximation.
131-143
- Alon Efrat, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Günter Rote, Carola Wenk:
Covering with Ellipses.
145-160
- Prosenjit Bose, Pat Morin:
Testing the Quality of Manufactured Disks and Balls.
161-177
- Tamal K. Dey, Wulue Zhao:
Approximating the Medial Axis from the Voronoi Diagram with a Convergence Guarantee.
179-200
- Michael M. Kazhdan, Bernard Chazelle, David P. Dobkin, Thomas A. Funkhouser, Szymon Rusinkiewicz:
A Reflective Symmetry Descriptor for 3D Models.
201-225
- Michela Mortara, Giuseppe Patanè, Michela Spagnuolo, Bianca Falcidieno, Jarek Rossignac:
Blowing Bubbles for Multi-Scale Analysis and Decomposition of Triangle Meshes.
227-248
- Valerio Pascucci, Kree Cole-McLaughlin:
Parallel Computation of the Topology of Level Sets.
249-268
Volume 38,
Number 2,
November 2003
- Tadao Takaoka:
Foreword.
269-270
- Xiao Zhou, Takao Nishizeki:
Multicolorings of Series-Parallel Graphs.
271-297
- Danny Z. Chen, Xiaodong Wu:
Efficient Algorithms for k-Terminal Cuts on Planar Graphs.
299-316
- David Bremner, Ferran Hurtado, Suneeta Ramaswami, Vera Sacristan:
Small Strictly Convex Quadrilateral Meshes of Point Sets.
317-339
- Sheung-Hung Poon, Chan-Su Shin, Tycho Strijk, Takeaki Uno, Alexander Wolff:
Labeling Points with Weights.
341-362
- Rudolf Fleischer, Hisashi Koga:
Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness.
363-376
- 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
- Xuemin Lin:
Delay Optimization in Quorum Consensus.
397-413
Volume 38,
Number 3,
December 2003
- Klaus Jansen, Samir Khuller:
Guest Editors' Introduction.
415-416
- Refael Hassin, R. Ravi, F. Sibel Salman:
Approximation Algorithms for a Capacitated Network Design Problem.
417-431
- Kamal Jain, Vijay V. Vazirani:
An Approximation Algorithm for the Fault Tolerant Metric Facility Location Problem.
433-439
- Jochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha:
Improved Approximations for Tour and Tree Covers.
441-449
- Venkatesan Guruswami:
Inapproximability Results for Set Splitting and Satisfiability Problems with No Mixed Clauses.
451-469
- Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum:
The Relative Complexity of Approximate Counting Problems.
471-500
- Sándor P. Fekete, Henk Meijer:
Maximum Dispersion and Geometric Maximum Weight Cliques.
501-511
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
- Mao-cheng Cai, Xiaotie Deng, Lusheng Wang:
Minimum k Arborescences with Bandwidth Constraints.
529-537
- Zhi-Zhong Chen, Xin He:
Disk Embeddings of Planar Graphs.
539-576
- Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink:
Computing a (1+epsilon)-Approximate Geometric Minimum-Diameter Spanning Tree.
577-589
- 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
- Rajiv Gandhi, Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan:
Algorithms for Minimizing Response Time in Broadcast Scheduling.
597-608
Last update Tue Feb 14 04:13:53 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
