| No. |
Title |
Author |
Year |
| 1 |
Complexity Framework for Forbidden Subgraphs III: When Problems Are Tractable on Subcubic Graphs |
Johnson, Matthew et al. |
2023 |
| 2 |
Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius |
Lucke, Felicia et al. |
2023 |
| 3 |
Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl Seminar 22481) |
Chudnovsky, Maria et al. |
2023 |
| 4 |
Finding Matching Cuts in H-Free Graphs |
Lucke, Felicia et al. |
2022 |
| 5 |
Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs |
Paesani, Giacomo et al. |
2021 |
| 6 |
Partitioning H-Free Graphs of Bounded Diameter |
Brause, Christoph et al. |
2021 |
| 7 |
QCSP on Reflexive Tournaments |
Larose, Benoît et al. |
2021 |
| 8 |
Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs |
Bok, Jan et al. |
2020 |
| 9 |
Bounding the Mim-Width of Hereditary Graph Classes |
Brettell, Nick et al. |
2020 |
| 10 |
Contracting to a Longest Path in H-Free Graphs |
Kern, Walter et al. |
2020 |
| 11 |
Colouring H-Free Graphs of Bounded Diameter |
Martin, Barnaby et al. |
2019 |
| 12 |
Finding a Small Number of Colourful Components |
Bulteau, Laurent et al. |
2019 |
| 13 |
Graph Colouring: from Structure to Algorithms (Dagstuhl Seminar 19271) |
Chudnovsky, Maria et al. |
2019 |
| 14 |
Colouring (P_r+P_s)-Free Graphs |
Klimosová, Tereza et al. |
2018 |
| 15 |
Colouring Square-Free Graphs without Long Induced Paths |
Gaspers, Serge et al. |
2018 |
| 16 |
Disconnected Cuts in Claw-free Graphs |
Martin, Barnaby et al. |
2018 |
| 17 |
On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal |
Dabrowski, Konrad K. et al. |
2018 |
| 18 |
Surjective H-Colouring over Reflexive Digraphs |
Larose, Benoit et al. |
2018 |
| 19 |
Clique-Width for Graph Classes Closed under Complementation |
Blanché, Alexandre et al. |
2017 |
| 20 |
Independent Feedback Vertex Set for P_5-free Graphs |
Bonamy, Marthe et al. |
2017 |
| 21 |
Recognizing Graphs Close to Bipartite Graphs |
Bonamy, Marthe et al. |
2017 |
| 22 |
A Linear Kernel for Finding Square Roots of Almost Planar Graphs |
Golovach, Petr A. et al. |
2016 |
| 23 |
Colouring Diamond-free Graphs |
Dabrowski, Konrad K. et al. |
2016 |
| 24 |
Using Contracted Solution Graphs for Solving Reconfiguration Problems |
Bonsma, Paul et al. |
2016 |
| 25 |
Editing to Eulerian Graphs |
Dabrowski, Konrad K. et al. |
2014 |
| 26 |
Model Counting for CNF Formulas of Bounded Modular Treewidth |
Paulusma, Daniel et al. |
2013 |
| 27 |
Satisfiability of Acyclic and Almost Acyclic CNF Formulas |
Ordyniak, Sebastian et al. |
2010 |
| 28 |
The k-in-a-path Problem for Claw-free Graphs |
Fiala, Jiri et al. |
2010 |
