Abstract is missing.
- Lower Bounds to Processor-Time Tradeoffs under Bounded-Speed Message PropagationGianfranco Bilardi, Franco P. Preparata. 1-12
- The Two-Line Center Problem from a Polar View: A New Algorithm and Data StructureJerzy W. Jaromczyk, Miroslaw Kowaluk. 13-25
- On Some Geometric Selection and Optimization Problems via Sorted MatricesAlex Glozman, Klara Kedem, Gregory Shpitalnik. 26-37
- Load Balancing in Quorum Systems (Extended Abstract)Ron Holzman, Yosi Marcus, David Peleg. 38-49
- Balanced Distributed Search Trees Do Not ExistBrigitte Kröll, Peter Widmayer. 50-61
- Two-Floodlight Illumination of Convex PolygonsVladimir Estivill-Castro, Jorge Urrutia. 62-73
- On the Complexity of Approximating and Illuminating Three-Dimensional Convex Polyhedra (Preliminary Version)Gautam Das, Michael T. Goodrich. 74-85
- Scheduling Jobs that Arrive Over Time (Extended Abstract)Cynthia A. Phillips, Clifford Stein, Joel Wein. 86-97
- Dynamic Algorithms for the Dyck LanguagesGudmund Skovbjerg Frandsen, Thore Husfeldt, Peter Bro Miltersen, Theis Rauhe, Søren Skyum. 98-108
- Arrangements in Higher Dimensions: Voronoi Diagrams, Motion Planning, and Other ApplicationsMicha Sharir. 109-121
- Computing a Shortest Watchman Path in a Simple Polygon in Polynomial-TimeSvante Carlsson, Håkan Jonsson. 122-134
- Going Home Through an Unknown StreetAlejandro López-Ortiz, Sven Schuierer. 135-146
- Page Migration with Limited Local Memory CapacitySusanne Albers, Hisashi Koga. 147-158
- Randomized Algorithms for Metrical Task SystemsSandy Irani, Steven S. Seiden. 159-170
- Efficient Geometric Algorithms for Workpiece Orientation in 4- and 5-Axis NC-MachiningProsenjit Gupta, Ravi Janardan, Jayanth Majhi, Tony C. Woo. 171-182
- Computing Common Tangents Without a Separating LineDavid G. Kirkpatrick, Jack Snoeyink. 183-193
- Online Perfect Matching and Mobile ComputingEdward F. Grove, Ming-Yang Kao, P. Krishnan, Jeffrey Scott Vitter. 194-205
- Competitive Algorithms for the On-line Traveling SalesmanGiorgio Ausiello, Esteban Feuerstein, Stefano Leonardi, Leen Stougie, Maurizio Talamo. 206-217
- Quadrangulations of Planar SetsGodfried T. Toussaint. 218-227
- A Linear-time Construction of the Relative Neighborhood Graph within a HistogramAndrzej Lingas, Asish Mukhopadhyay. 228-238
- Computing Proximity Drawings of Trees in the 3-Dimemsional SpaceGiuseppe Liotta, Giuseppe Di Battista. 239-250
- Routing on Trees via MatchingsAlan Roberts, Antonios Symvonis, Louxin Zhang. 251-262
- A Ranking Algorithm for Hamilton Paths in Shuffle-Exchange GraphsFred S. Annexstein, Eugene A. Kuchko. 263-269
- Amortization Results for Chromatic Search Trees, with an Application to Priority QueuesJoan Boyar, Rolf Fagerberg, Kim S. Larsen. 270-281
- Fast Meldable Priority QueuesGerth Stølting Brodal. 282-290
- On the Computation of Fast Data Transmissions in Networks with Capacities and DelaysDimitrios Kagaris, Spyros Tragoudas, Grammati E. Pantziou, Christos D. Zaroliagis. 291-302
- Routing with Delays when Storage is CostlySanjoy K. Sanjoy, Gara Pruesse. 303-314
- Algorithmic Arguments in Physics of ComputationPaul M. B. Vitányi, Ming Li. 315-333
- The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract)Lars Arge. 334-345
- Experiments on the Practical I/O Efficiency of Geometric Algorithms: Distribution Sweep vs. Plane SweepYi-Jen Chiang. 346-357
- Computing a Dominating Pair in an Asteroidal Triple-free Graph in Linear TimeDerek G. Corneil, Stephan Olariu, Lorna Stewart. 358-368
- A Linear Algorithm for the Maximal Planar Subgraph ProblemHristo Djidjev. 369-380
- Topology B-Trees and Their ApplicationsPaul B. Callahan, Michael T. Goodrich, Kumar Ramaiyer. 381-392
- In-Place Calculation of Minimum-Redundancy CodesAlistair Moffat, Jyrki Katajainen. 393-402
- Regular-Factors In The Complements Of Partial k-TreesDamon Kaller, Arvind Gupta, Thomas C. Shermer. 403-414
- Obstructions to Within a Few Vertices or Edges of AcyclicKevin Cattell, Michael J. Dinneen, Michael R. Fellows. 415-427
- Faster Enumeration of All Spanning Trees of a Directed GraphRamesh Hariharan, Sanjiv Kapoor, Vijay Kumar. 428-439
- A Simpler Minimum Spanning Tree Verification AlgorithmValerie King. 440-448
- On the Approximation Properties of Independent Set Problem in Degree 3 GraphsPiotr Berman, Toshihiro Fujito. 449-460
- Approximation of Constraint Satisfaction via Local Search (Extended Abstract)Hoong Chuin Lau. 461-472
- On the Difficulty of Range SearchingArne Andersson, Kurt Swanson. 473-481
- Tables Should Be Sorted (On Random Access Machines)Faith E. Fich, Peter Bro Miltersen. 482-493
- Improved Length Bounds for the Shortest Superstring Problem (Extended Abstract)Chris Armen, Clifford Stein. 494-505
- Non-Overlapping Local Alignments (Weighted Independent Sets of Axis Parallel Rectangles)Vineet Bafna, Babu O. Narayanan, R. Ravi. 506-517
- Experiences with the Implementation of Geometric Algorithms (Abstract)Kurt Mehlhorn. 518