No. Title Author Year
1 Combining Treewidth and Backdoors for CSP Ganian, Robert et al. 2017
2 A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion Eiben, Eduard et al. 2016
3 Counting Linear Extensions: Parameterizations by Treewidth Eiben, Eduard et al. 2016
4 On Existential MSO and its Relation to ETH Ganian, Robert et al. 2016
5 On the Complexity Landscape of Connected f-Factor Problems Ganian, Robert et al. 2016
6 Meta-kernelization using Well-structured Modulators Eiben, Eduard et al. 2015
7 Lower Bounds on the Complexity of MSO_1 Model-Checking Ganian, Robert et al. 2012
8 Clique-width: When Hard Does Not Mean Impossible Ganian, Robert et al. 2011
9 Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width Ganian, Robert et al. 2010
10 The Parameterized Complexity of Oriented Colouring Ganian, Robert 2009
Current Page :
Number of result pages: 1
Number of documents: 10

DROPS-Home | Fulltext Search | Imprint Published by LZI