No. Title Author Year
1 Fixed-Parameter Algorithms for Fair Hitting Set Problems Inamdar, Tanmay et al. 2023
2 Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems Kanesh, Lawqueen et al. 2022
3 A Polynomial Kernel for Bipartite Permutation Vertex Deletion Kanesh, Lawqueen et al. 2021
4 An FPT Algorithm for Elimination Distance to Bounded Degree Graphs Agrawal, Akanksha et al. 2021
5 Parameterized Complexity of Feedback Vertex Sets on Hypergraphs Choudhary, Pratibha et al. 2020
6 Exact and Approximate Digraph Bandwidth Jain, Pallavi et al. 2019
7 Exploring the Kernelization Borders for Hitting Cycles Agrawal, Akanksha et al. 2019
8 Parameterized Complexity of Conflict-Free Matchings and Paths Agrawal, Akanksha et al. 2019
9 Conflict Free Feedback Vertex Set: A Parameterized Dichotomy Agrawal, Akanksha et al. 2018
Current Page :
Number of result pages: 1
Number of documents: 9

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