| 1997 | Computing the Independence Number of Dense Triangle-Free Graphs. | Stephan Brandt |
| 1997 | NP-Completness Results for Minimum Planar Spanners. | Ulrik Brandes, Dagmar Handke |
| 1997 | An Upper Bound for the Maximum Cut Mean Value. | Alberto Bertoni, Paola Campadelli, Roberto Posenato |
| 1997 | Weak-Order Extensions of an Order. | Karell Bertet, Jens Gustedt, Michel Morvan |
| 1997 | Acyclic Orientations for Deadlock Prevention in Interconnection Networks (Extended Abstract). | Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes |
| 1997 | Pseudo-Hamiltonian Graphs. | Luitpold Babel, Gerhard J. Woeginger |
| 1997 | On the Separable-Homogeneous Decomposition of Graphs (Extended Abstract). | Luitpold Babel, Stephan Olariu |
| 1997 | On the Number of Simple Cycles in Planar Graphs. | Helmut Alt, Ulrich Fuchs, Klaus Kriegel |
| 1997 | Non-oblivious Local Search for MAX 2-CCSP with Application to MAX DICUT. | Paola Alimonti |
| 1996 | Generalized Edge-Ranking of Trees (Extended Abstract). | Xiao Zhou, Mohammod Abul Kashem, Takao Nishizeki |
| 1996 | Hypergraphs and Decision Trees (Abstract). | Andrew Chi-Chih Yao |
| 1996 | Computing Disjoint Path with Lenght Constraints. | Spyros Tragoudas, Yaakov L. Varol |
| 1996 | Shortest Path Algorithms for Nearly Acyclic Directed Graphs. | Tadao Takaoka |
| 1996 | Designing Distance-Preserving Fault-Tolerant Topologies. | Swamy K. Sitarama, Abdol-Hossein Esfahanian |
| 1996 | Independent Spanning Trees of Product Graphs. | Koji Obokata, Yukihiro Iwasaki, Feng Bao, Yoshihide Igarashi |
| 1996 | Homogeneous Sets and Domination Problems. | Falk Nicolai, Thomas Szymczak |
| 1996 | On the Hardness of Allocating Frequencies for Hybrid Networks. | Ewa Malesinska, Alessandro Panconesi |
| 1996 | Modifying Networks to Obtain Low Cost Trees. | Sven Oliver Krumke, Hartmut Noltemeier, Madhav V. Marathe, S. S. Ravi, Kay U. Drangmeister |
| 1996 | The Optimal Cost Chromatic Partition Problem for Trees and Interval Graphs. | Leo G. Kroon, Arunabha Sen, Haiyong Deng, Asim Roy |
| 1996 | Approximate Maxima Finding of Continuous Functions Under Restricted Budget (Extended Abstract). | Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, David Peleg |
| 1996 | One, Two, Three, Many, or: Complexity Aspects of Dynamic Network Flows with Dedicated Arcs. | Bettina Klinz, Gerhard J. Woeginger |
| 1996 | Definability Equals Recognizability of Partial 3-Trees. | Damon Kaller |
| 1996 | Algebraic Graph Derivations for Graphical Calculi. | Wolfram Kahl |
| 1996 | Detecting Diamond Necklaces in Labeled Dags (A Problem from Distributed Debugging). | Michel Hurfin, Michel Raynal |
| 1996 | Switchbox Routing in VLSI Design: Closing the Complexity Gap. | Stephan Hartmann, Markus W. Schffter, Andreas S. Schulz |