default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID43rd WG 2017: Eindhoven, The Netherlands
- Hans L. Bodlaender, Gerhard J. Woeginger:
Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers. Lecture Notes in Computer Science 10520, Springer 2017, ISBN 978-3-319-68704-9 - Remco van der Hofstad
:
Counting Graphs and Null Models of Complex Networks: Configuration Model and Extensions. 1-17 - Vicente Acuña, Roberto Grossi, Giuseppe F. Italiano, Leandro Lima, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot, Blerina Sinaimeri:
On Bubble Generators in Directed Graphs. 18-31 - Akanksha Agrawal, Daniel Lokshtanov, Amer E. Mouawad:
Critical Node Cut Parameterized by Treewidth and Solution Size is W[1]-Hard. 32-44 - Patrizio Angelini, Michael A. Bekos:
Hierarchical Partial Planarity. 45-58 - Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg, Giordano Da Lozzo, Giuseppe Di Battista, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Ignaz Rutter:
On the Relationship Between k-Planar and k-Quasi-Planar Graphs. 59-74 - Manuel Aprile, Yuri Faenza, Samuel Fiorini, Tony Huynh, Marco Macchia:
Extension Complexity of Stable Set Polytopes of Bipartite Graphs. 75-87 - Julien Baste, Marc Noy, Ignasi Sau:
On the Number of Labeled Graphs of Bounded Treewidth. 88-99 - Julien Baste, Dieter Rautenbach, Ignasi Sau:
Uniquely Restricted Matchings and Edge Colorings. 100-112 - Rémy Belmonte, Michael Lampis, Valia Mitsou:
Defective Coloring on Classes of Perfect Graphs. 113-126 - Marthe Bonamy, Nicolas Bousquet:
Token Sliding on Chordal Graphs. 127-139 - Nicolas Bousquet, Marc Heinrich:
Computing Maximum Cliques in B_2 -EPG Graphs. 140-152 - Jean Cardinal, Stefan Felsner, Tillmann Miltzow, Casey Tompkins, Birgit Vogtenhuber:
Intersection Graphs of Rays and Grounded Segments. 153-166 - Steven Chaplick, Martin Toepfer, Jan Voborník, Peter Zeman:
On H-Topological Intersection Graphs. 167-179 - Yijia Chen, Martin Grohe, Bingkai Lin:
The Hardness of Embedding Grids and Walls. 180-192 - Maria Chudnovsky, Oliver Schaudt, Sophie Spirkl, Maya Stein, Mingxian Zhong:
Approximately Coloring Graphs Without Long Induced Paths. 193-205 - Ágnes Cseh, Jannik Matuschke:
New and Simple Algorithms for Stable Flow Problems. 206-219 - Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma:
Clique-Width and Well-Quasi-Ordering of Triangle-Free Graph Classes. 220-233 - Guillaume Ducoffe:
Finding Cut-Vertices in the Square Roots of a Graph. 234-248 - Till Fluschnik, Meike Hatzel, Steffen Härtlein, Hendrik Molter, Henning Seidler:
The Minimum Shared Edges Problem on Grid-Like Graphs. 249-262 - Serge Gaspers, Shenwei Huang:
Linearly \chi χ -Bounding (P_6, C_4) ( P 6 , C 4 ) -Free Graphs. 263-274 - Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma:
Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2. 275-288 - Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi:
Enumeration and Maximum Number of Maximal Irredundant Sets for Chordal Graphs. 289-302 - Ademir Hujdurovic, Edin Husic, Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu:
The Minimum Conflict-Free Row Split Problem Revisited. 303-315 - Gregor Hültenschmidt, Philipp Kindermann, Wouter Meulemans, André Schulz:
Drawing Planar Graphs with Few Geometric Primitives. 316-329 - Pallavi Jain, Jayakrishnan Madathil, Fahad Panolan, Abhishek Sahu:
Mixed Dominating Set: A Parameterized Perspective. 330-343 - Dusan Knop, Martin Koutecký, Tomás Masarík, Tomás Toufar:
Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity. 344-357 - Tomasz Krawczyk, Bartosz Walczak:
Extending Partial Representations of Trapezoid Graphs. 358-371 - O-joung Kwon, Michal Pilipczuk, Sebastian Siebertz:
On Low Rank-Width Colorings. 372-385 - Manuel Lafond:
On Strongly Chordal Graphs That Are Not Leaf Powers. 386-398 - Vadim V. Lozin, Dmitriy S. Malyshev, Raffaele Mosca, Viktor Zamaraev:
New Results on Weighted Independent Domination. 399-411 - Oliver Schaudt, Fabian Senger:
The Parameterized Complexity of the Equidomination Problem. 412-424 - Hendrik Schrezenmaier:
Homothetic Triangle Contact Representations. 425-437
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-12-31 21:31 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:
