12. WG 1986: Bernried, Germany

Specific Algorithms

• Norbert Korte, Rolf H. Möhring:
  A Simple Linear -TIme Algorithm to Recognize Interval Graphs. 1-16
  
• Peter Widmayer:
  An Approximation Algorithms for Steiner's Problem in Graphs. 17-28
  

Graph Grammars

• Manfred Kaul:
  Specification of Error Distances for Graphs by Precedence Graph Grammars and Fast Recognition of Similarity. 29-40
  
• Manfred Jackel:
  ADA Concurrency Specified by Graph Grammars. 41-57
  

Graph Manipulation

• M. Dao, Michel Habib, J. P. Richard, D. Tallot:
  CABRI, An Interactive System for Graph Manipulation. 58-67
  
• Hans Zierer, Gunther Schmidt, Rudolf Berghammer:
  An Interactive Graphical Manipulation System for Higher Order Objects Based on Relational Algebra. 68-81
  

Nets

• Walter Vogler:
  Behaviour Preserving Refinement of Petri Nets. 82-93
  

Complexity Issues

• Ulrich Faigle:
  The Bandwidth of Planar Distributive Lattices. 94-105
  
• Rolf Klein, Derick Wood:
  The Node Visit Cost of Brother Trees. 106-117
  

Algorithmic and Network Considerations

• Stephan Abramowski, Heinrich Müller:
  Searching Connected Components in Very Large Grid Graphs. 118-130
  
• Ramesh Dewangan, C. Pandu Rangan:
  A Simple Implementation of Warshall's Algorithm on a VLSI Chip. 131-145
  

Outerplanar Graphs and Graph Isomorphism

• Maciej M. Syslo:
  On Some Generalizations of Outerplanar Graphs: Results and Open Problems. 146-164
  
• Manfred Wiegers:
  Recognizing Outerplanar Graphs in Linear Time. 165-176
  

Applications in Chemistry

• Ivan Gutman:
  Graphs and Graph Polynomials of interest in Chemistry. 177-187
  

Parallelism and Distributed Systems

• David P. Helmbold, Ernst W. Mayr:
  Applications of Parallel Scheduling to Perfect Graphs. 188-203
  
• Horst Wedde:
  A Graph-Theoretic Approach for Designing Fair Distributed Resource Scheduling Algorithms. 204-226
  

Graphs and Geometry

• Anneke A. Schoone, Hans L. Bodlaender, Jan van Leeuwen:
  Improved Diameter Bounds for Altered Graphs. 227-236
  
• Frank K. H. A. Dehne, Jörg-Rüdiger Sack:
  Seperability of Sets of Polygons. 237-251
  
• Roberto Tamassia, Ioannis G. Tollis:
  Centipede Graphs and Visibility on a Cylinder. 252-263
  

Randomness Considerations

• Paul G. Spirakis:
  The Diameter of Connected Components of Random Graphs. 264-276
  

Specific Problems

• Giuseppe Di Battista, Enrico Nardelli:
  An Algorithm for Testing Planarity of Hierarchical Graphs. 277-289
  
• Detlev Ruland:
  EDM - A Data Model for Electronic CAD/CAM-Applications. 290-305