Journal: J. Algorithms

Volume 17, Issue 3

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

Volume 17, Issue 2

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

Volume 17, Issue 1

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