| 1997 | A Practical Approximation Algorithm for the LMS Line Estimator. | David M. Mount, Nathan S. Netanyahu, Kathleen Romanik, Ruth Silverman, Angela Y. Wu |
| 1997 | Optimal Good-Aspect-Ratio Coarsening for Unstructured Meshes. | Gary L. Miller, Dafna Talmor, Shang-Hua Teng |
| 1997 | Polynomial Algorithms for Multiprocessor Scheduling with a Small Number of Job Lengths. | S. Thomas McCormick, Scott R. Smallwood, Frits C. R. Spieksma |
| 1997 | Linear-Time Transitive Orientation. | Ross M. McConnell, Jeremy P. Spinrad |
| 1997 | Improving the Discrepancy Bound for Sparse Matrices: Better Approximations for Sparse Lattice Approximation Problems. | Aravind Srinivasan |
| 1997 | A Combinatorial Algorithm for the Determinant. | Meena Mahajan, V. Vinay |
| 1997 | A Near-Optimal Heuristic for Minimum Weight Triangulation of Convex Polygons (Extended Abstract). | Christos Levcopoulos, Drago Krznaric |
| 1997 | The Influence of Caches on the Performance of Sorting. | Anthony LaMarca, Richard E. Ladner |
| 1997 | From Sir Isaac to the Sloan Survey: Calculating the Structure and Chaos Owing to Gravity in the Universe. | George Lake, Thomas Quinn, Derek C. Richardson |
| 1997 | Improved Access to Optimal Bandwidth in Trees. | Vijay Kumar, Eric J. Schwabe |
| 1997 | Approximating Shallow-Light Trees (Extended Abstract). | Guy Kortsarz, David Peleg |
| 1997 | Inferring Evolutionary Trees from Ordinal Data. | Paul E. Kearney, Ryan Hayward, Henk Meijer |
| 1997 | Implementing a Fully Polynomial Time Approximation Scheme for All Terminal Network Reliability. | David R. Karger, Ray P. Tai |
| 1997 | Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals. | Haim Kaplan, Ron Shamir, Robert Endre Tarjan |
| 1997 | On-Line Difference Maximization. | Ming-Yang Kao, Stephen R. Tate |
| 1997 | Simple Markov-Chain Algorithms for Generating Bipartite Graphs and Tournaments (Extended Abstract). | Ravi Kannan, Prasad Tetali, Santosh S. Vempala |
| 1997 | Mapping Clones with a Given Ordering or Interleaving (Extended Abstract). | Tao Jiang, Richard M. Karp |
| 1997 | Probabilistic Analysis for Scheduling with Conflicts. | Sandy Irani, Vitus J. Leung |
| 1997 | A Competitive Strategy for Learning a Polygon. | Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel |
| 1997 | Shortest Path in Complete Bipartite Digraph Problem and its Applications. | Xin He, Zhi-Zhong Chen |
| 1997 | The Path Resistance Method for Bounding lambda | Stephen Guattery, Frank Thomson Leighton, Gary L. Miller |
| 1997 | Nearly Optimal Distributed Edge Colouring in O(log log n) Rounds. | David A. Grable, Alessandro Panconesi |
| 1997 | Methods for Achieving Fast Query Times in Point Location Data Structures. | Michael T. Goodrich, Mark W. Orletsky, Kumar Ramaiyer |
| 1997 | Randomized Fully-Scalable BSP Techniques for Multi-Searching and Convex Hull Construction (Preliminary Version). | Michael T. Goodrich |
| 1997 | Better Approximation Guarantees for Job-shop Scheduling. | Leslie Ann Goldberg, Mike Paterson, Aravind Srinivasan, Elizabeth Sweedyk |