| 1997 | A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs (Extended Abstract). Ulrik Brandes, Dorothea Wagner |
| 1997 | A New Exact Algorithm for General Orthogonal D-Dimensional Knapsack Problems. Sándor P. Fekete, Jörg Schepers |
| 1997 | A New Family of Randomized Algorithms for List Accessing. Theodoulos Garefalakis |
| 1997 | Algorithms - ESA '97, 5th Annual European Symposium, Graz, Austria, September 15-17, 1997, Proceedings Rainer E. Burkard, Gerhard J. Woeginger |
| 1997 | Algorithms for Computing Signs of 2×2 Determinants: Dynamics and Average-Case Analysis. Brigitte Vallée |
| 1997 | Approximating Satisfiable Satisfiability Problems (Extended Abstract). Luca Trevisan |
| 1997 | Area-Efficient Static and Incremental Graph Drawings. Therese C. Biedl, Michael Kaufmann |
| 1997 | Bounded Degree Spanning Trees (Extended Abstract). Artur Czumaj, Willy-Bernhard Strothmann |
| 1997 | Collecting Garbage Pages in a Distributed Shared Memory with Reduced Memory and Communication Overhead. Dmitry Kogan, Assaf Schuster |
| 1997 | Coloring in Sublinear Time. Andreas Nolte, Rainer Schrader |
| 1997 | Competivive Analysis of on-line Stack-Up Algorithms. Jochen Rethmann, Egon Wanke |
| 1997 | Decomposition of Integer Programs and of Generating Sets. Gérard Cornuéjols, Regina Urbaniak, Robert Weismantel, Laurence A. Wolsey |
| 1997 | Denesting by Bounded Degree Radicals. Johannes Blömer |
| 1997 | Distance Approximating Trees for Chordal and Dually Chordal Graphs (Extended Abstract). Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan |
| 1997 | Dynamic Data Structures for Realtime Management of Large Geormetric Scences (Extended Abstract). Matthias Fischer, Friedhelm Meyer auf der Heide, Willy-Bernhard Strothmann |
| 1997 | Dynamic Storage Allocation with Known Durations. Joseph Naor, Ariel Orda, Yael Petruschka |
| 1997 | Dynamically Switching Vertices in Planar Graphs (Extended Abstract). Daniele Frigioni, Giuseppe F. Italiano |
| 1997 | Fault-Tolerant Real-Time Scheduling. Bala Kalyanasundaram, Kirk Pruhs |
| 1997 | Fixing Variables in Semidefinite Relaxations. Christoph Helmberg |
| 1997 | Improved Approximations for Minimum Cardinality Quadrangulations of Finite Element Meshes. Matthias Müller-Hannemann, Karsten Weihe |
| 1997 | Linear-Time Reconstruction of Delaunay Triangulations with Applications. Jack Snoeyink, Marc J. van Kreveld |
| 1997 | Minimum Spanning Trees in Drago Krznaric, Christos Levcopoulos, Bengt J. Nilsson |
| 1997 | On Local Search for Weighted k-Set Packing. Esther M. Arkin, Refael Hassin |
| 1997 | On Piercing Sets of Axis-Parallel Rectangles and Rings. Michael Segal |
| 1997 | On-Line Construction of Two-Dimensional Suffix Trees. Raffaele Giancarlo, Daniela Guaiana |
| 1997 | On-Line Machine Covering. Yossi Azar, Leah Epstein |
| 1997 | Optimal Adaptive Broadcasting with a Bounded Fraction of Faulty Nodes (Extended Abstract). Krzysztof Diks, Andrzej Pelc |
| 1997 | Optimal Reconstruction of Graphs Under the Additive Model. Vladimir Grebinski, Gregory Kucherov |
| 1997 | Quasi-Fully Dynamic Algorithms for Two-Connectivity, Cycle Equivalence and Related Problems. Madhukar R. Korupolu, Vijaya Ramachandran |
| 1997 | Reconstructing the Topology of a CAD Model: A Discrete Approach. Karsten Weihe, Thomas Willhalm |
| 1997 | Relaxed Balance for Search Trees with Local Rebalancing. Kim S. Larsen, Thomas Ottmann, Eljas Soisalon-Soininen |
| 1997 | Scheduling Independent Multiprocessor Tasks. Abdel Krim Amoura, Evripidis Bampis, Claire Kenyon, Yannis Manoussakis |
| 1997 | Scheduling Multiclass Queueing Networks on Parallel Servers: Approximate and Heavy-Traffic Optimality of Klimov's Priority Rule. Kevin D. Glazebrook, José Niño-Mora |
| 1997 | Scheduling-LPs Bear Probabilities: Randomized Approximations for Min-Sum Criteria. Andreas S. Schulz, Martin Skutella |
| 1997 | Seven Problems: So Different yet Close. Sergey V. Sevastianov |
| 1997 | Solving Rectilinear Steiner Tree Problems Exactly in Theory and Practice. Ulrich Fößmeier, Michael Kaufmann |
| 1997 | Test Sets of the Knapsack Problem and Simultaneous Diophantine Approximations. Martin Henk, Robert Weismantel |
| 1997 | Three-Dimensional Meshes are Less Powerful than Two-Dimensional Ones in Oblivious Routing. Kazuo Iwama, Eiji Miyano |
| 1997 | Weighted Graph Separators and Their Applications. Hristo N. Djidjev |