No. Title Author Year
1 A Linear-Time Parameterized Algorithm for Node Unique Label Cover Lokshtanov, Daniel et al. 2017
2 Combining Treewidth and Backdoors for CSP Ganian, Robert et al. 2017
3 Lossy Kernels for Hitting Subgraphs Eiben, Eduard et al. 2017
4 Path-Contractions, Edge Deletions and Connectivity Preservation Gutin, Gregory et al. 2017
5 Saving Critical Nodes with Firefighters is FPT Choudhari, Jayesh et al. 2017
6 On the Complexity Landscape of Connected f-Factor Problems Ganian, Robert et al. 2016
7 Strong Parameterized Deletion: Bipartite Graphs Rai, Ashutosh et al. 2016
8 Vertex Exponential Algorithms for Connected f-Factors Philip, Geevarghese et al. 2014
9 Backdoors to q-Horn Gaspers, Serge et al. 2013
10 Partially Polynomial Kernels for Set Cover and Test Cover Basavaraju, Manu et al. 2013
Current Page :
Number of result pages: 1
Number of documents: 10


DROPS-Home | Fulltext Search | Imprint Published by LZI