default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID7th WG 1981: Linz, Austria
- Jörg R. Mühlbacher:
Proceedings of the 7th Conference Graphtheoretic Concepts in Computer Science (WG '81), Linz, Austria, June 15-17, 1981. Hanser, Munich 1982, ISBN 3-446-13538-3, pp. 355 - Hartmut Ehrig, Berthold Hoffmann, Ilse Schmiedecke:
A Graph-Theoretical Model for Multi-Pass Parsing. WG 1981: 19-32 - Manfred Kaul:
Linear Precedence Parsing for a New Class of Graph Grammars. WG 1981: 33-44 - Kurt-Ulrich Witt:
Finite Graph-Automata. WG 1981: 45-54 - Arnold L. Rosenberg:
Three-Dimensional VLSI Layouts. WG 1981: 55-60 - Frank X. Steinparz:
On the Existence of F-Factors. WG 1981: 61-74 - Gottfried Tinhofer:
A Travelling Salesman Problem with Additional Constraints. WG 1981: 75-86 - Jan van Leeuwen, Anneke A. Schoone:
Untangling a Travelling Salesman Tour in the Plane. WG 1981: 87-98 - Hans Röck:
Bus Routing Problems on Acyclic Networks. WG 1981: 99-114 - Helmut Friesdorf, Horst W. Hamacher:
A Negative Circuit Algorithm for Weighted Min Cost Flows. WG 1981: 115-126 - Jürgen Ebert:
Depth-First Search Algorithms for Augmentation Problems. WG 1981: 127-134 - Alfred Schmitt:
Reporting Geometric Inclusions with an Application to the Hidden Line Problem. WG 1981: 135-144 - U. Knitelius, H. Lorenz, J. Perl, H.-J. Schröder:
Description and Simulation of Processes Using Condensed Nets. WG 1981: 145-156 - Herbert Edelsbrunner, David G. Kirkpatrick, Raimund Seidel:
The Shape of a Set of Points in the Plane. WG 1981: 157-162 - Thomas Ottmann, Arnold L. Rosenberg, Hans-Werner Six, Derick Wood:
A Realistic Cost Measure for Binary Search Trees. WG 1981: 163-172 - Mark H. Overmars:
Transforming Semi-Dynamic Data Structures into Dynamic Structures. WG 1981: 173-182 - Shimon Even:
On Protocols for Cake Cutting. WG 1981: 183-194 - R. Heinonen:
A Structural Text Editor Based on Graph Grammars. WG 1981: 195-206 - Georg Lausen:
The Write Fixed Serializability Problem of Interleaved Database Transactions. WG 1981: 207-218 - Carlo Batini, Alessandro D'Atri, Marina Moscarini:
Formal Tools for Top-Down and Bottom-Up Generation of Acyclic Relational Schemata. WG 1981: 219-229 - Susanne E. Hambrusch:
VLSI Algorithms for the Connected Component Problem and its Verification Problem. WG 1981: 231-242 - Rudolf F. Albrecht:
Basic Graphtheoretical Structures for Multi Processor Concepts. WG 1981: 243-252 - Wilhelm Oberaigner:
An Algorithm for the Compilation of Arithmetic Expressions Generating an Associated Tree with Minimal Weighted Height. WG 1981: 253-264 - Kurt Mehlhorn:
Lower Bounds on the Efficiency of Transforming Static Data Structures into Dynamic Structures. WG 1981: 265-278 - Thomas Ottmann, Michael Schrapp:
1-Pass Top-Down Update Schemes for Balanced Search Trees. WG 1981: 279-292 - K. J. Jaquemain:
The Complexity of Constructing Quad-Trees in Arbitrary Dimensions. WG 1981: 293-302 - D. T. Lee, Franco P. Preparata:
Euclidian Shortest Paths in the Presence of Parallel Rectilinear Barriers. WG 1981: 303-314 - Burkhard Monien, Reinald Schulz:
Four Approximation Algorithms for the Feedback Vertex Set Problem. WG 1981: 315-326 - Rupert Gall:
Structured Development of Modular Software Systems: The Module Graph as Central Data Structure. WG 1981: 327-338 - Karl Dürre, Johannes Heuft, Heinrich Müller:
Worst and Best Case Behaviour of an Approximate Graph Coloring Algorithm. WG 1981: 339-348 - Walter Habenicht:
Efficient Routes in Vector-Valued Graphs. WG 1981: 349-
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-03-21 01:24 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:
