Journal of Algorithms, Volume 19

Volume 19, Number 1, July 1995

• Pilar de la Torre, Clyde P. Kruskal: Fast Parallel Algorithms for All-Sources Lexicographic Search and Path-Algebra Problems. 1-24 BibTeX
• Murray Sherk: Self-Adjusting k-ary Search Trees. 25-44 BibTeX
• Greg N. Frederickson: Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems. 45-85 BibTeX
• Prosenjit Bose, Godfried T. Toussaint: Growing a Tree from Its Branches. 86-103 BibTeX
• Philip N. Klein, R. Ravi: A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees. 104-115 BibTeX
• Alok Aggarwal, Amotz Bar-Noy, Samir Khuller, Dina Kravets, Baruch Schieber: Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality. 116-143 BibTeX

Volume 19, Number 2, September 1995

• Wen-Lian Hsu, Jeremy Spinrad: Independent Sets in Circular-Arc Graphs. 145-160 BibTeX
• Sandeep Sen: Fractional Cascading Revisited. 161-172 BibTeX
• Vijay Chandru, Subir Kumar Ghosh, Anil Maheshwari, V. T. Rajan, Sanjeev Saluja: NC-Algorithms for Minimum Link Path and Related Problems. 173-203 BibTeX
• Avrim Blum, Joel Spencer: Coloring Random and Semi-Random k-Colorable Graphs. 204-234 BibTeX
• Fredrik Manne, Tor Sørevik: Optimal Partitioning of Sequences. 235-249 BibTeX
• Carl Pomerance, Jonathan Sorenson: Counting the Integers Factorable via Cyclotomic Methods. 250-265 BibTeX
• Ton Kloks, Dieter Kratsch: Treewidth of Chordal Bipartite Graphs. 266-281 BibTeX
• Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid: Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization. 282-317 BibTeX
• Alok Aggarwal, Takeshi Tokuyama: An Improved Algorithm for the Traveler's Problem. 318-330 BibTeX

Volume 19, Number 3, November 1995

• Xuding Zhu: A Polynomial Algorithm for Homomorphisms to Oriented Cycles. 333-345 BibTeX
• Sun Wu, Udi Manber, Eugene W. Myers: A Subquadratic Algorithm for Approximate Regular Expression Matching. 346-360 BibTeX
• Sanguthevar Rajasekaran: k-k Routing, k-k Sorting, and Cut-Through Routing on the Mesh. 361-382 BibTeX
• Donald B. Johnson, Panagiotis Takis Metaxas: A Parallel Algorithm for Computing Minimum Spanning Trees. 383-401 BibTeX
• William F. Eddy, Mark J. Schervish: How Many Comparisons Does Quicksort Use? 402-431 BibTeX
• Evripidis Bampis, Mohamed El Haddad, Yannis Manoussakis, Miklos Santha: A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments. 432-440 BibTeX
• Konrad Engel: An Algorithm for the Determination of the Variance of a Partially Ordered Set. 441-448 BibTeX
• Martin Charles Golumbic, Haim Kaplan, Ron Shamir: Graph Sandwich Problems. 449-473 BibTeX
• Amitava Datta, Hans-Peter Lenhof, Christian Schwarz, Michiel H. M. Smid: Static and Dynamic Algorithms for k-Point Clustering Problems. 474-503 BibTeX