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
- 2006
- Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez:
Clique Graph Recognition Is NP-Complete. WG 2006: 269-277 - Miklós Bartha, Miklós Krész:
Flexible Matchings. WG 2006: 313-324 - Hans L. Bodlaender:
Treewidth: Characterizations, Applications, and Computations. WG 2006: 1-14 - Jérémie Chalopin, Daniël Paulusma:
Graph Labelings Derived from Models in Distributed Computing. WG 2006: 301-312 - David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng:
Partitioned Probe Comparability Graphs. WG 2006: 179-190 - Sylvain Coulonges:
Circular-Perfect Concave-Round Graphs. WG 2006: 348-355 - Andrew R. Curtis, Clemente Izurieta, Benson L. Joeris, Scott M. Lundberg, Ross M. McConnell:
An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time. WG 2006: 168-178 - Jirí Fiala, Jan Kratochvíl:
Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy. WG 2006: 15-26 - Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks:
Approximating the Traffic Grooming Problem in Tree and Star Networks. WG 2006: 147-158 - Jan Foniok, Jaroslav Nesetril, Claude Tardif:
Generalised Dualities and Finite Maximal Antichains. WG 2006: 27-36 - Pierre Fraigniaud, Nicolas Nisse:
Monotony Properties of Connected Visible Graph Searching. WG 2006: 229-240 - Serge Gaspers, Mathieu Liedloff:
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs. WG 2006: 78-89 - Elisabeth Gassner, Michael Jünger, Merijam Percan, Marcus Schaefer, Michael Schulz:
Simultaneous Graph Embeddings with Fixed Edges. WG 2006: 325-335 - Gaurav Goel, Jens Gustedt:
Bounded Arboricity to Determine the Local Structure of Sparse Graphs. WG 2006: 159-167 - Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
Finding Intersection Models of Weakly Chordal Graphs. WG 2006: 241-255 - Alexander Grigoriev, Joyce van Loon, René Sitters, Marc Uetz:
How to Sell a Graph: Guidelines for Graph Retailers. WG 2006: 125-136 - Magnús M. Halldórsson, Ragnar K. Karlsson:
Strip Graphs: Recognition and Scheduling. WG 2006: 137-146 - Seok-Hee Hong, Hiroshi Nagamochi:
Convex Drawings of Graphs with Non-convex Boundary. WG 2006: 113-124 - Haim Kaplan, Yahav Nussbaum:
Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs. WG 2006: 289-300 - Masashi Kiyomi, Shuji Kijima, Takeaki Uno:
Listing Chordal Graphs and Interval Graphs. WG 2006: 68-77 - Christian Knauer, Andreas Spillner:
A Fixed-Parameter Algorithm for the Minimum Weight Triangulation Problem Based on Small Graph Separators. WG 2006: 49-57 - Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith:
Divide-and-Color. WG 2006: 58-67 - Lukasz Kowalik:
Improved Edge-Coloring with Three Colors. WG 2006: 90-101 - Johann A. Makowsky, Udi Rotics, Ilya Averbouch, Benny Godlin:
Computing Graph Polynomials on Graphs of Bounded Clique-Width. WG 2006: 191-204 - Bodo Manthey:
Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions. WG 2006: 336-347 - Dániel Marx:
Chordal Deletion Is Fixed-Parameter Tractable. WG 2006: 37-48 - Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos:
A Fully Dynamic Algorithm for the Recognition of P4-Sparse Graphs. WG 2006: 256-268 - Christophe Paul, Andrzej Proskurowski, Jan Arne Telle:
Generation of Graphs with Bounded Branchwidth. WG 2006: 205-216 - Ivan Rapaport, Karol Suchan, Ioan Todinca:
Minimal Proper Interval Completions. WG 2006: 217-228 - Yasuhiko Takenaga, Kenichi Higashide:
Vertex Coloring of Comparability+ke and -ke Graphs. WG 2006: 102-112
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-23 01:24 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