![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 27 matches
- 1990
- Manfred Nagl
:
Graph-Theoretic Concepts in Computer Science, 15th International Workshop, WG '89, Castle Rolduc, The Netherlands, June 14-16, 1989, Proceedings. Lecture Notes in Computer Science 411, Springer 1990, ISBN 3-540-52292-1 [contents] - 1989
- Richard Anderson, Simon Kahan, Martine D. F. Schlag:
An O(n log n) Algorithm for 1-D Tile Compaction. WG 1989: 287-301 - Michel Billaud, Pierre Lafon, Yves Métivier, Éric Sopena:
Graph Rewriting Systems with Priorities. WG 1989: 94-106 - Hans L. Bodlaender
:
Improved Self-Reduction Algorithms for Graphs with Bounded Treewidth. WG 1989: 232-244 - Franz-Josef Brandenburg:
On the Complexity of Optimal Drawings of Graphs. WG 1989: 166-180 - Horst Bunke, B. Haller:
A Parser for Context Free Plex Grammars. WG 1989: 136-150 - Renato M. Capocelli, Luisa Gargano
, Ugo Vaccaro:
Time Bound for Broadcasting in Bounded Degree Graphs. WG 1989: 19-33 - Anindya Das, Krishnaiyan Thulasiraman, Vinod K. Agarwal, K. B. Lakshmanan:
t/s-Diagnosable Systems: A Characterization and Diagnosis Algorithm. WG 1989: 34-45 - Frank K. H. A. Dehne, Andrew Rau-Chaplin
:
Implementing Data Structures on a Hypercube Multiprocessor, and Applications in Parallel Computational Geometry. WG 1989: 316-329 - Robert Y. Geva, Azaria Paz:
Toward a Complete Representation of Graphoids in Graphs (Abridged Version). WG 1989: 46-62 - Annegret Habel, Hans-Jörg Kreowski:
Filtering Hyperedge-Replacement Through Compatible Properties. WG 1989: 107-120 - Andreas Henrich, Hans-Werner Six, Peter Widmayer:
Paging Binary Trees with External Balancing. WG 1989: 260-276 - Rolf Klein:
Combinatorial Properties of Abstract Voronoi Diagrams. WG 1989: 356-369 - Marc J. van Kreveld, Mark de Berg:
Finding Squares and Rectangles in Sets of Points. WG 1989: 341-355 - Antoni Lozano, José L. Balcázar:
The Complexity of Graph Problems fore Succinctly Represented Graphs. WG 1989: 277-286 - Seshu Madhavapeddy, Ivan Hal Sudborough:
Disjoint Paths in the Hypercube. WG 1989: 3-18 - Knut Menzel, Burkhard Monien:
WEighted Parallel Triangulation of Simple Polygons. WG 1989: 302-315 - Gabriele Reich, Peter Widmayer:
Beyond Steiner's Problem: A VLSI Oriented Generalization. WG 1989: 196-210 - Thomas Roos:
k-Nearest-Neighbor Voronoi Diagrams for Sets of Convex Polygons, Line Segments and Points. WG 1989: 330-340 - Detlev Ruland:
CADULA - A Graph-Based Model for Monitoring CAD-Processes. WG 1989: 63-72 - Ingo Schiermeyer:
A Fast Sequential and Parallel Algorithm for the Computation of the k-Closure of a Graph. WG 1989: 211-217 - Hans Jürgen Schneider:
Describing Distributed Systems by Categorical Graph Grammars. WG 1989: 121-135 - Andy Schürr:
Introduction to PROGRESS, an Attribute Graph Grammar Based Specification Language. WG 1989: 151-165 - Klaus Simon:
Finding a Minimal Transitive Reduction in a Strongly Connected Digraph within Linear Time. WG 1989: 245-259 - Ewald Speckenmeyer:
On Feedback Problems in Diagraphs. WG 1989: 218-231 - Maciej M. Syslo:
Bounds to the Page Number of Partially Ordered Sets. WG 1989: 181-195 - Walter Vogler:
On Hyperedge Replacement and BNLC Graph Grammars. WG 1989: 78-93
loading more results
failed to load more results, please try again later
![](https://dblp.org/img/cog.dark.24x24.png)
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-09-04 02:51 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint