Journal of Algorithms, Volume 17

Volume 17, Number 1, July 1994

Joseph C. Culberson, Robert A. Reckhow: Covering Polygons Is Hard. 2-44 BibTeX
Michael L. Fredman, Deborah L. Goldsmith: Three Stacks. 44-70 BibTeX
Seth M. Malitz: Graphs with E Edges Have Pagenumber O(sqrt(E)). 71-84 BibTeX
Seth M. Malitz: Genus g Graphs Have Pagenumber O(sqrt(g)). 85-109 BibTeX
Yoram Moses, Orli Waarts: Coordinated Traversal: (t + 1)- Round Byzantine Agreement in Polynomial Time. 110-156 BibTeX
Frank Thomson Leighton, Bruce M. Maggs, Abhiram G. Ranade, Satish Rao: Randomized Routing and Sorting on Fixed-Connection Networks. 157-205 BibTeX

Fanica Gavril, V. Toledano Laredo, Dominique de Werra: Chordless Paths, Odd Holes, and Kernels in Graphs without m-Obstructions. 207-221 BibTeX
Guy Kortsarz, David Peleg: Generating Sparse 2-Spanners. 222-236 BibTeX
David Eppstein: Offline Algorithms for Dynamic Minimum Spanning Tree Problems. 237-250 BibTeX
Tze-Heng Ma, Jeremy Spinrad: On the 2-Chain Subgraph Cover and Related Problems. 251-268 BibTeX
E. T. Kofler, C. T. Leondes: Algorithmic Modifications to the Theory of Evidential Reasoning. 269-279 BibTeX
Samir Khuller, Uzi Vishkin, Neal E. Young: A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Covers. 280-289 BibTeX

Pankaj K. Agarwal, Micha Sharir, Sivan Toledo: Applications of Parametric Searching in Geometric Optimization. 292-318 BibTeX
Eldad Bar-Eli, Piotr Berman, Amos Fiat, Peiyuan Yan: Online Navigation in a Room. 319-341 BibTeX
Hanna Baumgarten, Hermann Jung, Kurt Mehlhorn: Dynamic Point Location in General Subdivisions. 342-380 BibTeX
Piotr Berman, Viswanathan Ramaiyer: Improved Approximations for the Steiner Tree Problem. 381-408 BibTeX
Martin Fürer, Balaji Raghavachari: Approximating the Minimum-Degree Steiner Tree to within One of Optimal. 409-423 BibTeX
Jianxiu Hao, James B. Orlin: A Faster Algorithm for Finding the Minimum Cut in a Directed Graph. 424-446 BibTeX
V. King, S. Rao, Robert Endre Tarjan: A Faster Deterministic Maximum Flow Algorithm. 447-474 BibTeX
Mihalis Yannakakis: On the Approximation of Maximum Satisfiability. 475-502 BibTeX