Abstract is missing.
- Optimization Algorithms For Large NetworksAndrew V. Goldberg. 1-9
- Wanna Buy an Algorithm? Cheap! or: Algorithms for Text Searching Which Could Have Commercial Value (Abstract)Gaston H. Gonnet. 10-11
- Planar Drawings and Angular Resolution: Algorithms and Bounds (Extended Abstract)Ashim Garg, Roberto Tamassia. 12-23
- A Better Heuristic for Orthogonal Graph DrawingsTherese C. Biedl, Goos Kant. 24-35
- Hamilton Triangulations for Fast RenderingEsther M. Arkin, Martin Held, Joseph S. B. Mitchell, Steven Skiena. 36-47
- Efficient Construction of a Bounded Degree Spanner with Low WeightSunil Arya, Michiel H. M. Smid. 48-59
- Approaching the 5/4-Approximation for Rectilinear Steiner TreesPiotr Berman, Ulrich Fößmeier, Marek Karpinski, Michael Kaufmann, Alexander Zelikovsky. 60-71
- Membership in Constant Time and Minimum SpaceAndrej Brodnik, J. Ian Munro. 72-81
- Faster Searching in Tries and Quadtrees - An Analysis of Level CompressionArne Andersson, Stefan Nilsson. 82-93
- The Analysis of a Hashing Schema by the Diagonal Poisson Transform (Extended Abstract)Patricio V. Poblete, Alfredo Viola, J. Ian Munro. 94-105
- Some Lower Bounds for Comparison-Based AlgorithmsSvante Carlsson, Jingsen Chen. 106-117
- An Efficient Algorithm for Edge-Ranking TreesXiao Zhou, Takao Nishizeki. 118-129
- Edge-Disjoint (s, t)-Paths on Undirected Planar Graphs in Linear TimeKarsten Weihe. 130-140
- A Simple Min Cut AlgorithmMechthild Stoer, Frank Wagner. 141-147
- Approximation Algorithm on Multi-Way Maxcut PartitioningJun Dong Cho, Salil Raje, Majid Sarrafzadeh. 148-158
- A Linear-Time Algorithm for Finding a Central Vertex of a Chordal GraphVictor Chepoi, Feodor F. Dragan. 159-170
- The Time Complexity of Updating Snapshot MemoriesAmos Israeli, Asaf Shirazi. 171-182
- Non-Exploratory Self-Stabilization for Constant-Space Symmetry-BreakingGiuseppe Parlati, Moti Yung. 183-201
- On-Line Distributed Data ManagementCarsten Lund, Nick Reingold, Jeffery Westbrook, Dicky C. K. Yan. 202-214
- A Unified Scheme for Detecting Fundamental Curves in Binary Edge ImagesTetsuo Asano, Naoki Katoh, Takeshi Tokuyama. 215-226
- How to Compute the Voronoi Diagram of Line Segments: Theoretical and Experimental ResultsChristoph Burnikel, Kurt Mehlhorn, Stefan Schirra. 227-239
- Range Searching and Point Location among Fat ObjectsMark H. Overmars, A. Frank van der Stappen. 240-253
- Convex Tours on Bounded CurvatureJean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jean-Marc Robert, Mariette Yvinec. 254-265
- Optimal Shortest Path and Minimum-Link Path Queries in the Presence of Obstacles (Extended Abstract)Yi-Jen Chiang, Roberto Tamassia. 266-277
- Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric ObjectsProsenjit Gupta, Ravi Janardan, Michiel H. M. Smid. 278-289
- Reverse-Fit: A 2-Optimal Algorithm for Packing RectanglesIngo Schiermeyer. 290-299
- An Optimal Algorithm for Preemptive On-line SchedulingBo Chen, André van Vliet, Gerhard J. Woeginger. 300-306
- Tight Approximations for Resource Constrained Scheduling ProblemsAnand Srivastav, Peter Stangier. 307-318
- An Algorithm for 0-1 Programming with Application to Airline Crew SchedulingDag Wedelin. 319-330
- An o(n) Work EREW Parallel Algorithm for Updating MSTSajal K. Das, Paolo Ferragina. 331-342
- On the Structure of DFS-Forests on Directed Graphs and the Dynamic Maintenance of DFS on DAG sPaolo Giulio Franciosa, Giorgio Gambosi, Umberto Nanni. 343-353
- Finding and Counting Given Length Cycles (Extended Abstract)Noga Alon, Raphael Yuster, Uri Zwick. 354-364
- Greedy Hot-Potato Routing on the MeshIshai Ben-Aroya, Assaf Schuster. 365-376
- Desnakification of Mesh Sorting AlgorithmsJop F. Sibeyn. 377-390
- Tight Bounds on Deterministic PRAM Emulations with Constant RedundancyAndrea Pietracaprina, Geppino Pucci. 391-400
- PRAM Computations Resilient to Memory FaultsBogdan S. Chlebus, Anna Gambin, Piotr Indyk. 401-412
- An Area Lower Bound for a Class of Fat-Trees (Extended Abstract)Gianfranco Bilardi, Paul Bay. 413-423
- A Unified Approach to Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric GraphsHarry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns. 424-435
- The Parallel Complexity of Eden Growth, Solid-on-Solid Groth and Ballistic Deposition (Extended Abstract)Raymond Greenlaw, Jonathan Machta. 436-447
- A New Approach to Resultant Computations and Other Algorithms with Exact DivisionArnold Schönhage, Ekkehart Vetter. 448-459
- Testing Equivalence of Morphisms on Context-Free LanguagesWojciech Plandowski. 460-470
- Work-Time Optimal Parallel Prefix Matching (Extended Abstract)Leszek Gasieniec, Kunsoo Park. 471-482
- On the Exact Complexity of the String Prefix-Matching Problem (Extended Abstract)Dany Breslauer, Livio Colussi, Laura Toniolo. 483-494
- Incremental Text Editing: A New Data StructurePaolo Ferragina. 495-507
- Erratum: Computing Treewidth and Minimum Fill-In: All You Need are the Minimal SeparatorsTon Kloks, Hans Leo Bodlaender, Haiko Müller, Dieter Kratsch. 508