Остановите войну!
for scientists:
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 36 matches
- 1994
- Jan van Leeuwen:
Graph-Theoretic Concepts in Computer Science, 19th International Workshop, WG '93, Utrecht, The Netherlands, June 16-18, 1993, Proceedings. Lecture Notes in Computer Science 790, Springer 1994, ISBN 3-540-57899-4 [contents] - 1993
- Paola Alimonti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Xavier Messeguer:
Average Case Analysis of Fully Dynamic Connectivity for Directed Graphs. WG 1993: 87-98 - Hans L. Bodlaender:
On Reduction Algorithms for Graphs with Small Treewidth. WG 1993: 45-56 - Hans L. Bodlaender:
Dynamic Algorithms for Graphs with Treewidth 2. WG 1993: 112-124 - Jacques E. Boillat:
Fast Load Balancing in Cayley Graphs and in Circuits. WG 1993: 315-326 - Andreas Brandstädt, Feodor F. Dragan, Victor Chepoi, Vitaly I. Voloshin:
Dually Chordal Graphs. WG 1993: 237-251 - Andreas Brandstädt, Heinz-Jürgen Voss:
Short Disjoint Cycles in Graphs with Degree Constraints. WG 1993: 125-131 - Jianer Chen, Saroja P. Kanchi:
Graph Ear Decompositions and Graph Embeddings (Extended Abstract). WG 1993: 376-387 - Derek G. Corneil, Stephan Olariu, Lorna Stewart:
Asteroidal Triple-Free Graphs. WG 1993: 211-224 - Elias Dahlhaus:
The Parallel Complexity of Elimination Ordering Procedures. WG 1993: 225-236 - Jörg Desel:
Regular Marked Petri Nets. WG 1993: 264-275 - Javier Esparza, Bernhard von Stengel:
The Asynchronous Committee Meeting Problem. WG 1993: 276-287 - Martin Charles Golumbic, Haim Kaplan, Ron Shamir:
Algorithms and Complexity of Sandwich Problems in Graphs (Extended Abstract). WG 1993: 57-69 - S. Haldar:
An 'All Pairs Shortest Path' Distributed Algorithm Using 2n² Messages. WG 1993: 350-363 - George Havas, Bohdan S. Majewski, Nicholas C. Wormald, Zbigniew J. Czech:
Graphs, Hypergraphs and Hashing. WG 1993: 153-165 - N. W. Holloway, Somasundaram Ravindran, Alan Gibbons:
Approximating Minimum Weight Perfect Matchings for Complete Graphs Satisfying the Triangle Inequality. WG 1993: 11-20 - Juraj Hromkovic, Ralf Klasing, Elena Stöhr:
Gossiping in Vertex-Disjoint Path Mode in Interconnection Networks. WG 1993: 288-300 - Zoran Ivkovic, Errol L. Lloyd:
Fully Dynamic Maintenance of Vertex Cover. WG 1993: 99-111 - Klaus Jansen:
A Rainbow About T-Colorings for Complete Graphs. WG 1993: 189-199 - Goos Kant:
A More Compact Visibility Representation. WG 1993: 411-424 - Goos Kant, Xin He:
Two Algorithms for Finding Rectangular Duals of Planar Graphs. WG 1993: 396-410 - Evangelos Kranakis, Danny Krizanc, S. S. Ravi:
On Multi-Label Linear Interval Routing Schemes (Extended Abstract). WG 1993: 338-349 - Ludek Kucera:
Coloring k-Colorable Graphs in Constant Expected Parallel Time. WG 1993: 166-176 - Nai-Wei Lin:
Approximating the Chromatic Polynomial of a Graph. WG 1993: 200-210 - Zbigniew Lonc:
Toward a Solution of the Holyer's Problem. WG 1993: 144-152 - Madhav V. Marathe, Venkatesh Radhakrishnan, Harry B. Hunt III, S. S. Ravi:
Hierarchical Specified Unit Disk Graphs (Extended Abstract). WG 1993: 21-32 - Alberto Marchetti-Spaccamela, Umberto Nanni, Hans Rohnert:
On-line Graph Algorithms for Incremental Compilation. WG 1993: 70-86 - Koji Nakano:
Linear Layouts of Generalized Hypercubes. WG 1993: 364-375 - Sotiris E. Nikoletseas, Paul G. Spirakis:
Near-Optimal Dominating Sets in Dense Random Graphs in Polynomial Expected Time. WG 1993: 1-10 - Sabine R. Öhring, Sajal K. Das:
The Folded Petersen Network: A New Versatile Multiprocessor Interconnection Topology. WG 1993: 301-314
skipping 6 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-05-02 19:39 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