Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent∗ A Agrawal, L Kanesh, D Lokshtanov, F Panolan, MS Ramanujan, ... Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022 | 19 | 2022 |

An FPT algorithm for elimination distance to bounded degree graphs A Agrawal, L Kanesh, F Panolan, MS Ramanujan, S Saurabh 38th International Symposium on Theoretical Aspects of Computer Science …, 2021 | 19 | 2021 |

Conflict free version of covering problems on graphs: Classical and parameterized P Jain, L Kanesh, P Misra Theory of Computing Systems 64 (6), 1067-1093, 2020 | 13 | 2020 |

Parameterized complexity of conflict-free matchings and paths A Agrawal, P Jain, L Kanesh, S Saurabh Algorithmica 82 (7), 1939-1965, 2020 | 13 | 2020 |

Paths to trees and cacti A Agrawal, L Kanesh, S Saurabh, P Tale Theoretical Computer Science 860, 98-116, 2021 | 12 | 2021 |

Further exploiting c-closure for FPT algorithms and kernels for domination problems L Kanesh, J Madathil, S Roy, A Sahu, S Saurabh 39th International Symposium on Theoretical Aspects of Computer Science …, 2022 | 8 | 2022 |

A fixed-parameter tractable algorithm for elimination distance to bounded degree graphs A Agrawal, L Kanesh, F Panolan, MS Ramanujan, S Saurabh SIAM Journal on Discrete Mathematics 36 (2), 911-921, 2022 | 6 | 2022 |

Elimination distance to topological-minor-free graphs is FPT A Agrawal, L Kanesh, D Lokshtanov, F Panolan, MS Ramanujan, ... CoRR, 2021 | 6 | 2021 |

Identifying and eliminating majority illusion in social networks U Grandi, L Kanesh, G Lisowski, R Sridharan, P Turrini Proceedings of the AAAI Conference on Artificial Intelligence 37 (4), 5062-5069, 2023 | 5 | 2023 |

Parameterized Approximation Scheme for Biclique-free Max *k*-Weight SAT and Max CoverageP Jain, L Kanesh, F Panolan, S Saha, A Sahu, S Saurabh, A Upasana Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 5 | 2023 |

Conflict free feedback vertex set: a parameterized dichotomy A Agrawal, P Jain, L Kanesh, D Lokshtanov, S Saurabh Schloss Dagstuhl Leibniz-Zentrum für Informatik, 2018 | 4 | 2018 |

Exact and approximate digraph bandwidth P Jain, L Kanesh, W Lochet, S Saurabh, R Sharma | 3 | 2023 |

A polynomial kernel for bipartite permutation vertex deletion L Kanesh, J Madathil, A Sahu, S Saurabh, S Verma 16th International Symposium on Parameterized and Exact Computation (IPEC 2021), 2021 | 3 | 2021 |

Exploring the kernelization borders for hitting cycles A Agrawal, P Jain, L Kanesh, P Misra, S Saurabh Schloss Dagstuhl Leibniz-Zentrum für Informatik, 2018 | 3 | 2018 |

On the complexity of singly connected vertex deletion A Das, L Kanesh, J Madathil, K Muluk, N Purohit, S Saurabh Theoretical Computer Science 934, 47-64, 2022 | 2 | 2022 |

Hitting and covering partially A Agrawal, P Choudhary, P Jain, L Kanesh, V Sahlot, S Saurabh International Computing and Combinatorics Conference, 751-763, 2018 | 2 | 2018 |

Max-SAT with Cardinality Constraint Parameterized by the Number of Clauses P Jain, L Kanesh, F Panolan, S Saha, A Sahu, S Saurabh, A Upasana Latin American Symposium on Theoretical Informatics, 223-237, 2024 | 1 | 2024 |

On the Parameterized Complexity of Minus Domination S Bhyravarapu, L Kanesh, A Mohanapriya, N Purohit, N Sadagopan, ... International Conference on Current Trends in Theory and Practice of …, 2024 | 1 | 2024 |

Fpt approximations for packing and covering problems parameterized by elimination distance and even less T Inamdar, L Kanesh, M Kundu, MS Ramanujan, S Saurabh arXiv preprint arXiv:2310.03469, 2023 | 1 | 2023 |

Fixed-Parameter Algorithms for Fair Hitting Set Problems T Inamdar, L Kanesh, M Kundu, N Purohit, S Saurabh arXiv preprint arXiv:2307.08854, 2023 | 1 | 2023 |