| 357 | -- | 359 | Joseph S. B. Mitchell, Jan Karel Lenstra. Guest Editors Introduction |
| 369 | -- | 374 | David Hartvigsen. Recognizing Voronoi Diagrams with Linear Programming |
| 375 | -- | 386 | Esther M. Arkin, Klara Kedem, Joseph S. B. Mitchell, Josef Sprinzak, Michael Werman. Matching Points into Pairwise-Disjoint Noise Regions: Combinatorial Bounds and Algorithms |
| 387 | -- | 411 | Jon Jouis Bentley. Fast Algorithms for Geometric Traveling Salesman Problems |
| 412 | -- | 417 | S. Louis Hakimi, Martine Labbé, Edward F. Schmeichel. The Voronoi Partition of a Network and Its Implications in Location Theory |
| 418 | -- | 425 | Hossam ElGindy, J. Mark Keil. Efficient Algorithms for the Capacitated 1-Median Problem |
| 426 | -- | 434 | Hiroshi Imai, D. T. Lee, Chung-Do Yang. 1-Segment Center Problems |
| 435 | -- | 438 | Elias Koutsoupias, Christos H. Papadimitriou, Martha Sideri. On the Optimal Bisection of a Polygon |
| 439 | -- | 446 | V. Chandru, V. T. Rajan, R. Swaminathan. Monotone Pieces of Chains |
| 447 | -- | 452 | Laurent Alonso, Arthur S. Goldstein, Edward M. Reingold. "Lion and Man": Upper and Lower Bounds |