default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID6. WG 1980: Bad Honnef, Germany
- Hartmut Noltemeier:
Graphtheoretic Concepts in Computer Science, Proceedings of the International Workshop WG '80, Bad Honnef, Germany, June 15-18, 1980. Lecture Notes in Computer Science 100, Springer 1981, ISBN 3-540-10291-4 - Hermann A. Maurer:
The Post-Office Problem and Related Questions. 1-19 - Hidenosuke Nishio:
Series of Graphs Generated by Rational Machines. 20-31 - Kurt-Ulrich Witt:
On Linearizing Graphs. 32-41 - Hans Jürgen Schneider:
Set-Theoretic Concepts in Programming Languages and their Implementation. 42-54 - Manfred Nagl
:
Graph Rewriting and Automatic, Machine-Independent Program Optimization. 55-69 - Helmut J. Ludwigs:
Properties of Ordered Graph Grammars. 70-79 - Jon Louis Bentley, Thomas Ottmann:
The Power of a One-Dimensional Vector of Processors. 80-89 - Kurt Mehlhorn:
A New Data Structure for Representing Sorted Lists. 90-112 - Gottfried Tinhofer:
On the Use of Some Almost Sure Graph Properties. 113-126 - Hartmut Noltemeier:
On a Generalization of Heaps. 127-136 - Manfred Schnitzler:
Graph Grammars and the Complexity Gap in the Isomorphism Problem for Acyclic Digraphs. 137-149 - Arnold L. Rosenberg:
Issues in the Study of Graph Embeddings. 150-176 - Carlo Batini, Alessandro D'Atri:
Schema Hypergraphs: A Formalism to Investigate Logical Data Base Design. 177-194 - Peter Kandzia, Margret Mangelmann:
The Use of Transitively Irreducible Kernels of Full Families of Functional Dependencies in Logical Data Base Design. 195-211 - Giorgio Ausiello, Alessandro D'Atri, Domenico Saccà:
Graph Algorithms for the Synthesis and Manipulation of Data Base Schemes. 212-233 - Thomas Ottmann, Hans-Werner Six, Derick Wood:
The Analysis of Search Trees: A Survey. 234-249 - Hans-Werner Six:
A Framework for Data Structures. 250-267 - Gunther Schmidt:
Investigating Programs in Terms of Partial Graphs. 268-269 - Shimon Even, Yacov Yacobi:
An Observation Concerning the Complexity of Problems with Few Solutions and its Application to Cryptography. 270-278 - Burkhard Monien, Ivan Hal Sudborough:
Bounding the Bandwidth of NP-Complete Problems. 279-292 - Ivan Hal Sudborough:
The Complexity of Path Problems in Graphs and Path Systems of Bounded Bandwidth. 293-305 - Hans-Jörg Kreowski:
A Comparison Between Petri-Nets and Graph Grammars. 306-317 - Wolfgang Reisig:
A Graph Grammar Representation of Non-Sequential Processes. 318-325 - Jürgen Ebert, Jürgen Perl:
Reachablity Homomorphisms on Nets. 326-334 - Bernd Mahr:
A Birds Eye View to Path Problems. 335-353 - Peter Brucker:
The Chinese Postman Problem for Mixed Graphs. 354-366 - Oliver Vornberger:
Alternative Cycle Covers and Paths. 367-378 - Peter Läuchli:
Generating All Planar 0-, 1-, 2-, 3-Connected Graphs. 379-382 - Horst W. Hamacher:
Optimal (s, t)-Cuts (Extended Abstract). 383-387 - Ulrich Derigs:
F-Factors, Perfect Matchings and Related Concepts. 388-403
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-07-29 23:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
