| 1998 | Edge-Connectivity Augmentation with Partition Constraints. | Jrgen Bang-Jensen, Harold N. Gabow, Tibor Jordn, Zoltn Szigeti |
| 1998 | Ancient and New Algorithms for Load Balancing in the L | Adi Avidor, Yossi Azar, Jir Sgall |
| 1998 | A Polynomial-Time Approximation Scheme for Weighted Planar Graph TSP. | Sanjeev Arora, Michelangelo Grigni, David R. Karger, Philip N. Klein, Andrzej Woloszyn |
| 1998 | Theory and Practice of I/O-Efficient Algorithms for Multidimensional Batched Searching Problems (Extended Abstract). | Lars Arge, Octavian Procopiuc, Sridhar Ramaswamy, Torsten Suel, Jeffrey Scott Vitter |
| 1998 | Direct Routing on Trees (Extended Abstract). | Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup |
| 1998 | Finding a Large Hidden Clique in a Random Graph. | Noga Alon, Michael Krivelevich, Benny Sudakov |
| 1998 | Average-Case Analyses of First Fit and Random Fit Bin Packing. | Susanne Albers, Michael Mitzenmacher |
| 1998 | Identification of Gene Regulatory Networks by Strategic Gene Disruptions and Gene Overexpressions. | Tatsuya Akutsu, Satoru Kuhara, Osamu Maruyama, Satoru Miyano |
| 1998 | Exact and Approximation Algorithms for Clustering (Extended Abstract). | Pankaj K. Agarwal, Cecilia Magdalena Procopiuc |
| 1998 | Kinetic Binary Space Partitions for Intersecting Segments and Disjoint Triangles (Extended Abstract). | Pankaj K. Agarwal, Jeff Erickson, Leonidas J. Guibas |
| 1998 | I/O-Efficient Algorithms for Contour-line Extraction and Planar Graph Blocking (Extended Abstract). | Pankaj K. Agarwal, Lars Arge, T. M. Murali, Kasturi R. Varadarajan, Jeffrey Scott Vitter |
| 1998 | On the Exact Worst Case Query Complexity of Planar Point Location. | Udo Adamy, Raimund Seidel |
| 1997 | Optimal Bounds for Matching Routing on Trees. | Louxin Zhang |
| 1997 | The Variance of Two Game Tree Algorithms. | Yanjun Zhang |
| 1997 | Determinant Algorithms for Random Planar Structures. | David Bruce Wilson |
| 1997 | On-line Algorithms for Compressing Planar Curves. | Gordon T. Wilfong |
| 1997 | Randomized sorting in O(n log log n) Time and Linear Space Using Addition, Shift, and Bit-Wise Boolean Operations. | Mikkel Thorup |
| 1997 | Decremental Dynamic Connectivity. | Mikkel Thorup |
| 1997 | LP Based Approach to Optimal Stable Matchings. | Chung-Piaw Teo, Jay Sethuraman |
| 1997 | Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem. | Martin Skutella |
| 1997 | Asymptotically Good Codes Correcting Insertions, Deletions, and Transpositions (Preliminary Version). | Leonard J. Schulman, David Zuckerman |
| 1997 | Buy-at-Bulk Network Design: Approximating the Single-Sink Edge Installation Problem. | F. Sibel Salman, Joseph Cheriyan, R. Ravi, S. Subramanian |
| 1997 | Information Retrieval Algorithms: A Survey. | Prabhakar Raghavan |
| 1997 | Practical Toroidality Testing. | Eugene Neufeld, Wendy J. Myrvold |
| 1997 | Computing Edge-Connectivity Augmentation Function in (nm) Time. | Hiroshi Nagamochi, Takashi Shiraki, Toshihide Ibaraki |