default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID9th WG 1983: Haus Ohrbeck (near Osnabrück), Germany
- Manfred Nagl, Jürgen Perl:
Proceedings of the WG '83, International Workshop on Graphtheoretic Concepts in Computer Science, June 16-18, 1983, Haus Ohrbeck, near Osnabrück, Germany. Universitätsverlag Rudolf Trauner, Linz 1984, ISBN 3-853-20311-6 - Giorgio Ausiello, Marco Protasi, Maurizio Talamo:
Probabilistic Models for Database Schemes and Random Hypergraphs. WG 1983: 5-16 - Reuven Bar-Yehuda, Shimon Even:
A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem. WG 1983: 17-28 - M. Bertier, M. Habib:
Contour Extraction Via Path Algorithms. WG 1983: 29-39 - Franz-Josef Brandenburg:
On the Complexity of the Membership Problem of Graph Grammars. WG 1983: 40-49 - Wolfgang Brendel:
Application of Attributed Graph Grammars to VLSI Design. WG 1983: 50-60 - Herbert Edelsbrunner:
Finding Extreme Distances between Convex Polygons. WG 1983: 61-75 - Hartmut Ehrig, Annegret Habel:
Concurrent Transformations of Graphs and Relational Structures. WG 1983: 76-88 - R. Heinonen, Eero Hyvönen:
Interfacing and Transforming Knowledge Bases in a Graph Grammar Based Documentation System. WG 1983: 89-99 - Klaus H. Hinrichs, Jürg Nievergelt:
The Grid File: A Data Structure to Support Proximity Queries on Spatial Objects. WG 1983: 100-113 - Dirk Janssens, Grzegorz Rozenberg:
Neighbourhood-Uniform NLC Grammars. WG 1983: 114-124 - Peter Kandzia:
Relational Data Base Schemas with Functional Dependencies and Objects. WG 1983: 125-135 - Hans-Jörg Kreowski:
Graph Grammar Derivation Processes. WG 1983: 136-150 - Hans-Peter Kriegel:
Performance of Index Structures for Databases. WG 1983: 151-166 - Marek Kubale, E. Kusz:
Computer Experiences with Implicit Enumeration Algorithms for Graph Coloring. WG 1983: 167-176 - Ulrich Lauther, Martin Nett:
Gridless Channelrouting Revisited - a New Formulation of the Problem. WG 1983: 177-183 - Eugene L. Lawler, Michael George Luby, B. Parker:
Finding Shortest Paths in Very Large Networks. WG 1983: 184-199 - Tom Leighton:
Parallel Computation Using Meshes of Trees. WG 1983: 200-218 - Thomas Lengauer:
Efficient Algorithms for the Constraint Generation for Integrated Circuit Layout Compaction. WG 1983: 219-230 - Kurt Mehlhorn, Uzi Vishkin:
Granularity of Memory in Parallel Computation. WG 1983: 231-240 - Burkhard Monien:
The Complexity of Determining Paths of Length k. WG 1983: 241-251 - Heinrich Müller, Stephan Abramowski:
A Combinatorial Rearrangement Problem with Implications to the Embedding of Graphs. WG 1983: 252-262 - Mark H. Overmars:
The Locus Approach. WG 1983: 263-273 - Udo Pletat:
A Language for Software Design and its Graphoriented Semantics. WG 1983: 274-285 - Arnold L. Rosenberg:
Fault-Tolerant Interconnection Networks: A Graph-Theoretic Approach. WG 1983: 286-297 - Detlev Ruland:
Modifications of the Logical Structure of 3NF-Relational Databases. WG 1983: 298-306 - John E. Savage:
Heuristics for Level Graph Embeddings. WG 1983: 307-318 - Hartmut Schmeck:
Flow Graph Grammars and Flow Graph Languages. WG 1983: 319-329 - Hans-Werner Six:
Baer's Weight Balanced Trees are almost Trees of Bounded Balance. WG 1983: 330-341 - Maciej M. Syslo:
NP-Complete Problems on Some Tree-Structured Graphs: a Review. WG 1983: 342-353 - Clark D. Thomborson:
On the Energy-Time-Area Cost of a Memory Access. WG 1983: 354-369 - Frank Wankmüller, U. Wiese:
On Decision Problems for Forbidden Structures. WG 1983: 370-380 - Harry A. G. Wijshoff, J. van Leewen:
Periodic Storage Schemes for Vector Computations. WG 1983: 381-393
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 2024-09-22 23:42 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
