| 1998 | Car-Pooling as a Data Structuring Device: The Soft Heap. | Bernard Chazelle |
| 1998 | Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property. | Phillip G. Bradford, Mordecai J. Golin, Lawrence L. Larmore, Wojciech Rytter |
| 1998 | Minimal Triangulations for Graphs with "Few" Minimal Separators. | Vincent Bouchitt, Ioan Todinca |
| 1998 | A Probabilistic Zero-Test for Expressions Involving Root of Rational Numbers. | Johannes Blmer |
| 1998 | Adaptability and the Usefulness of Hints (Extended Abstract). | Piotr Berman, Juan A. Garay |
| 1998 | A Randomized Algorithm for Two Servers on the Line (Extended Abstract). | Yair Bartal, Marek Chrobak, Lawrence L. Larmore |
| 1998 | Longest Common Subsequence from Fragments via Sparse Dynamic Programming. | Brenda S. Baker, Raffaele Giancarlo |
| 1998 | Analyzing an Infinite Parallel Job Allocation Process. | Micah Adler, Petra Berenbrink, Klaus Schrder |
| 1998 | A Functional Approach to External Graph Algorithms. | James Abello, Adam L. Buchsbaum, Jeffery R. Westbrook |
| 1997 | Reconstructing the Topology of a CAD Model: A Discrete Approach. | Karsten Weihe, Thomas Willhalm |
| 1997 | Algorithms for Computing Signs of 2×2 Determinants: Dynamics and Average-Case Analysis. | Brigitte Valle |
| 1997 | Approximating Satisfiable Satisfiability Problems (Extended Abstract). | Luca Trevisan |
| 1997 | Linear-Time Reconstruction of Delaunay Triangulations with Applications. | Jack Snoeyink, Marc J. van Kreveld |
| 1997 | Seven Problems: So Different yet Close. | Sergey V. Sevastianov |
| 1997 | On Piercing Sets of Axis-Parallel Rectangles and Rings. | Michael Segal |
| 1997 | Scheduling-LPs Bear Probabilities: Randomized Approximations for Min-Sum Criteria. | Andreas S. Schulz, Martin Skutella |
| 1997 | Competivive Analysis of on-line Stack-Up Algorithms. | Jochen Rethmann, Egon Wanke |
| 1997 | Coloring in Sublinear Time. | Andreas Nolte, Rainer Schrader |
| 1997 | Dynamic Storage Allocation with Known Durations. | Joseph Naor, Ariel Orda, Yael Petruschka |
| 1997 | Improved Approximations for Minimum Cardinality Quadrangulations of Finite Element Meshes. | Matthias Mller-Hannemann, Karsten Weihe |
| 1997 | Relaxed Balance for Search Trees with Local Rebalancing. | Kim S. Larsen, Thomas Ottmann, Eljas Soisalon-Soininen |
| 1997 | Minimum Spanning Trees in | Drago Krznaric, Christos Levcopoulos, Bengt J. Nilsson |
| 1997 | Quasi-Fully Dynamic Algorithms for Two-Connectivity, Cycle Equivalence and Related Problems. | Madhukar R. Korupolu, Vijaya Ramachandran |
| 1997 | Collecting Garbage Pages in a Distributed Shared Memory with Reduced Memory and Communication Overhead. | Dmitry Kogan, Assaf Schuster |
| 1997 | Fault-Tolerant Real-Time Scheduling. | Bala Kalyanasundaram, Kirk Pruhs |