No. Title Author Year
1 On Girth and the Parameterized Complexity of Token Sliding and Token Jumping Bartier, Valentin et al. 2020
2 On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets Lokshtanov, Daniel et al. 2020
3 Bisection of Bounded Treewidth Graphs by Convolutions Eiben, Eduard et al. 2019
4 Lossy Kernels for Connected Dominating Set on Sparse Graphs Eiben, Eduard et al. 2018
5 On the Parameterized Complexity of Simultaneous Deletion Problems Agrawal, Akanksha et al. 2018
6 On the Parameterized Complexity of [1,j]-Domination Problems Alambardar Meybodi, Mohsen et al. 2018
7 Packing Cycles Faster Than Erdos-Posa Lokshtanov, Daniel et al. 2017
8 Kernelization of Cycle Packing with Relaxed Disjointness Constraints Agrawal, Akanksha et al. 2016
9 Simultaneous Feedback Vertex Set: A Parameterized Perspective Agrawal, Akanksha et al. 2016
Current Page :
Number of result pages: 1
Number of documents: 9


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