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 30 matches
- 1993
- Ernst W. Mayr:
Graph-Theoretic Concepts in Computer Science, 18th International Workshop, WG '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings. Lecture Notes in Computer Science 657, Springer 1993, ISBN 3-540-56402-0 [contents] - 1992
- Paola Alimonti, Esteban Feuerstein:
Petri Nets, Hypergraphs and Conflicts (Preliminary Version). WG 1992: 293-309 - Dinesh Bhatia, Frank Thomson Leighton, Fillia Makedon, Carolyn Haibt Norton:
Improved Algorithms for Routing on Two-Dimensional Grids. WG 1992: 114-122 - Hans L. Bodlaender:
Kayles on Special Classes of Graphs - An Application of Sprague-Grundy Theory. WG 1992: 90-102 - Hans L. Bodlaender, Klaus Jansen, Gerhard J. Woeginger:
Scheduling with Incompatible Jobs. WG 1992: 37-49 - Andreas Brandstädt:
On Improved Time Bounds for Permutation Graph Problems. WG 1992: 1-10 - Jianer Chen:
A Linear Time Algorithm for Isomorphism of Graphs of Bounded Average Genus. WG 1992: 103-113 - Jianer Chen, Arkady Kanevsky:
On Assembly of Four-Connected Graphs (Extended Abstract). WG 1992: 158-169 - Alain Cournier, Michel Habib:
An Efficient Algorithm to Recognize Prime Undirected Graphs. WG 1992: 212-224 - Elias Dahlhaus:
Optimal (Parallel) Algorithms for the All-to-All Vertices Distance Problem for Certain Graph Classes. WG 1992: 60-69 - Sajal K. Das, Aisheng Mao:
Embeddings in Recursive Combinatorial Networks. WG 1992: 184-204 - Yefim Dinitz:
The 3-Edge-Components and a Structural Description of All 3-Edge-Cuts in a Graph. WG 1992: 145-157 - Martin Erwig:
Graph Algorithms = Iteration + Data Structures? The Structure of Graph Algorithms and a Corresponding Style of Programming. WG 1992: 277-292 - Stefan Felsner:
Tolerance Graphs and Orders. WG 1992: 17-26 - Stefan Felsner, Dorothea Wagner:
On the Complexity of Partial Order Properties. WG 1992: 225-235 - Jordan Gergov, Christoph Meinel:
Analysis and Manipulation of Boolean Functions in Terms of Decision Graphs. WG 1992: 310-320 - Ornan Ori Gerstel, Shmuel Zaks:
A New Characterization of Tree Medians with Applications to Distributed Algorithms. WG 1992: 135-144 - Juraj Hromkovic:
Topology of Parallel Networks and Computational Complexity (Extended Abstract). WG 1992: 70-77 - Wen-Lian Hsu:
A Simple Test for Interval Graphs. WG 1992: 11-16 - Edmund Ihler:
Minimum Rectilinear Steiner Tree for Intervals on two Parallel Lines. WG 1992: 123-134 - Beverly Jamison, Stephan Olariu:
On the Homogeneous Decomposition of Graphs. WG 1992: 170-183 - Klaus Jansen:
On Scheduling Problems Restricted to Interval Orders. WG 1992: 27-36 - Klaus Jansen, Petra Scheffler:
Generalized Coloring for Tree-like Graphs. WG 1992: 50-59 - Goos Kant:
Hexagonal Grid Drawings. WG 1992: 263-276 - Igor Litovsky, Yves Métivier, Wieslaw Zielonka:
The Power and the Limitations of Local Computations on Graphs. WG 1992: 333-345 - Mohamed Mosbah:
Probabilistic Graph Grammars. WG 1992: 236-247 - Una-May O'Reilly, Nicola Santoro:
The Expressiveness of Silence: Tight Bounds for Synchronous Communication of Information Using Bits and Silence. WG 1992: 321-332 - Francesco Parisi-Presicce:
Single vs. Double Pushout Derivations of Graphs. WG 1992: 248-262 - Waldemar Preilowski:
Parallel Triangulation of Nonconvex Polytopes. WG 1992: 78-89 - Mikkel Thorup:
On Shortcutting Digraphs. WG 1992: 205-211
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-10-22 07:11 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