Остановите войну!
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 31 matches
- 2010
- Christophe Paul, Michel Habib:
Graph-Theoretic Concepts in Computer Science, 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009. Revised Papers. Lecture Notes in Computer Science 5911, 2010, ISBN 978-3-642-11408-3 [contents] - 2009
- Ilya Averbouch, Johann A. Makowsky, Peter Tittmann:
A Graph Polynomial Arising from Community Structure (Extended Abstract). WG 2009: 33-43 - Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma:
Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs. WG 2009: 44-53 - Gruia Calinescu, Cristina G. Fernandes, Hemanshu Kaul:
Maximum Series-Parallel Subgraph. WG 2009: 54-65 - Shiri Chechik, David Peleg:
Low-Port Tree Representations. WG 2009: 66-76 - Christophe Crespelle:
Fully Dynamic Representations of Interval Graphs. WG 2009: 77-87 - Zdenek Dvorák, Daniel Král:
Algorithms for Classes of Graphs with Bounded Expansion. WG 2009: 17-32 - David Eppstein:
Graph-Theoretic Solutions to Computational Geometry Problems. WG 2009: 1-16 - Michael R. Fellows, Jiong Guo, Iyad A. Kanj:
The Parameterized Complexity of Some Minimum Label Problems. WG 2009: 88-99 - Henning Fernau, Serge Gaspers, Daniel Raible:
Exact and Parameterized Algorithms for Max Internal Spanning Tree. WG 2009: 100-111 - Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh:
An Exact Algorithm for Minimum Distortion Embedding. WG 2009: 112-121 - Rajiv Gandhi, Bradford Greening, Sriram V. Pemmaraju, Rajiv Raman:
Sub-coloring and Hypo-coloring Interval Graphs. WG 2009: 122-132 - Petr A. Golovach, Jan Kratochvíl, Ondrej Suchý:
Parameterized Complexity of Generalized Domination Problems. WG 2009: 133-142 - Alexander Grigoriev, René Sitters:
Connected Feedback Vertex Set in Planar Graphs. WG 2009: 143-153 - Stéphane Grumbach, Zhilin Wu:
Logical Locality Entails Frugal Distributed Computation over Graphs (Extended Abstract). WG 2009: 154-165 - Frank Gurski, Egon Wanke:
On Module-Composed Graphs. WG 2009: 166-177 - Torben Hagerup:
An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees. WG 2009: 178-189 - Pim van 't Hof, Marcin Kaminski, Daniël Paulusma:
Finding Induced Paths of Given Parity in Claw-Free Graphs. WG 2009: 341-352 - Frank Kammer, Torsten Tholey:
The k-Disjoint Paths Problem on Chordal Graphs. WG 2009: 190-201 - Iyad A. Kanj, Andreas Wiese, Fenghui Zhang:
Local Algorithms for Edge Colorings in UDGs. WG 2009: 202-213 - Mamadou Moustapha Kanté, Michaël Rao:
Directed Rank-Width and Displit Decomposition. WG 2009: 214-225 - Bastian Katz, Ignaz Rutter, Gerhard J. Woeginger:
An Algorithmic Study of Switch Graphs. WG 2009: 226-237 - Stephan Kreutzer, Sebastian Ordyniak:
Distance d-Domination Games. WG 2009: 308-319 - Van Bang Le, Nguyen Ngoc Tuy:
Hardness Results and Efficient Algorithms for Graph Powers. WG 2009: 238-249 - Zhentao Li, Ignasi Sau:
Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph. WG 2009: 250-261 - Gary MacGillivray, André Raspaud, Jacobus Swarts:
Injective Oriented Colourings. WG 2009: 262-272 - Daniel Meister, Jan Arne Telle:
Chordal Digraphs. WG 2009: 273-284 - George B. Mertzios, Ignasi Sau, Shmuel Zaks:
A New Intersection Model and Improved Algorithms for Tolerance Graphs. WG 2009: 285-295 - Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno:
Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes. WG 2009: 296-307 - Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Cycles, Paths, Connectivity and Diameter in Distance Graphs. WG 2009: 320-328
skipping 1 more match
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-14 07:36 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