| 1997 | A Better Approximation Ratio for the Minimum k-Edge-Connected Spanning Subgraph Problem. Cristina G. Fernandes |
| 1997 | A Combinatorial Algorithm for the Determinant. Meena Mahajan, V. Vinay |
| 1997 | A Competitive Strategy for Learning a Polygon. Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel |
| 1997 | A Near-Optimal Heuristic for Minimum Weight Triangulation of Convex Polygons (Extended Abstract). Christos Levcopoulos, Drago Krznaric |
| 1997 | A Practical Approximation Algorithm for the LMS Line Estimator. David M. Mount, Nathan S. Netanyahu, Kathleen Romanik, Ruth Silverman, Angela Y. Wu |
| 1997 | A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Square Roots. Christoph Burnikel, Rudolf Fleischer, Kurt Mehlhorn, Stefan Schirra |
| 1997 | All-Pairs Small-Stretch Paths. Edith Cohen, Uri Zwick |
| 1997 | An Efficient Algorithm for Terraine Simplification. Pankaj K. Agarwal, Pavan K. Desikan |
| 1997 | Approximating Matrix Multiplication for Pattern Recognition Tasks. Edith Cohen, David D. Lewis |
| 1997 | Approximating Shallow-Light Trees (Extended Abstract). Guy Kortsarz, David Peleg |
| 1997 | Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines That Run at Fifferent Speeds (Extended Abstract). Fabián A. Chudak, David B. Shmoys |
| 1997 | Approximation Algorithms for the Achromatic Number. Amitabh Chaudhary, Sundar Vishwanathan |
| 1997 | Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem. Martin Skutella |
| 1997 | Approximation Schemes for Scheduling. Noga Alon, Yossi Azar, Gerhard J. Woeginger, Tal Yadid |
| 1997 | Approximation Techniques for Average Completion Time Scheduling. Chandra Chekuri, Rajeev Motwani, B. Natarajan, Clifford Stein |
| 1997 | Asymptotically Good Codes Correcting Insertions, Deletions, and Transpositions (Preliminary Version). Leonard J. Schulman, David Zuckerman |
| 1997 | Better Approximation Guarantees for Job-shop Scheduling. Leslie Ann Goldberg, Mike Paterson, Aravind Srinivasan, Elizabeth Sweedyk |
| 1997 | Buckets, Heaps, Lists, and Monotone Priority Queues. Boris V. Cherkassky, Andrew V. Goldberg, Craig Silverstein |
| 1997 | Buy-at-Bulk Network Design: Approximating the Single-Sink Edge Installation Problem. F. Sibel Salman, Joseph Cheriyan, R. Ravi, S. Subramanian |
| 1997 | Coloring with Defect. Lenore Cowen, Wayne Goddard, C. Esther Jesurum |
| 1997 | Combinatorial Optimization Games. Xiaotie Deng, Toshihide Ibaraki, Hiroshi Nagamochi |
| 1997 | Computing Edge-Connectivity Augmentation Function in Õ(nm) Time. Hiroshi Nagamochi, Takashi Shiraki, Toshihide Ibaraki |
| 1997 | Computing a Minimum Biclique Cover is Polynomial for Bipartite Domino-Free Graphs. Jérôme Amilhastre, Philippe Janssen, Marie-Catherine Vilarem |
| 1997 | Data Structures for Mobile Data. Julien Basch, Leonidas J. Guibas, John Hershberger |
| 1997 | Decremental Dynamic Connectivity. Mikkel Thorup |
| 1997 | Determinant Algorithms for Random Planar Structures. David Bruce Wilson |
| 1997 | Deterministic Algorithms for 2-d Convex Programming and 3-d Online Linear Programming. Timothy M. Chan |
| 1997 | Efficient Algorithms for Finding Disjoint Paths in Grids (Extended Abstract). Wun-Tat Chan, Francis Y. L. Chin |
| 1997 | Efficient Algorithms for Robustness in Matroid Optimization. Greg N. Frederickson, Roberto Solis-Oba |
| 1997 | Efficient Approximation and Optimization Algorithms for Computational Metrology. Christian A. Duncan, Michael T. Goodrich, Edgar A. Ramos |
| 1997 | Efficient and Practical Modular Decomposition. Elias Dahlhaus, Jens Gustedt, Ross M. McConnell |
| 1997 | Experimental Analysis of Dynamic Minimum Spanning Tree Algorithms (Extended Abstract). Giuseppe Amato, Giuseppe Cattaneo, Giuseppe F. Italiano |
| 1997 | Experimental Studies of Access Graph Based Heuristics: Beating the LRU Standard? Amos Fiat, Ziv Rosen |
| 1997 | Experimental Study of Minimum Cut Algorithms. Chandra Chekuri, Andrew V. Goldberg, David R. Karger, Matthew S. Levine, Clifford Stein |
| 1997 | Fast Algorithms for Sorting and Searching Strings. Jon Louis Bentley, Robert Sedgewick |
| 1997 | Fast Approximate Graph Partitioning Algorithms. Guy Even, Joseph Naor, Satish Rao, Baruch Schieber |
| 1997 | Faster Construction of Planar Two-Centers. David Eppstein |
| 1997 | Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals. Haim Kaplan, Ron Shamir, Robert Endre Tarjan |
| 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 | Graph Orientations with No Sink and an Approximation for a Hard Case of #SAT. Russ Bubley, Martin E. Dyer |
| 1997 | Implementing a Fully Polynomial Time Approximation Scheme for All Terminal Network Reliability. David R. Karger, Ray P. Tai |
| 1997 | Improved Access to Optimal Bandwidth in Trees. Vijay Kumar, Eric J. Schwabe |
| 1997 | Improved Approximation Algorithms for Scheduling with Release Dates. Michel X. Goemans |
| 1997 | Improving the Discrepancy Bound for Sparse Matrices: Better Approximations for Sparse Lattice Approximation Problems. Aravind Srinivasan |
| 1997 | Inferring Evolutionary Trees from Ordinal Data. Paul E. Kearney, Ryan Hayward, Henk Meijer |
| 1997 | Information Retrieval Algorithms: A Survey. Prabhakar Raghavan |
| 1997 | LP Based Approach to Optimal Stable Matchings. Chung-Piaw Teo, Jay Sethuraman |
| 1997 | Line Traversals of Balls and Smallest Enclosing Cylinders in Three Dimensions. Pankaj K. Agarwal, Boris Aronov, Micha Sharir |
| 1997 | Linear-Time Transitive Orientation. Ross M. McConnell, Jeremy P. Spinrad |
| 1997 | Local Rules for Protein Folding on a Triangular Lattice and Generalized Hydrophobicity in the HP Model. Richa Agarwala, Serafim Batzoglou, Vlado Dancík, Scott E. Decatur, Martin Farach, Sridhar Hannenhalli, Steven Skiena |
| 1997 | Map Labeling and Its Generalizations. Srinivas Doddi, Madhav V. Marathe, Andy Mirzaian, Bernard M. E. Moret, Binhai Zhu |
| 1997 | Mapping Clones with a Given Ordering or Interleaving (Extended Abstract). Tao Jiang, Richard M. Karp |
| 1997 | Markov Chains for Linear Extensions, the Two-Dimensional Case. Stefan Felsner, Lorenz Wernisch |
| 1997 | Methods for Achieving Fast Query Times in Point Location Data Structures. Michael T. Goodrich, Mark W. Orletsky, Kumar Ramaiyer |
| 1997 | Nearly Optimal Distributed Edge Colouring in O(log log n) Rounds. David A. Grable, Alessandro Panconesi |
| 1997 | Numerical Taxonomy on Data: Experimental Results. Jaime Cohen, Martin Farach |
| 1997 | On Distances between Phylogenetic Trees (Extended Abstract). Bhaskar DasGupta, Xin He, Tao Jiang, Ming Li, John Tromp, Louxin Zhang |
| 1997 | On Page Migration and Other Relaxed Task Systems. Yair Bartal, Moses Charikar, Piotr Indyk |
| 1997 | On the Maximum Scatter TSP (Extended Abstract). Esther M. Arkin, Yi-Jen Chiang, Joseph S. B. Mitchell, Steven Skiena, Tae-Cheon Yang |
| 1997 | On-Line Difference Maximization. Ming-Yang Kao, Stephen R. Tate |
| 1997 | On-line Algorithms for Compressing Planar Curves. Gordon T. Wilfong |
| 1997 | Online List Accessing Algorithms and Their Applications: Recent Empirical Evidence. Ran Bachrach, Ran El-Yaniv |
| 1997 | Optimal Bounds for Matching Routing on Trees. Louxin Zhang |
| 1997 | Optimal Good-Aspect-Ratio Coarsening for Unstructured Meshes. Gary L. Miller, Dafna Talmor, Shang-Hua Teng |
| 1997 | Optimal Point Placement for Mesh Smoothing. Nina Amenta, Marshall W. Bern, David Eppstein |
| 1997 | Optimal Search in Trees: Extended Abstract + Appendix. Yosi Ben-Asher, Eitan Farchi, Ilan Newman |
| 1997 | Partial Matching of Planar Polylines Under Similarity Transformations. Scott D. Cohen, Leonidas J. Guibas |
| 1997 | Polynomial Algorithms for Multiprocessor Scheduling with a Small Number of Job Lengths. S. Thomas McCormick, Scott R. Smallwood, Frits C. R. Spieksma |
| 1997 | Practical Toroidality Testing. Eugene Neufeld, Wendy J. Myrvold |
| 1997 | Probabilistic Analysis for Scheduling with Conflicts. Sandy Irani, Vitus J. Leung |
| 1997 | Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 5-7 January 1997, New Orleans, Louisiana, USA. Michael E. Saks |
| 1997 | Randomized Fully-Scalable BSP Techniques for Multi-Searching and Convex Hull Construction (Preliminary Version). Michael T. Goodrich |
| 1997 | Randomized sorting in O(n log log n) Time and Linear Space Using Addition, Shift, and Bit-Wise Boolean Operations. Mikkel Thorup |
| 1997 | Randomly Sampling Molecules. Leslie Ann Goldberg, Mark Jerrum |
| 1997 | Rounding in Lattices and its Cryptographic Applications. Dan Boneh, Ramarathnam Venkatesan |
| 1997 | Runtime Prediction of Real Programs on Real Machines. Ulrich Finkler, Kurt Mehlhorn |
| 1997 | Self-Stabilizing Unidirectional Network Algorithms by Power-Supply (Extended Abstract). Yehuda Afek, Anat Bremler-Barr |
| 1997 | Shortest Path in Complete Bipartite Digraph Problem and its Applications. Xin He, Zhi-Zhong Chen |
| 1997 | Simple Markov-Chain Algorithms for Generating Bipartite Graphs and Tournaments (Extended Abstract). Ravi Kannan, Prasad Tetali, Santosh S. Vempala |
| 1997 | The Houman Alborzi, Eric Torng, Patchrawat Uthaisombut, Stephen Wagner |
| 1997 | The Algorithmic Aspects of Uncrowded Hypergraphs (Extended Abstract). Claudia Bertram-Kretzberg, Hanno Lefmann |
| 1997 | The Angular-Metric Traveling Salesman Problem. Alok Aggarwal, Don Coppersmith, Sanjeev Khanna, Rajeev Motwani, Baruch Schieber |
| 1997 | The Growth Rate of Vertex-Transitive Planar Graphs. László Babai |
| 1997 | The Influence of Caches on the Performance of Sorting. Anthony LaMarca, Richard E. Ladner |
| 1997 | The Path Resistance Method for Bounding lambda Stephen Guattery, Frank Thomson Leighton, Gary L. Miller |
| 1997 | The Variance of Two Game Tree Algorithms. Yanjun Zhang |