Abstract is missing.
- Probabilistic Models for Database Schemes and Random HypergraphsGiorgio Ausiello, Marco Protasi, Maurizio Talamo. 5-16
- A Local-Ratio Theorem for Approximating the Weighted Vertex Cover ProblemReuven Bar-Yehuda, Shimon Even. 17-28
- Contour Extraction Via Path AlgorithmsM. Bertier, M. Habib. 29-39
- On the Complexity of the Membership Problem of Graph GrammarsFranz-Josef Brandenburg. 40-49
- Application of Attributed Graph Grammars to VLSI DesignWolfgang Brendel. 50-60
- Finding Extreme Distances between Convex PolygonsHerbert Edelsbrunner. 61-75
- Concurrent Transformations of Graphs and Relational StructuresHartmut Ehrig, Annegret Habel. 76-88
- Interfacing and Transforming Knowledge Bases in a Graph Grammar Based Documentation SystemR. Heinonen, Eero Hyvönen. 89-99
- The Grid File: A Data Structure to Support Proximity Queries on Spatial ObjectsKlaus Hinrichs, Jürg Nievergelt. 100-113
- Neighbourhood-Uniform NLC GrammarsDirk Janssens, Grzegorz Rozenberg. 114-124
- Relational Data Base Schemas with Functional Dependencies and ObjectsPeter Kandzia. 125-135
- Graph Grammar Derivation ProcessesHans-Jörg Kreowski. 136-150
- Performance of Index Structures for DatabasesHans-Peter Kriegel. 151-166
- Computer Experiences with Implicit Enumeration Algorithms for Graph ColoringMarek Kubale, E. Kusz. 167-176
- Gridless Channelrouting Revisited - a New Formulation of the ProblemUlrich Lauther, Martin Nett. 177-183
- Finding Shortest Paths in Very Large NetworksEugene L. Lawler, Michael George Luby, B. Parker. 184-199
- Parallel Computation Using Meshes of TreesTom Leighton. 200-218
- Efficient Algorithms for the Constraint Generation for Integrated Circuit Layout CompactionThomas Lengauer. 219-230
- Granularity of Memory in Parallel ComputationKurt Mehlhorn, Uzi Vishkin. 231-240
- The Complexity of Determining Paths of Length kBurkhard Monien. 241-251
- A Combinatorial Rearrangement Problem with Implications to the Embedding of GraphsHeinrich Müller, Stephan Abramowski. 252-262
- The Locus ApproachMark H. Overmars. 263-273
- A Language for Software Design and its Graphoriented SemanticsUdo Pletat. 274-285
- Fault-Tolerant Interconnection Networks: A Graph-Theoretic ApproachArnold L. Rosenberg. 286-297
- Modifications of the Logical Structure of 3NF-Relational DatabasesDetlev Ruland. 298-306
- Heuristics for Level Graph EmbeddingsJohn E. Savage. 307-318
- Flow Graph Grammars and Flow Graph LanguagesHartmut Schmeck. 319-329
- Baer's Weight Balanced Trees are almost Trees of Bounded BalanceHans-Werner Six. 330-341
- NP-Complete Problems on Some Tree-Structured Graphs: a ReviewMaciej M. Syslo. 342-353
- On the Energy-Time-Area Cost of a Memory AccessC. D. Thompson. 354-369
- On Decision Problems for Forbidden StructuresFrank Wankmüller, U. Wiese. 370-380
- Periodic Storage Schemes for Vector ComputationsHarry A. G. Wijshoff, J. van Leewen. 381-393