Algorithmica, Volume 35, 2003

Volume 35, Number 1, 2003

• Julien Basch, Leonidas J. Guibas, G. D. Ramkumar:
  Reporting Red - Blue Intersections between Two Sets of Connected Line Segments. 1-20
  Electronic Edition (Springer LINK) BibTeX
• Peter Sanders, Sebastian Egner, Jan H. M. Korst:
  Fast Concurrent Access to Parallel Disks. 21-55
  Electronic Edition (Springer LINK) BibTeX
• Enrico Nardelli, Guido Proietti, Peter Widmayer:
  Swapping a Failing Edge of a Single Source Shortest Paths Tree Is Good and Fast. 56-74
  Electronic Edition (Springer LINK) BibTeX
• Kurt Mehlhorn, Peter Sanders:
  Scanning Multiple Sequences Via Cache Memory. 75-93
  Electronic Edition (Springer LINK) BibTeX

Volume 35, Number 2, 2003

• Andrea E. F. Clementi, Paolo Penna, Afonso Ferreira, Stephane Perennes, Riccardo Silvestri:
  The Minimum Range Assignment Problem on Linear Radio Networks. 95-110
  Electronic Edition (Springer LINK) BibTeX
• Abraham P. Punnen, François Margot, Santosh N. Kabadi:
  TSP Heuristics: Domination Analysis and Complexity. 111-127
  Electronic Edition (Springer LINK) BibTeX
• David Pisinger:
  Dynamic Programming on the Word RAM. 128-145
  Electronic Edition (Springer LINK) BibTeX
• Claire Kenyon, Nicolas Schabanel:
  The Data Broadcast Problem with Non-Uniform Transmission Times. 146-175
  Electronic Edition (Springer LINK) BibTeX
• Lene M. Favrholdt, Morten N. Nielsen:
  On-Line Edge-Coloring with a Fixed Number of Colors. 176-191
  Electronic Edition (Springer LINK) BibTeX

Volume 35, Number 3, 2003

• Hon Wai Leong, Hiroshi Imai:
  Guest Editors' Foreword. 193-193
  Electronic Edition (Springer LINK) BibTeX
• Mikhail J. Atallah, Danny Z. Chen, Ovidiu Daescu:
  Efficient Parallel Algorithms for Planar st-Graphs. 194-215
  Electronic Edition (Springer LINK) BibTeX
• Hiroyuki Kazuyoshi:
  An Approximation Algorithm for a Large-Scale Facility Location Problem. 216-224
  Electronic Edition (Springer LINK) BibTeX
• Yoshiyuki Takao:
  Finding a Region with the Minimum Total L₁ Distance from Prescribed Terminals. 225-256
  Electronic Edition (Springer LINK) BibTeX
• Vijaya Chung:
  A Randomized Linear-Work EREW PRAM Algorithm to Find a Minimum Spanning Forest. 257-268
  Electronic Edition (Springer LINK) BibTeX
• Takeshi Hisao:
  A Characterization of Planar Graphs by Pseudo-Line Arrangements. 269-285
  Electronic Edition (Springer LINK) BibTeX

Volume 35, Number 4, 2003

• Subhash Suri, Tuomas Sandholm, Priyank Ramesh Warkhede:
  Compressing Two-Dimensional Routing Tables. 287-300
  Electronic Edition (Springer LINK) BibTeX
• Lars Engebretsen:
  An Explicit Lower Bound for TSP with Distances One and Two. 301-318
  Electronic Edition (Springer LINK) BibTeX
• Philip N. Klein, Robert H. B. Netzer, Hsueh-I Lu:
  Detecting Race Conditions in Parallel Programs that Use Semaphores. 321-345
  Electronic Edition (Springer LINK) BibTeX
• Veli Mäkinen, Esko Ukkonen, Gonzalo Navarro:
  Approximate Matching of Run-Length Compressed Strings. 347-369
  Electronic Edition (Springer LINK) BibTeX