| 1998 | Graphs with Bounded Induced Distance. | Serafino Cicerone, Gabriele Di Stefano |
| 1998 | A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking. | Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Mller |
| 1998 | Communication in the Two-Way Listen-in Vertex-disjoint Paths Mode. | Hans-Joachim Bckenhauer |
| 1998 | Drawing Planar Partitions II: HH-Drawings. | Therese Biedl, Michael Kaufmann, Petra Mutzel |
| 1998 | Domination and Steiner Tree Problems on Graphs with Few P4S. | Luitpold Babel, Stephan Olariu |
| 1997 | Gadgets, Approximation, and Linear Programming: Improved Hardness Results for Cut and Satisfiability Problems (Abstract of Invited Lecture). | David P. Williamson |
| 1997 | Optimal Fault-Tolerant ATM-Routings for Biconnected Graphs. | Koichi Wada, Wei Chen, Yupin Luo, Kimio Kawaguchi |
| 1997 | Make your Enemies Transparent. | Tanja E. J. Vos, S. Doaitse Swierstra |
| 1997 | A Measure of Parallelization for the Lexicographically First Maximal Subgraph Problems. | Ryuhei Uehara |
| 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 | Large Networks with Small Diameter. | Michael Sampels |
| 1997 | Bicliques in Graphs II: Recognizing k-Path Graphs and Underlying Graphs of Line Digraphs. | Erich Prisner |
| 1997 | A Syntactic Approach to Random Walks on Graphs. | Mohamed Mosbah, Nasser Saheb |
| 1997 | Complexity of Colored Graph Covers I. Colored Directed Multigraphs. | Jan Kratochvl, Andrzej Proskurowski, Jan Arne Telle |
| 1997 | Asteroidal Sets in Graphs. | Ton Kloks, Dieter Kratsch, Haiko Mller |
| 1997 | Computational Complexity of the Krausz Dimension of Graphs. | Petr Hlinen, Jan Kratochvl |
| 1997 | Parallel Algorithms for Treewidth Two. | Babette de Fluiter, Hans L. Bodlaender |
| 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-Line Algorithms for Networks of Temporal Constraints. | Fabrizio d'Amore, Fabio Iacobini |
| 1997 | Minimal Elimination Ordering Inside a Given Chordal Graph. | Elias Dahlhaus |
| 1997 | Block Decomposition of Inheritance Hierarchies. | Christian Capelle |
| 1997 | Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs. | Hajo Broersma, Elias Dahlhaus, Ton Kloks |