| 1995 | Graph-Theoretical Methods to Construct Entity-Relationship Databases. | Sven Hartmann |
| 1995 | A Compact Data Structure and Parallel Algorithms for Permutation Graphs. | Jens Gustedt, Michel Morvan, Laurent Viennot |
| 1995 | Chordal Graphs and Their Clique Graphs. | Philippe Galinier, Michel Habib, Christophe Paul |
| 1995 | Visualizing Two- and Three-Dimensional Models of Meristematic Growth. | F. David Fracchia |
| 1995 | On Devising Boolean Routing Schemes. | Michele Flammini, Giorgio Gambosi, Sandro Salomone |
| 1995 | The Malleability of TSP_{2Opt}. | Sophie Fischer, Leen Torenvliet |
| 1995 | Planarization of Graphs Embedded on Surfaces. | Hristo N. Djidjev, Shankar M. Venkatesan |
| 1995 | Diametral Path Graphs. | Jitender S. Deogun, Dieter Kratsch |
| 1995 | A Dynamic Algorithm for Line Graph Recognition. | Daniele Giorgio Degiorgi, Klaus Simon |
| 1995 | Incremental Hive Graph. | Fabrizio d'Amore, Roberto Giaccio |
| 1995 | Searching for Faulty Leaves in Binary Trees. | Peter Damaschke |
| 1995 | Efficient Parallel Modular Decomposition (Extended Abstract). | Elias Dahlhaus |
| 1995 | NC Algorithms for Partitioning Planar Graphs into Induced Forests and Approximating NP-Hard Problems. | Zhi-Zhong Chen, Xin He |
| 1995 | Homogeneously Orderable Graphs and the Steiner Tree Problem. | Andreas Brandstdt, Feodor F. Dragan, Falk Nicolai |
| 1995 | Modular Decomposition of Hypergraphs. | Paola Bonizzoni, Gianluca Della Vedova |
| 1995 | On Interval Routing Schemes and Treewidth. | Hans L. Bodlaender, Richard B. Tan, Dimitrios M. Thilikos, Jan van Leeuwen |
| 1995 | Toward a General Theory of Unicast-Based Multicast Communication. | Barbara D. Birchler, Abdol-Hossein Esfahanian, Eric Torng |
| 1995 | A Uniform Approach to Graph Rewriting: The Pullback Approach. | Michel Bauderon |
| 1995 | On the Isomorphism of Graphs with Few P4s. | Luitpold Babel, Stephan Olariu |
| 1995 | Non-Oblivious Local Search for Grpah and Hyperpraph Coloring Problems. | Paola Alimonti |
| 1994 | Using Programmed Graph Rewriting for the Formal Specification of a Configuration Management System. | Bernhard Westfechtel |
| 1994 | Efficient Algorithms for a Mixed k-Partition Problem of Graphs without Specifying Bases. | Koichi Wada, Akinari Takaki, Kimio Kawaguchi |
| 1994 | GLB-Closures in Directed Acyclic Graphs and Their Applications. | Volker Turau, Weimin Chen |
| 1994 | Exponential Time Analysis of Confluent and Boundary eNCE Graph Languages. | Konstantin Skodinis, Egon Wanke |
| 1994 | New Lower Bounds and Hierarchy Results for Restricted Branching Programs. | Detlef Sieling, Ingo Wegener |