Algorithmica, Volume 13, 1995

Volume 13, Number 1/2, January/February 1995

• Eugene W. Myers: Guest Editor's Foreword: Special Issue on Computational Molecular Biology. 1-6 BibTeX
• John D. Kececioglu, Eugene W. Myers: Combinatiorial Algorithms for DNA Sequence Assembly. 7-51 BibTeX
• Farid Alizadeh, Richard M. Karp, Lee Aaron Newberg, Deborah K. Weisser: Physical Mapping of Chromosomes: A Combinatorial Problem in Molecular Biology. 52-76 BibTeX
• Pavel A. Pevzner: DNA Physical Mapping and Alternating Eulerian Cycles in Colored Graphs. 77-105 BibTeX
• Kun-Mao Chao, Webb Miller: Linear-Space Algorithms that Build Local Alignments from Fragments. 106-134 BibTeX
• Pavel A. Pevzner, Michael S. Waterman: Multiple Filtration and Approximate Pattern Matching. 135-154 BibTeX
• Martin Farach, Sampath Kannan, Tandy Warnow: A Robust Model for Finding Optimal Evolutionary Trees. 155-179 BibTeX
• John D. Kececioglu, David Sankoff: Exact and Approximation Algorithms for Sorting by Reversals, with Application to Genome Rearrangement. 180-210 BibTeX
• James R. Knight, Eugene W. Myers: Super-Pattern Matching. 211-243 BibTeX

Volume 13, Number 3, March 1995

• Robert F. Cohen, Roberto Tamassia: Dynamic Expression Trees. 245-265 BibTeX
• Michael R. Fellows, Jan Kratochvíl, Martin Middendorf, Frank Pfeiffer: The Complexity of Induced Minors and Related Problems. 266-282 BibTeX
• Keith E. Humenik, Peter Matthews, A. B. Stephens, Yelena Yesha: A Lower Bound on the Probability of Conflict Under Nonuniform Access in Database Systems. 283-312 BibTeX
• Hans-Peter Lenhof, Michiel H. M. Smid: Maintaining the Visibility Map of Spheres While Moving the Viewpoint on a Circle at Infinity. 301-312 BibTeX
• Hosam M. Mahmoud: The Joint Distribution of the Three Types of Nodes in Uniform Binary Trees. 313-323 BibTeX

Volume 13, Number 4, April 1995

• Pankaj K. Agarwal, Jirí Matousek: Dynamic Half-Space Range Reporting and Its Applications. 325-345 BibTeX
• Danilo Bruschi, F. Ravasio: Random Parallel Algorithms for Finding Exact Branchings, Perfect Matchings, and Cycles. 346-356 BibTeX
• Michael Jünger, William R. Pulleyblank: New Primal and Dual Matching Heuristics. 357-386 BibTeX
• Ding-Zhu Du: On Greedy Heuristics for Steiner Minimum Trees. 381-386 BibTeX
• Pedro Jussieu de Rezende, D. T. Lee: Point Set Pattern Matching in d-Dimensions. 387-404 BibTeX

Volume 13, Number 5, May 1995

• Maxime Crochemore, Wojciech Rytter: Sqares, Cubes, and Time-Space Efficient String Searching. 405-425 BibTeX
• Catherine C. McGeoch: All-Pairs Shortest Paths and the Essential Subgraph. 426-441 BibTeX
• David S. Atkinson, Pravin M. Vaidya: Using Geometry To Solve the Transportation Problem in the Plane. 442-461 BibTeX
• David Eppstein: Asymptotic Speed-Ups in Constructive Solid Geometry. 462-471 BibTeX
• Anthony Lazanas, Jean-Claude Latombe: Landmark-Based Robot Navigation. 472-501 BibTeX

Volume 13, Number 6, June 1995

• Monika Rauch Henzinger: Fully Dynamic Biconnectivity in Graphs. 503-538 BibTeX
• Achim Schweikard, Randall H. Wilson: Assembly Sequences for Polyhedra. 539-552 BibTeX
• Xin He: An Efficient Parallel Algorithm for Finding Rectangular Duals of Plane Triangular Graphs. 553-572 BibTeX
• Michel Habib, Marianne Huchard, Jeremy Spinrad: A Linear Algorithm To Decompose Inheritance Graphs Into Modules. 573-591 BibTeX
• Pilar de la Torre, Raymond Greenlaw, Alejandro A. Schäffer: Optimal Edge Ranking of Trees in Polynomial Time. 592-618 BibTeX