No. Title Author Year
1 Clique-Width for Graph Classes Closed under Complementation Blanchť, Alexandre et al. 2017
2 Recognizing Graphs Close to Bipartite Graphs Bonamy, Marthe et al. 2017
3 A Linear Kernel for Finding Square Roots of Almost Planar Graphs Golovach, Petr A. et al. 2016
4 Colouring Diamond-free Graphs Dabrowski, Konrad K. et al. 2016
5 Using Contracted Solution Graphs for Solving Reconfiguration Problems Bonsma, Paul et al. 2016
6 Editing to Eulerian Graphs Dabrowski, Konrad K. et al. 2014
7 Model Counting for CNF Formulas of Bounded Modular Treewidth Paulusma, Daniel et al. 2013
8 Satisfiability of Acyclic and Almost Acyclic CNF Formulas Ordyniak, Sebastian et al. 2010
9 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: 9

DROPS-Home | Fulltext Search | Imprint Published by LZI