default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID8th WG 1982: Neuenkirchen (near Erlangen), Germany
- Hans Jürgen Schneider, Herbert Göttler:
Proceedings of the 8th Conference Graphtheoretic Concepts in Computer Science (WG '82), Neuenkirchen (near Erlangen), Germany. Hanser, Munich 1983, ISBN 3-446-13778-5, pp. 280 - Rudolf Berghammer, Gunther Schmidt:
A Relational View on Gotos and Dynamic Logic. WG 1982: 13-24 - Peter Brucker:
Network Flows in Trees and Knapsack Problems with Nested Constraints. WG 1982: 25-36 - J. Ebert:
A Linear Disjoint Path Algorithm. WG 1982: 37-46 - Gregor Engels, Wilhelm Schäfer:
Specification of a Programming Support Environment by Graph Grammars. WG 1982: 47-62 - Herbert Göttler, A. Völk:
A Language for Linearizing Graphics. WG 1982: 63-78 - Horst W. Hamacher:
K Best Cuts in Planar and Nonplanar Networks. WG 1982: 79-90 - Dirk Janssens, Hans-Jörg Kreowski, Grzegorz Rozenberg, Hartmut Ehrig:
Concurrency of Node-Label-Controlled Graph Transformations. WG 1982: 91-108 - Hans-Peter Kriegel:
Variants of Multidimensional B-Trees as Dynamic Index Structures for Associative Retrieval in Database Systems. WG 1982: 109-128 - Reinhard Laue:
Decomposing Data for Comparison in Systolic (VLSI) Arrays. WG 1982: 129-136 - Georg Lausen:
On Concurrency Control in Shared B-Trees. WG 1982: 137-150 - Thomas Lengauer:
On the Solution of Inequality Systems Relevant to IC-Layout. WG 1982: 151-164 - Bernd Mahr, Anne Wilharm:
Graph Grammars as a Tool for Description in Computer Processed Control: A Case Study. WG 1982: 165-176 - Ulrich Möncke, Reinhard Wilhelm:
Iterative Algorithms on Grammar Graphs. WG 1982: 177-194 - Burkhard Monien:
The Complexity of Determing a Shortest Cycle of Even Length. WG 1982: 195-208 - H. Müller:
The Complexity of the Vertex Coloring Problem on Hierarchies of Sparse Graphs. WG 1982: 209-224 - Mark H. Overmars:
Lowerbounds and Upperbounds on VLSI-Layouts for Perfect Binary Trees. WG 1982: 225-232 - Hans Röck:
Flowshop Scheduling with no Wait in Process on Three Machines. WG 1982: 233-250 - Gunther Schmidt, Thomas Ströhlein:
Kernels in Bipartite Graphs. WG 1982: 251-256 - Alfred Schmitt:
Reporting Intersections of Line Segments: An Improvement of the Ottmann-Bentley Algorithm. WG 1982: 257-266 - Oliver Vornberger:
The Separation Problem. WG 1982: 267-280
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 2025-01-24 17:18 CET 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
