Abstract is missing.
- Computing Depth Orders and Related ProblemsPankaj K. Agarwal, Matthew J. Katz, Micha Sharir. 1-12
- Selection in Monotone Matrices and Computing k:::th::: Nearest NeighborsPankaj K. Agarwal, Sandeep Sen. 13-24
- New On-Line Algorithms for the Page Replication ProblemSusanne Albers, Hisashi Koga. 25-36
- Serving Requests with On-line RoutingGiorgio Ausiello, Esteban Feuerstein, Stefano Leonardi, Leen Stougie, Maurizio Talamo. 37-48
- A New Algorithm for the Construction of Optimal B-TreesPeter Becker. 49-60
- New Results on Binary Space Partitions in the Plane (Extended Abstract)Mark de Berg, Marko de Groot, Mark H. Overmars. 61-72
- A Nearly Optimal Parallel Algorithm for the Voronoi Diagram of a Convex PolygonPiotr Berman, Andrzej Lingas. 73-82
- On Triangulating Planar Graphs under the Four-Connectivity ConstraintTherese C. Biedl, Goos Kant, Michael Kaufmann. 83-94
- Parallel and Sequential Approximations of Shortest SuperstringsArtur Czumaj, Leszek Gasieniec, Marek Piotrów, Wojciech Rytter. 95-106
- Separating Translates in the Plane: Combinatorial Bounds and an AlgorithmJurek Czyzowicz, Hazel Everett, Jean-Marc Robert. 107-118
- Finding All Weakly-Visible Chords of a Polygon in Linear Time (Extended Abstract)Gautam Das, Paul J. Heffernan, Giri Narasimhan. 119-130
- A Tight Lower Bound for On-line Monotonic List LabelingPaul F. Dietz, Joel I. Seiferas, Ju Zhang. 131-142
- Trapezoid Graphs and Generalizations, Geometry and AlgorithmsStefan Felsner, Rudolf Müller, Lorenz Wernisch. 143-154
- Optimal Parametric Search on Graphs of Bounded Tree-WidthDavid Fernández-Baca, Giora Slutzki. 155-166
- Lower Bounds for Dynamic AlgorithmsMichael L. Fredman. 167-171
- Sequential and Parallel Algorithms for Embedding Problems on Classes of Partial k-TreesArvind Gupta, Naomi Nishimura. 172-182
- On Intersection Searching Problems Involving Curved ObjectsProsenjit Gupta, Ravi Janardan, Michiel H. M. Smid. 183-194
- Improved Approximations of Independent Sets in Bounded-Degree GraphsMagnús M. Halldórsson, Jaikumar Radhakrishnan. 195-206
- Asymptotically Optimal Election on Weighted RingsLisa Higham, Teresa M. Przytycka. 207-218
- Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes (Extended Abstract)Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener. 219-230
- Recent Results in Hardness of ApproximationJohan Håstad. 231-239
- The Parallel Hierarchical Memory ModelBen H. H. Juurlink, Harry A. G. Wijshoff. 240-251
- Randomized Geometric Algorithms (Abstract)Ketan Mulmuley. 252-254
- Connecting the Maximum Number of Grid Nodes to the Boundary with Non-Intersecting Line SegmentsLeonidas Palios. 255-266
- On Self-Stabilizing Wait-Free Clock SynchronizationMarina Papatriantafilou, Philippas Tsigas. 267-277
- Hard Graphs for Randomized Subgraph Exclusion AlgorithmsMarcus Peinado. 278-289
- Task Scheduling in Networks (Extended Abstract)Cynthia A. Phillips, Clifford Stein, Joel Wein. 290-301
- Parallel Dynamic Lowest Common AncestorsErik Schenk. 302-313
- An O(log N) Algorithm to Compute the Kernel of a PolygonSven Schuierer. 314-325
- Computing the L::1::-Diameter and Center of a Simple Rectilinear Polygon in ParallelSven Schuierer. 326-337
- Exploiting Locality in LT-RAM ComputationsJop F. Sibeyn, Tim J. Harris. 338-349
- Efficient Preprocessing of Simple Binary Pattern ForestsMikkel Thorup. 350-358
- A Parallel Algorithm for Edge-Coloring Partial k-TreesXiao Zhou, Shin-Ichi Nakano, Takao Nishizeki. 359-369
- Dominating Cliques in Distance-Hereditary GraphsFeodor F. Dragan. 370-381