Abstract is missing.
- Discrepancy Theory and Computational GeometryBernard Chazelle. 1-2
- Dynamic Motion Planning in Low Obstacle Density EnvironmentsRobert-Paul Berretty, Mark H. Overmars, A. Frank van der Stappen. 3-16
- Visibility-Based Pursuit-Evasion in a Polygonal EnvironmentLeonidas J. Guibas, Jean-Claude Latombe, Steven M. LaValle, David Lin, Rajeev Motwani. 17-30
- Maintaining the Extent of a Moving Point SetPankaj K. Agarwal, Leonidas J. Guibas, John Hershberger, Eric Veach. 31-44
- Finding Cores of Limited LengthStephen Alstrup, Peter W. Lauridsen, Peer Sommerlund, Mikkel Thorup. 45-54
- On Bipartite Crossings, Largest Biplanar Subgraphs, and the Linear Arrangement ProblemFarhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto. 55-68
- Approximation Algorithms for a Genetic Diagnostics ProblemS. Rao Kosaraju, Alejandro A. Schäffer, Leslie G. Biesecker. 69-92
- Cartographic Line Simplification and Polygon CSG Formulae and in O(n log* n) TimeJohn Hershberger, Jack Snoeyink. 93-103
- Constrained TSP and Low-Power ComputingMoses Charikar, Rajeev Motwani, Prabhakar Raghavan, Craig Silverstein. 104-115
- On-line Load Balancing for Related MachinesPiotr Berman, Moses Charikar, Marek Karpinski. 116-125
- A Linear-Time Algorithm for the 1-Mismatch ProblemNikola Stojanovic, Piotr Berman, Deborah Gumucio, Ross C. Hardison, Webb Miller. 126-135
- On Some Geometric Optimization Problems in Layered ManufacturingJayanth Majhi, Ravi Janardan, Michiel H. M. Smid, Prosenjit Gupta. 136-149
- New TSP Construction Heuristics and Their Relationships to the 2-OptHiroyuki Okano, Shinji Misono, Kazuo Iwano. 150-159
- Pattern Matching In HypertextAmihood Amir, Moshe Lewenstein, Noa Lewenstein. 160-173
- Multiple Approximate String MatchingRicardo A. Baeza-Yates, Gonzalo Navarro. 174-184
- Applied Computational Geormetry - AbstractDavid P. Dobkin. 185
- Checking the Convexity of Polytopes and the Planarity of Subdivisions (Extended Abstract)Olivier Devillers, Giuseppe Liotta, Franco P. Preparata, Roberto Tamassia. 186-199
- Voronoi Diagrams for Polygon-Offset Distance FunctionsGill Barequet, Matthew Dickerson, Michael T. Goodrich. 200-209
- Randomized Algorithms for that Ancient Scheduling ProblemSteven S. Seiden. 210-223
- Optimal Parallel Algorithms for Finding Proximate Points, with Applications (Extended Abstract)Tatsuya Hayashi, Koji Nakano, Stephan Olariu. 224-233
- An Efficient Algorithm for Shortest Paths in Vertical and Horizontal SegmentsDavid Eppstein, David Hart. 234-247
- On Geometric Path Query ProblemsDanny Z. Chen, Ovidiu Daescu, Kevin S. Klenk. 248-257
- On-line Scheduling with Hard Deadlines (Extended Abstract)Sally A. Goldman, Jyoti Parwatikar, Subhash Suri. 258-271
- Load Balanced Mapping of Data Structures in Parallel Memory Modules for Fast and Conflict-Free Templates AccessSajal K. Das, Maria Cristina Pinotti. 272-281
- Parallel vs. Parametric Complexity (Abstract)Ketan Mulmuley. 282-283
- Position-Independent Near Optimal Searching and On-line Recognition in Star PolygonsAlejandro López-Ortiz, Sven Schuierer. 284-296
- Dynamic Data Structures for Fat Objects and Their ApplicationsAlon Efrat, Matthew J. Katz, Frank Nielsen, Micha Sharir. 297-306
- Intractability of Assembly Sequencing: Unit Disks in the PlaneMichael H. Goldwasser, Rajeev Motwani. 307-320
- On Hamiltonian Triangulations in Simple Polygons (Extended Abstract)Giri Narasimhan. 321-330
- Computing Orthogonal Drawings with the Minimum Number of BendsPaola Bertolazzi, Giuseppe Di Battista, Walter Didimo. 331-344
- On a Simple Depth-First Search Strategy for Exploring Unknown GraphsStephen Kwek. 345-353
- Orthogonal Drawing of High Degree Graphs with Small Area and Few BendsAchilleas Papakostas, Ioannis G. Tollis. 354-367
- A Centroid Labeling Technique and its Application to Path Selection in Trees (Extended Abstract)Sarnath Ramnath, Hong Shen. 368-377
- Offset-Polygon Annulus Placement ProblemsGill Barequet, Amy J. Briggs, Matthew Dickerson, Michael T. Goodrich. 378-391
- Computing Constrained Minimum-Width Annuli of Point SetsMark de Berg, Prosenjit Bose, David Bremner, Suneeta Ramaswami, Gordon T. Wilfong. 392-401
- Geometric Applications Of PosetsMichael Segal, Klara Kedem. 402-415
- Constructing Pairwise Disjoint Paths with Few LinksHimanshu Gupta, Rephael Wenger. 416-425
- Trans-Dichotomous Algorithms Without Multiplication - Some Upper and Lower BoundsAndrej Brodnik, Peter Bro Miltersen, J. Ian Munro. 426-439
- An Approximation Algorithm for Stacking up Bins from a Conveyor onto PalletsJochen Rethmann, Egon Wanke. 440-449
- Relaxed Balance through Standard RotationsKim S. Larsen, Eljas Soisalon-Soininen, Peter Widmayer. 450-461
- Efficient Breakout Routing in Printed Circuit Boards (Extended Abstract)John Hershberger, Subhash Suri. 462-471
- Panarity, Revisited (Extended Abstract)Zhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou. 472-473