Остановите войну!
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 32 matches
- 2007
- Ulrik Brandes, Daniel Delling, Marco Gaertler, Robert Görke, Martin Hoefer, Zoran Nikoloski, Dorothea Wagner:
On Finding Graph Clusterings with Maximum Modularity. WG 2007: 121-132 - Arthur H. Busch, Garth Isaak:
Recognizing Bipartite Tolerance Graphs in Linear Time. WG 2007: 12-20 - Luis Cereceda, Jan van den Heuvel, Matthew Johnson:
Mixing 3-Colourings in Bipartite Graphs. WG 2007: 166-177 - Maw-Shang Chang, Ming-Tat Ko:
The 3-Steiner Root Problem. WG 2007: 109-120 - Bruno Courcelle, Mamadou Moustapha Kanté:
Graph Operations Characterizing Rank-Width and Balanced Graph Expressions. WG 2007: 66-75 - Peter Damaschke:
Segmenting Strings Homogeneously Via Trees. WG 2007: 214-225 - Frederic Dorn:
How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms. WG 2007: 280-291 - Bruno Escoffier, Laurent Gourvès, Jérôme Monnot:
Complexity and Approximation Results for the Connected Vertex Cover Problem. WG 2007: 202-213 - Stefan Felsner, Florian Zickfeld:
On the Number of alpha -Orientations. WG 2007: 190-201 - Fedor V. Fomin, Pinar Heggernes, Rodica Mihai:
Mixed Search Number and Linear-Width of Interval and Split Graphs. WG 2007: 304-315 - Fabrizio Frati:
On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs. WG 2007: 133-144 - Philippe Gambette, Stéphane Vialette:
On Restrictions of Balanced 2-Interval Graphs. WG 2007: 55-65 - Petr A. Golovach, Jan Kratochvíl:
Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs. WG 2007: 1-11 - Frank Gurski, Egon Wanke:
The Clique-Width of Tree-Power and Leaf-Power Graphs. WG 2007: 76-85 - Matthias Hagen:
Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation. WG 2007: 316-327 - Torben Hagerup:
A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs. WG 2007: 145-150 - Refael Hassin, Jérôme Monnot, Danny Segev:
The Complexity of Bottleneck Labeled Graph Problems. WG 2007: 328-340 - Klaus Jansen:
Approximation Algorithms for Geometric Intersection Graphs. WG 2007: 151-153 - Van Bang Le, H. N. de Ridder:
Characterisations and Linear-Time Recognition of Probe Cographs. WG 2007: 226-237 - Vincent Limouzy, Fabien de Montgolfier, Michaël Rao:
NLC-2 Graph Recognition and Isomorphism. WG 2007: 86-98 - Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter:
Proper Helly Circular-Arc Graphs. WG 2007: 248-257 - Vadim V. Lozin, Martin Milanic:
Tree-Width and Optimization in Bounded Degree Graphs. WG 2007: 45-54 - Bodo Manthey:
Minimum-Weight Cycle Covers and Their Approximability. WG 2007: 178-189 - Dániel Marx, Ildikó Schlotter:
Obtaining a Planar Graph by Vertex Deletion. WG 2007: 292-303 - Frédéric Mazoit, Nicolas Nisse:
Monotonicity of Non-deterministic Graph Searching. WG 2007: 33-44 - Daniel Meister:
A Characterisation of the Minimal Triangulations of Permutation Graphs. WG 2007: 99-108 - Daniel Meister, Jan Arne Telle, Martin Vatshelle:
Characterization and Recognition of Digraphs of Bounded Kelly-width. WG 2007: 270-279 - Angelo Monti, Paolo Penna, Riccardo Silvestri:
An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem. WG 2007: 154-165 - Martin Pergel:
Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete. WG 2007: 238-247 - David Richerby, Dimitrios M. Thilikos:
Graph Searching in a Crime Wave. WG 2007: 21-32
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-04-25 16:50 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