No. |
Title |
Author |
Year |
---|

1 |
Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems |
Kanesh, Lawqueen et al. |
2022 |

2 |
A Polynomial Kernel for Bipartite Permutation Vertex Deletion |
Kanesh, Lawqueen et al. |
2021 |

3 |
An FPT Algorithm for Elimination Distance to Bounded Degree Graphs |
Agrawal, Akanksha et al. |
2021 |

4 |
Parameterized Complexity of Feedback Vertex Sets on Hypergraphs |
Choudhary, Pratibha et al. |
2020 |

5 |
Exact and Approximate Digraph Bandwidth |
Jain, Pallavi et al. |
2019 |

6 |
Exploring the Kernelization Borders for Hitting Cycles |
Agrawal, Akanksha et al. |
2019 |

7 |
Parameterized Complexity of Conflict-Free Matchings and Paths |
Agrawal, Akanksha et al. |
2019 |

8 |
Conflict Free Feedback Vertex Set: A Parameterized Dichotomy |
Agrawal, Akanksha et al. |
2018 |