WG B

33 papers

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