Algorithmica, Volume 41, 2004/2005

Volume 41, Number 1, October 2004

• Irene Finocchi, Alessandro Panconesi, Riccardo Silvestri:
  An Experimental Analysis of Simple, Distributed Vertex Coloring Algorithms. 1-23
  Electronic Edition (link) BibTeX
• Joan Feigenbaum, Sampath Kannan, Jian Zhang:
  Computing Diameter in the Streaming and Sliding-Window Models. 25-41
  Electronic Edition (link) BibTeX
• Refael Hassin, Asaf Levin:
  Approximation Algorithms for Quickest Spanning Tree Problems. 43-52
  Electronic Edition (link) BibTeX
• Guoliang Xue, Wei Xiao:
  A Polynomial Time Approximation Scheme for Minimum Cost Delay-Constrained Multicast Tree under a Steiner Topology. 53-72
  Electronic Edition (link) BibTeX

Volume 41, Number 2, November 2004

• Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle:
  Graph Searching, Elimination Trees, and a Generalization of Bandwidth. 73-87
  Electronic Edition (link) BibTeX
• Gonzalo Navarro, Mathieu Raffinot:
  New Techniques for Regular Expression Searching. 89-116
  Electronic Edition (link) BibTeX
• Jochen Könemann, Asaf Levin, Amitabh Sinha:
  Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem. 117-129
  Electronic Edition (link) BibTeX
• Cees Duin:
  A Branch-Checking Algorithm for All-Pairs Shortest Paths. 131-145
  Electronic Edition (link) BibTeX

Volume 41, Number 3, January 2005

• Sariel Har-Peled, Soham Mazumdar:
  Fast Algorithms for Computing the Smallest k-Enclosing Circle. 147-157
  Electronic Edition (link) BibTeX
• Vladlen Koltun, Carola Wenk:
  Matching Polyhedral Terrains Using Overlays of Envelopes. 159-183
  Electronic Edition (link) BibTeX
• Sariel Har-Peled, Bardia Sadri:
  How Fast Is the k-Means Method? 185-202
  Electronic Edition (link) BibTeX
• Heikki Hyyrö, Gonzalo Navarro:
  Bit-Parallel Witnesses and Their Applications to Approximate String Matching. 203-231
  Electronic Edition (link) BibTeX

Volume 41, Number 4, February 2005

• Paz Carmi, Shlomi Dolev, Sariel Har-Peled, Matthew J. Katz, Michael Segal:
  Geographic Quorum System Approximations. 233-244
  Electronic Edition (link) BibTeX
• Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos:
  Exponential Speedup of Fixed-Parameter Algorithms for Classes of Graphs Excluding Single-Crossing Graphs as Minors. 245-267
  Electronic Edition (link) BibTeX
• Sorina Dumitrescu, Xiaolin Wu:
  Optimal Two-Description Scalar Quantizer Design. 269-287
  Electronic Edition (link) BibTeX
• Carsten Gutwenger, Petra Mutzel, René Weiskircher:
  Inserting an Edge into a Planar Graph. 289-308
  Electronic Edition (link) BibTeX
• Yi-Jen Chiang:
  New Approximation Results for the Maximum Scatter TSP. 309-341
  Electronic Edition (link) BibTeX