6. WG 1980: Bad Honnef, Germany

@proceedings{DBLP:conf/wg/1980,
  editor    = {Hartmut Noltemeier},
  title     = {Graphtheoretic Concepts in Computer Science, Proceedings of the
               International Workshop WG '80, Bad Honnef, Germany, June 15-18,
               1980},
  booktitle = {WG},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {100},
  year      = {1981},
  isbn      = {3-540-10291-4},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• Hermann A. Maurer: The Post-Office Problem and Related Questions. 1-19 BibTeX
• Hidenosuke Nishio: Series of Graphs Generated by Rational Machines. 20-31 BibTeX
• Kurt-Ulrich Witt: On Linearizing Graphs. 32-41 BibTeX
• Hans Jürgen Schneider: Set-Theoretic Concepts in Programming Languages and their Implementation. 42-54 BibTeX
• Manfred Nagl: Graph Rewriting and Automatic, Machine-Independent Program Optimization. 55-69 BibTeX
• Helmut J. Ludwigs: Properties of Ordered Graph Grammars. 70-79 BibTeX
• Jon Louis Bentley, Thomas Ottmann: The Power of a One-Dimensional Vector of Processors. 80-89 BibTeX
• Kurt Mehlhorn: A New Data Structure for Representing Sorted Lists. 90-112 BibTeX
• Gottfried Tinhofer: On the Use of Some Almost Sure Graph Properties. 113-126 BibTeX
• Hartmut Noltemeier: On a Generalization of Heaps. 127-136 BibTeX
• Manfred Schnitzler: Graph Grammars and the Complexity Gap in the Isomorphism Problem for Acyclic Digraphs. 137-149 BibTeX
• Arnold L. Rosenberg: Issues in the Study of Graph Embeddings. 150-176 BibTeX
• Carlo Batini, Alessandro D'Atri: Schema Hypergraphs: A Formalism to Investigate Logical Data Base Design. 177-194 BibTeX
• Peter Kandzia, Margret Mangelmann: The Use of Transitively Irreducible Kernels of Full Families of Functional Dependencies in Logical Data Base Design. 195-211 BibTeX
• Giorgio Ausiello, Alessandro D'Atri: Graph Algorithms for the Synthesis and Manipulation of Data Base Schemes. 212-233 BibTeX
• Thomas Ottmann, Hans-Werner Six, Derick Wood: The Analysis of Search Trees: A Survey. 234-249 BibTeX
• Hans-Werner Six: A Framework for Data Structures. 250-267 BibTeX
• Gunther Schmidt: Investigating Programs in Terms of Partial Graphs. 268-269 BibTeX
• Shimon Even, Yacov Yacobi: An Observation Concerning the Complexity of Problems with Few Solutions and its Application to Cryptography. 270-278 BibTeX
• Burkhard Monien: Bounding the Bandwidth of NP-Complete Problems. 279-292 BibTeX
• Ivan Hal Sudborough: The Complexity of Path Problems in Graphs and Path Systems of Bounded Bandwidth. 293-305 BibTeX
• Hans-Jörg Kreowski: A Comparison Between Petri-Nets and Graph Grammars. 306-317 BibTeX
• Wolfgang Reisig: A Graph Grammar Representation of Non-Sequential Processes. 318-325 BibTeX
• Jürgen Ebert, Jürgen Perl: Reachablity Homomorphisms on Nets. 326-334 BibTeX
• Bernd Mahr: A Birds Eye View to Path Problems. 335-353 BibTeX
• Peter Brucker: The Chinese Postman Problem for Mixed Graphs. 354-366 BibTeX
• Oliver Vornberger: Alternative Cycle Covers and Paths. 367-378 BibTeX
• Peter Läuchli: Generating All Planar 0-, 1-, 2-, 3-Connected Graphs. 379-382 BibTeX
• Horst W. Hamacher: Optimal (s, t)-Cuts (Extended Abstract). 383-387 BibTeX
• Ulrich Derigs: F-Factors, Perfect Matchings and Related Concepts. 388-403 BibTeX