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

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