No. Title Author Year
1 An Approximate Kernel for Connected Feedback Vertex Set Ramanujan, M. S. 2019
2 Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS Lokshtanov, Daniel et al. 2018
3 On the Optimality of Pseudo-polynomial Algorithms for Integer Programming Fomin, Fedor V. et al. 2018
4 On the Parameterized Complexity of Simultaneous Deletion Problems Agrawal, Akanksha et al. 2018
5 Reducing CMSO Model Checking to Highly Connected Graphs Lokshtanov, Daniel et al. 2018
6 A Linear-Time Parameterized Algorithm for Node Unique Label Cover Lokshtanov, Daniel et al. 2017
7 Combining Treewidth and Backdoors for CSP Ganian, Robert et al. 2017
8 Lossy Kernels for Hitting Subgraphs Eiben, Eduard et al. 2017
9 Path-Contractions, Edge Deletions and Connectivity Preservation Gutin, Gregory et al. 2017
10 Saving Critical Nodes with Firefighters is FPT Choudhari, Jayesh et al. 2017
11 Towards a Polynomial Kernel for Directed Feedback Vertex Set Bergougnoux, Benjamin et al. 2017
12 On the Complexity Landscape of Connected f-Factor Problems Ganian, Robert et al. 2016
13 Strong Parameterized Deletion: Bipartite Graphs Rai, Ashutosh et al. 2016
14 Vertex Exponential Algorithms for Connected f-Factors Philip, Geevarghese et al. 2014
15 Backdoors to q-Horn Gaspers, Serge et al. 2013
16 Partially Polynomial Kernels for Set Cover and Test Cover Basavaraju, Manu et al. 2013
Current Page :
Number of result pages: 1
Number of documents: 16


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