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
- 2021
- Abu Reyan Ahmed, Greg Bodwin, Keaton Hamm, Stephen G. Kobourov, Richard Spence:
On Additive Spanners in Weighted Graphs with Local Error. WG 2021: 361-373 - Patrizio Angelini, Michael A. Bekos, Fabrizio Montecchiani, Maximilian Pfister:
On Morphing 1-Planar Drawings. WG 2021: 270-282 - Dhanyamol Antony, Jay Garchar, Sagartanu Pal, R. B. Sandeep, Sagnik Sen, R. Subashini:
On Subgraph Complementation to H-free Graphs. WG 2021: 118-129 - Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore:
On Fair Covering and Hitting Problems. WG 2021: 39-51 - Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse:
The Largest Connected Subgraph Game. WG 2021: 296-307 - Matthias Bentert, Tomohiro Koana, Rolf Niedermeier:
The Complexity of Gerrymandering over Graphs: Paths and Trees. WG 2021: 195-206 - Václav Blazej, Pavel Dvorák, Michal Opler:
Bears with Hats and Independence Polynomials. WG 2021: 283-295 - Hans L. Bodlaender:
Parameterized Complexity of Bandwidth of Caterpillars and Weighted Path Emulation. WG 2021: 15-27 - Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith:
Acyclic, Star, and Injective Colouring: Bounding the Diameter. WG 2021: 336-348 - Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu:
A Linear-Time Parameterized Algorithm for Computing the Width of a DAG. WG 2021: 257-269 - Yixin Cao, Shenghua Wang:
Complementation in T-perfect Graphs. WG 2021: 106-117 - Dario Cavallaro, Till Fluschnik:
Feedback Vertex Set on Hamiltonian Graphs. WG 2021: 207-218 - Eranda Çela, Bettina Klinz, Stefan Lendl, James B. Orlin, Gerhard J. Woeginger, Lasse Wulf:
Linearizable Special Cases of the Quadratic Shortest Path Problem. WG 2021: 245-256 - Christophe Crespelle, Benjamin Gras, Anthony Perez:
Completion to Chordal Distance-Hereditary Graphs: A Quartic Vertex-Kernel. WG 2021: 156-168 - Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Saket Saurabh:
Odd Cycle Transversal in Mixed Graphs. WG 2021: 130-142 - Öznur Yasar Diner, Archontia C. Giannopoulou, Giannos Stamoulis, Dimitrios M. Thilikos:
Block Elimination Distance. WG 2021: 28-38 - Huib Donkers, Bart M. P. Jansen:
Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set. WG 2021: 1-14 - Guillaume Ducoffe:
Beyond Helly Graphs: The Diameter Problem on Absolute Retracts. WG 2021: 321-335 - David Eppstein:
The Graphs of Stably Matchable Pairs. WG 2021: 349-360 - Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Can Romeo and Juliet Meet? or Rendezvous Games with Adversaries on Graphs. WG 2021: 308-320 - Aadityan Ganesh, Vishwa Prakash HV, Prajakta Nimbhorkar, Geevarghese Philip:
Disjoint Stable Matchings in Linear Time. WG 2021: 94-105 - Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer:
Preventing Small (s,t)Cuts by Protecting Edges. WG 2021: 143-155 - Bart M. P. Jansen, Jari J. H. de Kroon:
FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More. WG 2021: 80-93 - Vít Jelínek, Tereza Klimosová, Tomás Masarík, Jana Novotná, Aneta Pokorná:
On 3-Coloring of (2P4, C5)-Free Graphs. WG 2021: 388-401 - Colin Krisko, Avery Miller:
Labeling Schemes for Deterministic Radio Multi-broadcast. WG 2021: 374-387 - Van Bang Le, Jan Arne Telle:
The Perfect Matching Cut Problem Revisited. WG 2021: 182-194 - Isja Mannens, Jesper Nederlof, Céline M. F. Swennenhuis, Krisztina Szilágyi:
On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem. WG 2021: 52-79 - Maciej Rymar, Hendrik Molter, André Nichterlein, Rolf Niedermeier:
Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality. WG 2021: 219-231 - Sylwester Swat, Marta Kasprzak:
A Heuristic Approach to the Treedepth Decomposition Problem for Large Graphs. WG 2021: 169-181 - Nils Vortmeier, Ioannis Kokkinis:
The Dynamic Complexity of Acyclic Hypergraph Homomorphisms. WG 2021: 232-244
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-10-20 18:19 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