No. Title Author Year
1 Exploring Subexponential Parameterized Complexity of Completion Problems Drange, Pal Gronas et al. 2014
2 On the Parameterised Complexity of String Morphism Problems Fernau, Henning et al. 2013
3 Searching for better fill-in Fomin, Fedor V. et al. 2013
4 Tight bounds for Parameterized Complexity of Cluster Editing Fomin, Fedor V. et al. 2013
5 Minimum Fill-in of Sparse Graphs: Kernelization and Approximation Fomin, Fedor V. et al. 2011
6 Finding Induced Subgraphs via Minimal Triangulations Fomin, Fedor V. et al. 2010
7 Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves Fernau, Henning et al. 2009
Current Page :
Number of result pages: 1
Number of documents: 7

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