![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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
- 2018
- Matthew Johnson
, Giacomo Paesani
, Daniël Paulusma
:
Connected Vertex Cover for (sP_1+P_5) ( s P 1 + P 5 ) -Free Graphs. WG 2018: 279-291 - Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev:
On Dispersable Book Embeddings. WG 2018: 1-14 - Jesse Beisegel:
Characterising AT-free Graphs with BFS. WG 2018: 15-26 - Michael A. Bekos, Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
, Chrysanthi N. Raftopoulou
:
Edge Partitions of Optimal 2-plane and 3-plane Graphs. WG 2018: 27-39 - Thomas Bellitto, Benjamin Bergougnoux:
On Minimum Connecting Transition Sets in Graphs. WG 2018: 40-51 - Jelco M. Bodewes, Hans L. Bodlaender
, Gunther Cornelissen, Marieke van der Wegen:
Recognizing Hyperelliptic Graphs in Polynomial Time. WG 2018: 52-64 - Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michal Pilipczuk
, Arkadiusz Socala, Marcin Wrochna
:
On Directed Feedback Vertex Set Parameterized by Treewidth. WG 2018: 65-78 - Édouard Bonnet, Pawel Rzazewski
:
Optimality Program in Segment and String Graphs. WG 2018: 79-90 - Paz Carmi, Vida Dujmovic, Pat Morin
:
Anagram-Free Chromatic Number Is Not Pathwidth-Bounded. WG 2018: 91-99 - Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Takeaki Uno, Luca Versari:
Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts. WG 2018: 100-110 - Konrad K. Dabrowski
, François Dross
, Jisu Jeong
, Mamadou Moustapha Kanté
, O-joung Kwon
, Sang-il Oum
, Daniël Paulusma
:
Computing Small Pivot-Minors. WG 2018: 125-138 - Peter Damaschke:
Saving Probe Bits by Cube Domination. WG 2018: 139-151 - Michael Gene Dobbins, Linda Kleist
, Tillmann Miltzow, Pawel Rzazewski
:
∀∃ℝ-Completeness and Area-Universality. WG 2018: 164-175 - Szymon Dudycz
, Katarzyna Paluch
:
Optimal General Matchings. WG 2018: 176-189 - Martin E. Dyer
, Haiko Müller
:
Quasimonotone Graphs. WG 2018: 190-202 - Stefan Felsner, Hendrik Schrezenmaier, Raphael Steiner
:
Equiangular Polygon Contact Representations. WG 2018: 203-215 - Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Philipp Zschoche:
Temporal Graph Classes: A View Through Temporal Separators. WG 2018: 216-227 - Renzo Gómez
, Yoshiko Wakabayashi
:
Covering a Graph with Nontrivial Vertex-Disjoint Paths: Existence and Optimization. WG 2018: 228-238 - Niels Grüttemeier, Christian Komusiewicz:
On the Relation of Strong Triadic Closure and Cluster Deletion. WG 2018: 239-251 - Meike Hatzel, Sebastian Wiederrecht
:
On Perfect Linegraph Squares. WG 2018: 252-265 - Lars Jaffke
, Mateus de Oliveira Oliveira
:
On Weak Isomorphism of Rooted Vertex-Colored Graphs. WG 2018: 266-278 - Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos:
Structurally Parameterized d-Scattered Set. WG 2018: 292-305 - Telikepalli Kavitha:
Popular Matchings of Desired Size. WG 2018: 306-317 - Linda Kleist
, Boris Klemz, Anna Lubiw, Lena Schlipf, Frank Staals, Darren Strash
:
Convexity-Increasing Morphs of Planar Graphs. WG 2018: 318-330 - Jeremy Kun, Michael P. O'Brien, Blair D. Sullivan
:
Treedepth Bounds in Linear Colorings. WG 2018: 331-343 - Shaohua Li, Marcin Pilipczuk
:
An Improved FPT Algorithm for Independent Feedback Vertex Set. WG 2018: 344-355 - Giordano Da Lozzo
, David Eppstein, Michael T. Goodrich, Siddharth Gupta:
Subexponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity. WG 2018: 111-124 - Anna Lubiw, Debajyoti Mondal:
Construction and Local Routing for Angle-Monotone Graphs. WG 2018: 356-368 - Mateus de Oliveira Oliveira:
Graph Amalgamation Under Logical Constraints. WG 2018: 152-163 - B. S. Panda, Anita Das:
Characterization and Recognition of Tree 3-Spanner Admissible Directed Path Graphs of Diameter Three. WG 2018: 369-381
skipping 1 more match
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-03 07:41 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