| 1990 | Deterministic Message Routing in Faulty Hypercubes. | Seshu Madhavapeddy, Ivan Hal Sudborough |
| 1990 | Algebraic Approach to Graph Transformation Based on Single Pushout Derivations. | Michael Lwe, Hartmut Ehrig |
| 1990 | Vertex-Disjoint Trees and Boundary Single-Layer Routing. | Kuo-Feng Liao, Majid Sarrafzadeh |
| 1990 | Bounds on the quality of approximate solutions to the Group Steiner Problem. | Edmund Ihler |
| 1990 | A Generalized Best-First Search Method in Graphs. | Ulrich Huckenbeck, Detlev Ruland |
| 1990 | On the Rectilinear Art Gallery Problem - Algorithmic Aspects. | Frank Hoffmann, Michael Kaufmann |
| 1990 | Remarks on Some Concurrency Measures. | Michel Habib, Michel Morvan, Jean-Xavier Rampon |
| 1990 | The VLSI layout in various embedding models. | Michael Formann, Frank Wagner |
| 1990 | Separation Problems and Circular Arc Systems. | Paul Fischer, Hans Ulrich Simon |
| 1990 | Diagnosis of t/s-Diagnosable Systems. | Anindya Das, Krishnaiyan Thulasiraman |
| 1990 | Induced Subgraph Isomorphism for Cographs in NP-Complete. | Peter Damaschke |
| 1990 | On Complexity of a Message-Routing Strategy for Multicomputer Systems. | Hyeong-Ah Choi, Abdol-Hossein Esfahanian |
| 1990 | On the transition graphs of automata and grammars. | Didier Caucal, Roland Monfort |
| 1990 | On the Complexity of Some Coloring Games. | Hans L. Bodlaender |
| 1990 | Deciding 1-sovability of distributed task is NP-hard. | Ofer Biran, Shlomo Moran, Shmuel Zaks |
| 1990 | Recognizing Binary Hamming Graphs in O(n² log n) Time. | Franz Aurenhammer, Johann Hagauer |
| 1990 | Two Polynomial Problems in PLA Folding. | Claudio Arbib |
| 1989 | On Hyperedge Replacement and BNLC Graph Grammars. | Walter Vogler |
| 1989 | Bounds to the Page Number of Partially Ordered Sets. | Maciej M. Syslo |
| 1989 | On Feedback Problems in Diagraphs. | Ewald Speckenmeyer |
| 1989 | Finding a Minimal Transitive Reduction in a Strongly Connected Digraph within Linear Time. | Klaus Simon |
| 1989 | Introduction to PROGRESS, an Attribute Graph Grammar Based Specification Language. | Andy Schrr |
| 1989 | Describing Distributed Systems by Categorical Graph Grammars. | Hans Jrgen Schneider |
| 1989 | A Fast Sequential and Parallel Algorithm for the Computation of the k-Closure of a Graph. | Ingo Schiermeyer |
| 1989 | CADULA - A Graph-Based Model for Monitoring CAD-Processes. | Detlev Ruland |