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


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI