| Recent Developments in Maximum Flow Algorithms (Invited Lecture) / A. V. Goldberg |
| An ? - Approximation Algorithm for Weighted Shortest Paths on Polyhedral Surfaces / L. Aleksandrov ; M. Lanthier ; A. Maheshwari ; J. R. Sack |
| Facility Location with Dynamic Distance Functions / R. Bhatia ; S. Guha ; S. Khuller ; Y. J. Sussmann |
| An Approximation Scheme for Bin Packing with Conflicts / K. Jansen |
| Approximations for the General Block Distribution of a Matrix / B. Aspvall ; M. M. Halldórsson ; F. Manne |
| An Optimal Algorithm for Computing Visible Nearest Foreign Neighbors among Colored Line Segments / T. Graf ; K. Veezhinathan |
| Moving an Angle around a Region / F. Hoffmann ; C. Icking ; R. Klein ; K. Kriegel |
| Models and Motion Planning / M. de Berg ; M. J. Katz ; M. Overmars ; A. F. van der Stappen ; J. Vleugels |
| Constrained Square-Center Problems / K. Kedem ; M. Segal |
| Worst-Case Efficient External-Memory Priority Queues / G. S. Brodal ; J. Katajainen |
| Simple Confluently Persistent Catenable Lists / H. Kaplan ; C. Okasaki ; R. E. Tarjan |
| Improved Upper Bounds for Time-Space Tradeoffs for Selection with Limited Storage / V. Raman ; S. Ramnath |
| Probabilistic Data Structures for Priority Queues / R. Sridhar ; K. Rajasekar ; C. Pandu Rangan |
| Extractors for Weak Random Sources and Their Applications (Invited Lecture) / D. Zuckerman |
| Comparator Networks for Binary Heap Construction / M. C. Pinotti |
| Two-Variable Linear Programming in Parallel / D. Z. Chen ; J. Xu |
| Optimal Deterministic Protocols for Mobile Robots on a Grid / R. Grossi ; A. Pietracaprina ; G. Pucci |
| Concurrent Multicast in Weighted Networks / G. De Marco ; L. Gargano ; U. Vaccaro |
| Some Recent Strong Inapproximability Results (Invited Lecture) |
| Minimal Elimination of Planar Graphs / E. Dahlhaus |
| Memory Requirements for Table Computations in Partial k-Tree Algorithms / A. Proskurowski ; J. A. Telle |
| Formal Language Constrained Path Problems / C. Barrett ; R. Jacob ; M. Marathe |
| Local Search Algorithms for SAT: Worst-Case Analysis / E. A. Hirsch |
| Speed Is More Powerful than Clairvoyance / P. Berman ; C. Coulston |
| Randomized Online Multi-threaded Paging / S. S. Seiden |
| Determinant: Old Algorithms, New Insights / M. Mahajan ; V Vinay |
| Solving Fundamental Problems on Sparse-Meshes / J. F. Sibeyn |
| Output-Sensitive Cell Enumeration in Hyperplane Arrangements / N. Sleumer |
| Fast and Efficient Computation of Additively Weighted Voronoi Cells for Applications in Molecular Biology / H. M. Will |
| On the Number of Regular Vertices of the Union of Jordan Regions / B. Aronov ; A. Efrat ; D. Halperin ; M. Sharir |
| Distribution-Sensitive Algorithms / S. Sen ; N. Gupta |
| Author Index |
| Recent Developments in Maximum Flow Algorithms (Invited Lecture) / A. V. Goldberg |
| An ? - Approximation Algorithm for Weighted Shortest Paths on Polyhedral Surfaces / L. Aleksandrov ; M. Lanthier ; A. Maheshwari ; J. R. Sack |
| Facility Location with Dynamic Distance Functions / R. Bhatia ; S. Guha ; S. Khuller ; Y. J. Sussmann |
| An Approximation Scheme for Bin Packing with Conflicts / K. Jansen |
| Approximations for the General Block Distribution of a Matrix / B. Aspvall ; M. M. Halldórsson ; F. Manne |
| An Optimal Algorithm for Computing Visible Nearest Foreign Neighbors among Colored Line Segments / T. Graf ; K. Veezhinathan |
