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 32 matches
- 1989
- Jan van Leeuwen:
Graph-Theoretic Concepts in Computer Science, 14th International Workshop, WG '88, Amsterdam, The Netherlands, June 15-17, 1988, Proceedings. Lecture Notes in Computer Science 344, Springer 1989, ISBN 3-540-50728-0 [contents] - 1988
- Stephan Abramowski, Bruno Lang, Heinrich Müller:
Moving Regular k-Gons in Contact. WG 1988: 229-242 - Michel Bauderon:
On Systems of Equations Defining Infinite Graphs. WG 1988: 54-73 - Mark de Berg, Mark H. Overmars:
Dominance in the Presence of Obstracles. WG 1988: 190-201 - Joachim Biskup, Holger Stiefeling:
Transitive Closure Algorithms for Very Large Databases. WG 1988: 122-147 - Hans L. Bodlaender:
NC-Algorithms for Graphs with Small Treewidth. WG 1988: 1-10 - Bruno Courcelle:
The Monadic Second-Order Logic of Graphs: Definable Sets of Finite Graphs. WG 1988: 30-53 - Annegret Habel:
Graph-Theoretic Properties Compatible with Graph Derivations. WG 1988: 11-29 - Pieter H. Hartel:
The Average Size of Ordered Binary Subgraphs. WG 1988: 327-351 - Klaus H. Hinrichs, Jürg Nievergelt, Peter Schorn:
A Sweep Algorithm and its Implementation: The All-Nearest-Neighbors Problem Revisited. WG 1988: 442-457 - Ulrich Huckenbeck:
On Paths in Search or Decision Trees Which Require Almost Worst-Case Time. WG 1988: 406-423 - Sebastian Iwanowski:
Linear Time Algorithms for Testing Approximate Congruence in the Plane. WG 1988: 213-228 - R. Jayakumar, Krishnaiyan Thulasiraman, M. N. S. Swamy:
O(n²) Algorithms for Graph Planarization. WG 1988: 352-377 - Hubert Kaeslin:
Application of Graph Theory to Topology Generation for Logic Gates. WG 1988: 304-316 - Rolf Klein:
Voronoi Diagrams in the Moscow Metric (Extended Abstract). WG 1988: 434-441 - Ephraim Korach, Zvi Ostfeld:
DFS Tree Construction: Algorithms and Characterizations. WG 1988: 87-106 - Andrzej Lingas:
Greedy Triangulation acn be Efficiently Implemented in the Average Case (Extended Abstract). WG 1988: 253-261 - Udo W. Lipeck, Dasu Feng:
Construction of Deterministic Transition Graphs from Dynamic Integrity Constraints. WG 1988: 166-179 - Alberto Marchetti-Spaccamela:
On the Estimate of a Directed Graph. WG 1988: 317-326 - Ernst W. Mayr, C. Greg Plaxton:
On the Spanning Trees of Weighted Graphs. WG 1988: 394-405 - Henk Meijer, R. Dawes:
Fault Tolerant Networks of Specified Diameter. WG 1988: 74-86 - Otto Nurmi, Jörg-Rüdiger Sack:
Separating a Polyhedron by One Translation from a Set of Obstacles (Extended Abstract). WG 1988: 202-212 - Waldemar Preilowski, W. Mumbeck:
A Time-Optimal Parallel Algorithm for the Computing of Voronoi-Diagrams. WG 1988: 424-433 - Nicola Santoro:
(Time × Space)-Efficient Implementations of Hierarchical Conceptual Models. WG 1988: 180-189 - John E. Savage, Markus G. Wloka:
A Parallel Algorithm for Channel Routing. WG 1988: 288-303 - Manfred Schimmler, Heiko Schröder:
A Simple Systolic Method to Find all Bridges of an Undirected Graph. WG 1988: 262-267 - Dietmar Seipel:
A Graph-Based Decomposition Approach for Recursive Query Processing. WG 1988: 148-165 - Iain A. Stewart:
Colouring Perfect Planar Graphs in Parallel. WG 1988: 268-275 - Tadao Takaoka:
An Efficient Parallel Algorithm for the All Pairs Shortest Path Problem. WG 1988: 276-287 - K. Vidyasankar:
Serializable Graphs. WG 1988: 107-121
skipping 2 more matches
loading more results
failed to load more results, please try again later
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-24 17:03 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