| 2000 | Approximating the maximum quadratic assignment problem. | Esther M. Arkin, Refael Hassin |
| 2000 | Cutting planes and the traveling salesman problem (abstract only). | David L. Applegate, Robert E. Bixby, Vasek Chvtal, William J. Cook |
| 2000 | The effects of temporary sessions on network performance. | Matthew Andrews, Lisa Zhang |
| 2000 | Instability of FIFO in session-oriented networks. | Matthew Andrews |
| 2000 | Inplace run-length 2d compressed search. | Amihood Amir, Gad M. Landau, Dina Sokol |
| 2000 | Faster algorithms for string matching with | Amihood Amir, Moshe Lewenstein, Ely Porat |
| 2000 | Real scaled matching. | Amihood Amir, Ayelet Butman, Moshe Lewenstein |
| 2000 | Computing the arrangement of curve segments: divide-and-conquer algorithms via sampling. | Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos |
| 2000 | TSP-based curve reconstruction in polynomial time. | Ernst Althaus, Kurt Mehlhorn |
| 2000 | Word encoding tree connectivity works. | Stephen Alstrup, Jens P. Secher, Mikkel Thorup |
| 2000 | Pattern matching in dynamic texts. | Stephen Alstrup, Gerth Stlting Brodal, Theis Rauhe |
| 2000 | Accurate approximations for Asian options. | Donald Aingworth, Rajeev Motwani, Jeffrey D. Oldham |
| 2000 | Coloring powers of planar graphs. | Geir Agnarsson, Magns M. Halldrsson |
| 2000 | Approximation algorithms for projective clustering. | Pankaj K. Agarwal, Cecilia Magdalena Procopiuc |
| 2000 | Approximation algorithms for layered manufacturing. | Pankaj K. Agarwal, Pavan K. Desikan |
| 2000 | Exact and approximation algorithms for minimum-width cylindrical shells. | Pankaj K. Agarwal, Boris Aronov, Micha Sharir |
| 1999 | Analysis of a Bounding Box Heuristic for Object Intersection. | Yunhong Zhou, Subhash Suri |
| 1999 | Fast and Effective Stripification of Polygonal Surface Models. | Xinyu Xiang, Martin Held, Joseph S. B. Mitchell |
| 1999 | Experimental Performance of Shared RSA Modulus Generation. | Rebecca N. Wright, Sara Spalding |
| 1999 | When Does a Dynamic Programming Formulation Guarantee the Existence of an FPTAS? | Gerhard J. Woeginger |
| 1999 | Faster Approximation Algorithms for Generalized Flow. | Kevin D. Wayne, Lisa Fleischer |
| 1999 | A New Property and a Faster Algorithm for Baseball Elimination. | Kevin D. Wayne |
| 1999 | Exact Solutions to Large-scale Plane Steiner Tree Problems. | David M. Warme, Pawel Winter, Martin Zachariasen |
| 1999 | Computational Complexity of Compaction to Cycles. | Narayan Vikas |
| 1999 | A Convex Relaxation for the Asymmetric TSP. | Santosh S. Vempala, Mihalis Yannakakis |