No. Title Author Year
1 Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS Lokshtanov, Daniel et al. 2018
2 On the Optimality of Pseudo-polynomial Algorithms for Integer Programming Fomin, Fedor V. et al. 2018
3 On the Parameterized Complexity of Simultaneous Deletion Problems Agrawal, Akanksha et al. 2018
4 Reducing CMSO Model Checking to Highly Connected Graphs Lokshtanov, Daniel et al. 2018
5 A Linear-Time Parameterized Algorithm for Node Unique Label Cover Lokshtanov, Daniel et al. 2017
6 Combining Treewidth and Backdoors for CSP Ganian, Robert et al. 2017
7 Lossy Kernels for Hitting Subgraphs Eiben, Eduard et al. 2017
8 Path-Contractions, Edge Deletions and Connectivity Preservation Gutin, Gregory et al. 2017
9 Saving Critical Nodes with Firefighters is FPT Choudhari, Jayesh et al. 2017
10 Towards a Polynomial Kernel for Directed Feedback Vertex Set Bergougnoux, Benjamin et al. 2017
Current Page :
Number of result pages: 2
Number of documents: 15


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