| 1997 | Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, WG '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings Fabrizio d'Amore, Paolo Giulio Franciosa, Alberto Marchetti-Spaccamela |
| 1996 | A New Characterization of P4-connected Graphs. Luitpold Babel, Stephan Olariu |
| 1996 | Algebraic Graph Derivations for Graphical Calculi. Wolfram Kahl |
| 1996 | Approximate Maxima Finding of Continuous Functions Under Restricted Budget (Extended Abstract). Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, David Peleg |
| 1996 | Clique and Anticlique Partition of Graphs. Krzysztof Brys, Zbigniew Lonc |
| 1996 | Closure Properties of Context-Tree Hyperedge Replacement Systems. Ornella Ciotti, Francesco Parisi-Presicce |
| 1996 | Computing Disjoint Path with Lenght Constraints. Spyros Tragoudas, Yaakov L. Varol |
| 1996 | Counting Edges in a Dag. Serafino Cicerone, Daniele Frigioni, Umberto Nanni, Francesco Pugliese |
| 1996 | Definability Equals Recognizability of Partial 3-Trees. Damon Kaller |
| 1996 | Designing Distance-Preserving Fault-Tolerant Topologies. Swamy K. Sitarama, Abdol-Hossein Esfahanian |
| 1996 | Detecting Diamond Necklaces in Labeled Dags (A Problem from Distributed Debugging). Michel Hurfin, Michel Raynal |
| 1996 | Efficient Union-Find for Planar Graphs and other Sparse Graph Classes (Extended Abstract). Jens Gustedt |
| 1996 | Embedding Complete Binary Trees in Product Graphs. Adrienne L. Broadwater, Kemal Efe, Antonio Fernández |
| 1996 | Generalized Edge-Ranking of Trees (Extended Abstract). Xiao Zhou, Mohammod Abul Kashem, Takao Nishizeki |
| 1996 | Homogeneous Sets and Domination Problems. Falk Nicolai, Thomas Szymczak |
| 1996 | Hypergraphs and Decision Trees (Abstract). Andrew Chi-Chih Yao |
| 1996 | Improved Approximations of Independent Dominating Set in Bounded Degree Graphs. Paola Alimonti, Tiziana Calamoneri |
| 1996 | Independent Spanning Trees of Product Graphs. Koji Obokata, Yukihiro Iwasaki, Feng Bao, Yoshihide Igarashi |
| 1996 | LexBFS-Orderings and Power of Graphs. Feodor F. Dragan, Falk Nicolai, Andreas Brandstädt |
| 1996 | Modifying Networks to Obtain Low Cost Trees. Sven Oliver Krumke, Hartmut Noltemeier, Madhav V. Marathe, S. S. Ravi, Kay U. Drangmeister |
| 1996 | More General Parallel Tree Contraction: Register Allocation and Broadcasting in a Tree. Krzysztof Diks, Torben Hagerup |
| 1996 | Node Rewriting in Hypergraphs. Michel Bauderon, Hélène Jacquet |
| 1996 | On k-Partitioning the n-Cube. Sergei L. Bezrukov |
| 1996 | On the Hardness of Allocating Frequencies for Hybrid Networks. Ewa Malesinska, Alessandro Panconesi |
| 1996 | On-Line Algorithms for Shortest Path Problems on Planar Digraphs. Hristo N. Djidjev |
| 1996 | One, Two, Three, Many, or: Complexity Aspects of Dynamic Network Flows with Dedicated Arcs. Bettina Klinz, Gerhard J. Woeginger |
| 1996 | Optimal Parallel Routing in Star Graphs. Chi-Chang Chen, Jianer Chen |
| 1996 | Shortest Path Algorithms for Nearly Acyclic Directed Graphs. Tadao Takaoka |
| 1996 | Switchbox Routing in VLSI Design: Closing the Complexity Gap. Stephan Hartmann, Markus W. Schäffter, Andreas S. Schulz |
| 1996 | System Diagnosis with Smallest Risk of Error. Krzysztof Diks, Andrzej Pelc |
| 1996 | The Optimal Cost Chromatic Partition Problem for Trees and Interval Graphs. Leo G. Kroon, Arunabha Sen, Haiyong Deng, Asim Roy |
| 1996 | Upward Drawings of Search Trees (Extended Abstract). Pierluigi Crescenzi, Paolo Penna |