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