| 1991 | Graph-Theoretic Concepts in Computer Science, 16rd International Workshop, WG '90, Berlin, Germany, June 20-22, 1990, Proceedings Rolf H. Möhring |
| 1990 | A Generalized Best-First Search Method in Graphs. Ulrich Huckenbeck, Detlev Ruland |
| 1990 | Algebraic Approach to Graph Transformation Based on Single Pushout Derivations. Michael Löwe, Hartmut Ehrig |
| 1990 | Approximating the minimum net expansion: Near optimal solutions to circuit partitioning problems. Fillia Makedon, Spyros Tragoudas |
| 1990 | Avoiding Matrix Multiplication. Tze-Heng Ma, Jeremy P. Spinrad |
| 1990 | Bounds on the quality of approximate solutions to the Group Steiner Problem. Edmund Ihler |
| 1990 | Comparing the expressibility of two languages formed using NP-complete graph operators. Iain A. Stewart |
| 1990 | Deciding 1-sovability of distributed task is NP-hard. Ofer Biran, Shlomo Moran, Shmuel Zaks |
| 1990 | Decomposition of Linear Recursive Logic Programs. Dietmar Seipel |
| 1990 | Deterministic Message Routing in Faulty Hypercubes. Seshu Madhavapeddy, Ivan Hal Sudborough |
| 1990 | Diagnosis of t/s-Diagnosable Systems. Anindya Das, Krishnaiyan Thulasiraman |
| 1990 | Embeddings of Treelike Graphs into 2-Dimensional Meshes. Peter Zienicke |
| 1990 | Finding Minimally Weighted Subgraphs. Jürgen Plehn, Bernd Voigt |
| 1990 | Genus of Order and Lattices. Klaus Reuter, Ivan Rival |
| 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 Feedback Problems in Planar Digraphs. Hermann Stamm |
| 1990 | On the Complexity of Some Coloring Games. Hans L. Bodlaender |
| 1990 | On the Rectilinear Art Gallery Problem - Algorithmic Aspects. Frank Hoffmann, Michael Kaufmann |
| 1990 | On the transition graphs of automata and grammars. Didier Caucal, Roland Monfort |
| 1990 | Optimal Parallel Algorithms for Sparse Graphs. Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis |
| 1990 | Recognizing Binary Hamming Graphs in O(n² log n) Time. Franz Aurenhammer, Johann Hagauer |
| 1990 | Remarks on Some Concurrency Measures. Michel Habib, Michel Morvan, Jean-Xavier Rampon |
| 1990 | Separation Problems and Circular Arc Systems. Paul Fischer, Hans Ulrich Simon |
| 1990 | The VLSI layout in various embedding models. Michael Formann, Frank Wagner |
| 1990 | Two Polynomial Problems in PLA Folding. Claudio Arbib |
| 1990 | Vertex-Disjoint Trees and Boundary Single-Layer Routing. Kuo-Feng Liao, Majid Sarrafzadeh |