Algorithmica, Volume 39, 2004

Volume 39, Number 1, January 2004

• Tetsuo Shibuya:
  Generalization of a Suffix Tree for RNA Structural Pattern Matching. 1-19
  Electronic Edition (link) BibTeX
• Charles U. Martel, Glen Nuckolls, Premkumar T. Devanbu, Michael Gertz, April Kwong, Stuart G. Stubblebine:
  A General Model for Authenticated Data Structures. 21-41
  Electronic Edition (link) BibTeX
• Leah Epstein, Jiri Sgall:
  Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines. 43-57
  Electronic Edition (link) BibTeX
• Klaus Jansen:
  Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial Time Approximation Scheme. 59-81
  Electronic Edition (link) BibTeX
• Petko Yanev, Paolo Foschi, Erricos John Kontoghiorghes:
  Algorithms for Computing the QR Decomposition of a Set of Matrices with Common Columns. 83-93
  Electronic Edition (link) BibTeX

Volume 39, Number 2, February 2004

• Stavros D. Nikolopoulos, Leonidas Palios:
  Algorithms for P₄-Comparability Graph Recognition and Acyclic P₄-Transitive Orientation. 95-126
  Electronic Edition (link) BibTeX
• John H. Reif, Zheng Sun:
  Movement Planning in the Presence of Flows. 127-153
  Electronic Edition (link) BibTeX
• Chung Keung Poon, Pixing Zhang:
  Minimizing Makespan in Batch Machine Scheduling. 155-174
  Electronic Edition (link) BibTeX
• Esther M. Arkin, Refael Hassin, Shlomi Rubinstein, Maxim Sviridenko:
  Approximations for Maximum Transportation with Permutable Supply Vector and Other Capacitated Star Packing Problems. 175-187
  Electronic Edition (link) BibTeX

Volume 39, Number 3, April 2004

• Ravindra K. Ahuja, Dorit S. Hochbaum, James B. Orlin:
  A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem. 189-208
  Electronic Edition (link) BibTeX
• Petr Kolman, Christian Scheideler:
  Simple On-Line Algorithms for the Maximum Disjoint Paths Problem. 209-233
  Electronic Edition (link) BibTeX
• David R. Wood:
  Minimising the Number of Bends and Volume in 3-Dimensional Orthogonal Graph Drawings with a Diagonal Vertex Layout. 235-253
  Electronic Edition (link) BibTeX
• Jianjun Zhou, Martin Müller:
  Solving Systems of Difference Constraints Incrementally with Bidirectional Search. 255-274
  Electronic Edition (link) BibTeX

Volume 39, Number 4, May 2004

• Adam L. Buchsbaum, Michael T. Goodrich:
  Three-Dimensional Layers of Maxima. 275-286
  Electronic Edition (link) BibTeX
• Anne Berry, Jean R. S. Blair, Pinar Heggernes, Barry W. Peyton:
  Maximum Cardinality Search for Computing Minimal Triangulations of Graphs. 287-298
  Electronic Edition (link) BibTeX
• Björn Brodén, Mikael Hammar, Bengt J. Nilsson:
  Online and Offline Algorithms for the Time-Dependent TSP with Time Zones. 299-319
  Electronic Edition (link) BibTeX
• Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier:
  Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems. 321-347
  Electronic Edition (link) BibTeX