| 1997 | A Measure of Parallelization for the Lexicographically First Maximal Subgraph Problems. Ryuhei Uehara |
| 1997 | A Syntactic Approach to Random Walks on Graphs. Mohamed Mosbah, Nasser Saheb |
| 1997 | Acyclic Orientations for Deadlock Prevention in Interconnection Networks (Extended Abstract). Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes |
| 1997 | Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs. Hajo Broersma, Elias Dahlhaus, Ton Kloks |
| 1997 | An Upper Bound for the Maximum Cut Mean Value. Alberto Bertoni, Paola Campadelli, Roberto Posenato |
| 1997 | Asteroidal Sets in Graphs. Ton Kloks, Dieter Kratsch, Haiko Müller |
| 1997 | Bicliques in Graphs II: Recognizing k-Path Graphs and Underlying Graphs of Line Digraphs. Erich Prisner |
| 1997 | Block Decomposition of Inheritance Hierarchies. Christian Capelle |
| 1997 | Complexity of Colored Graph Covers I. Colored Directed Multigraphs. Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle |
| 1997 | Computational Complexity of the Krausz Dimension of Graphs. Petr Hlinený, Jan Kratochvíl |
| 1997 | Computing the Independence Number of Dense Triangle-Free Graphs. Stephan Brandt |
| 1997 | Gadgets, Approximation, and Linear Programming: Improved Hardness Results for Cut and Satisfiability Problems (Abstract of Invited Lecture). David P. Williamson |
| 1997 | Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, WG '97, Berlin, Germany, June 18-20, 1997, Proceedings Rolf H. Möhring |
| 1997 | Large Networks with Small Diameter. Michael Sampels |
| 1997 | Make your Enemies Transparent. Tanja E. J. Vos, S. Doaitse Swierstra |
| 1997 | Minimal Elimination Ordering Inside a Given Chordal Graph. Elias Dahlhaus |
| 1997 | NP-Completness Results for Minimum Planar Spanners. Ulrik Brandes, Dagmar Handke |
| 1997 | Non-oblivious Local Search for MAX 2-CCSP with Application to MAX DICUT. Paola Alimonti |
| 1997 | Off-Line and On-Line Call-Scheduling in Stars and Trees. Thomas Erlebach, Klaus Jansen |
| 1997 | On Greedy Matching Ordering and Greedy Matchable Graphs (Extended Abstract). Feodor F. Dragan |
| 1997 | On Optimal Graphs Embedded into Path and Rings, with Analysis Using l Yefim Dinitz, Marcelo Feighelstein, Shmuel Zaks |
| 1997 | On the Number of Simple Cycles in Planar Graphs. Helmut Alt, Ulrich Fuchs, Klaus Kriegel |
| 1997 | On the Separable-Homogeneous Decomposition of Graphs (Extended Abstract). Luitpold Babel, Stephan Olariu |
| 1997 | On-Line Algorithms for Networks of Temporal Constraints. Fabrizio d'Amore, Fabio Iacobini |
| 1997 | Optimal Fault-Tolerant ATM-Routings for Biconnected Graphs. Koichi Wada, Wei Chen, Yupin Luo, Kimio Kawaguchi |
| 1997 | Parallel Algorithms for Treewidth Two. Babette de Fluiter, Hans L. Bodlaender |
| 1997 | Pseudo-Hamiltonian Graphs. Luitpold Babel, Gerhard J. Woeginger |
| 1997 | Structured Programs have Small Tree-Width and Good Register Allocation (Extended Abstract). Mikkel Thorup |
| 1997 | The Bounded Tree-Width Problem of Context-Free Graph Languages. Konstantin Skodinis |
| 1997 | Weak-Order Extensions of an Order. Karell Bertet, Jens Gustedt, Michel Morvan |