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 33 matches
- 2020
- Abu Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh, Stephen G. Kobourov, Richard Spence:
Weighted Additive Spanners. WG 2020: 401-413 - Jungho Ahn, Lars Jaffke, O-joung Kwon, Paloma T. Lima:
Well-Partitioned Chordal Graphs: Obstruction Set and Disjoint Paths. WG 2020: 148-160 - Oswin Aichholzer, Manuel Borrazzo, Prosenjit Bose, Jean Cardinal, Fabrizio Frati, Pat Morin, Birgit Vogtenhuber:
Drawing Graphs as Spanners. WG 2020: 310-324 - Patrizio Angelini, Michael A. Bekos, Henry Förster, Martin Gronemann:
Bitonic st-Orderings for Upward Planar Graphs: The Variable Embedding Setting. WG 2020: 339-351 - Alan Arroyo, Fabian Klute, Irene Parada, Raimund Seidel, Birgit Vogtenhuber, Tilo Wiedera:
Inserting One Edge into a Simple Drawing Is Hard. WG 2020: 325-338 - Manu Basavaraju, Arijit Bishnu, Mathew C. Francis, Drimit Pattanayak:
The Linear Arboricity Conjecture for 3-Degenerate Graphs. WG 2020: 376-387 - Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Matjaz Krnc, Martin Milanic, Nevena Pivac, Robert Scheffler, Martin Strehler:
Edge Elimination and Weighted Graph Classes. WG 2020: 134-147 - Rémy Belmonte, Ignasi Sau:
On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings. WG 2020: 67-79 - Benjamin Bergougnoux, Charis Papadopoulos, Jan Arne Telle:
Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width. WG 2020: 388-400 - Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram:
Combinatorial Bounds for Conflict-Free Coloring on Open Neighborhoods. WG 2020: 1-13 - Therese Biedl, Fabian Klute:
Finding Large Matchings in 1-Planar Graphs of Minimum Degree 3. WG 2020: 248-260 - Hans L. Bodlaender, Benjamin A. Burton, Fedor V. Fomin, Alexander Grigoriev:
Knot Diagrams of Treewidth Two. WG 2020: 80-91 - Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma:
Computing Subset Transversals in H-Free Graphs. WG 2020: 187-199 - Onur Çagirici, Petr Hlinený, Filip Pokrývka, Abhisekh Sankaran:
Clique-Width of Point Configurations. WG 2020: 54-66 - Yixin Cao, Guozhen Rong, Jianxin Wang:
Characterization and Linear-Time Recognition of Paired Threshold Graphs. WG 2020: 298-309 - Parinya Chalermsook, Wanchote Po Jiamjitrak, Ly Orgo:
On Finding Balanced Bicliques via Matchings. WG 2020: 238-247 - Nina Chiarelli, Berenice Martínez-Barona, Martin Milanic, Jérôme Monnot, Peter Mursic:
Strong Cliques in Diamond-Free Graphs. WG 2020: 261-273 - Konrad K. Dabrowski, Tomás Masarík, Jana Novotná, Daniël Paulusma, Pawel Rzazewski:
Clique-Width: Harnessing the Power of Atoms. WG 2020: 119-133 - Clément Dallard, Martin Milanic, Kenny Storgel:
Treewidth Versus Clique Number in Graph Classes with a Forbidden Structure. WG 2020: 92-105 - Pavel Dvorák, Andreas Emil Feldmann, Ashutosh Rai, Pawel Rzazewski:
Parameterized Inapproximability of Independent Set in H-Free Graphs. WG 2020: 40-53 - Stefan Felsner, Kolja Knauer, Torsten Ueckerdt:
Plattenbauten: Touching Rectangles in Space. WG 2020: 161-173 - Mathew C. Francis, Rian Neogi, Venkatesh Raman:
Recognizing k-Clique Extendible Orderings. WG 2020: 274-285 - Fabrizio Frati, Michael Hoffmann, Csaba D. Tóth:
Universal Geometric Graphs. WG 2020: 174-186 - Alan M. Frieze, Krzysztof Turowski, Wojciech Szpankowski:
Degree Distribution for Duplication-Divergence Graphs: Large Deviations. WG 2020: 226-237 - Shinya Fujita, Boram Park, Tadashi Sakuma:
Stable Structure on Safe Set Problems in Vertex-Weighted Graphs II -Recognition and Complexity-. WG 2020: 364-375 - Roman Haag, Hendrik Molter, Rolf Niedermeier, Malte Renken:
Feedback Edge Sets in Temporal Graphs. WG 2020: 200-212 - Irene Heinrich, Till Heller, Eva Schmidt, Manuel Streicher:
2.5-Connectivity: Unique Components, Critical Graphs, and Applications. WG 2020: 352-363 - Paul Jungeblut, Torsten Ueckerdt:
Guarding Quadrangulations and Stacked Triangulations with Edges. WG 2020: 14-26 - Pavel Klavík, Dusan Knop, Peter Zeman:
Graph Isomorphism Restricted by Lists. WG 2020: 106-118 - Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno:
Linear-Time Recognition of Double-Threshold Graphs. WG 2020: 286-297
skipping 3 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-21 11:30 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