| 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 | 16 | 2021 |
| Paths to trees and cacti A Agrawal, L Kanesh, S Saurabh, P Tale Theoretical Computer Science 860, 98-116, 2021 | 10 | 2021 |
| 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 | 9 | 2022 |
| 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 | 9 | 2020 |
| Parameterized complexity of conflict-free matchings and paths A Agrawal, P Jain, L Kanesh, S Saurabh Algorithmica 82 (7), 1939-1965, 2020 | 6 | 2020 |
| Elimination distance to topological-minor-free graphs is FPT A Agrawal, L Kanesh, D Lokshtanov, F Panolan, MS Ramanujan, ... arXiv preprint arXiv:2104.09950, 2021 | 4 | 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 | 4 | 2018 |
| 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 |
| 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 | 3 | 2018 |
| 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 | 2 | 2022 |
| Parameterized complexity of fair feedback vertex set problem L Kanesh, S Maity, K Muluk, S Saurabh Theoretical Computer Science 867, 1-12, 2021 | 1 | 2021 |
| Parameterized complexity of feedback vertex sets on hypergraphs P Choudhary, L Kanesh, D Lokshtanov, F Panolan, S Saurabh Leibniz international proceedings in informatics, 2020 | 1 | 2020 |
| Exact and approximate digraph bandwidth P Jain, L Kanesh, W Lochet, S Saurabh, R Sharma 39th IARCS Annual Conference on Foundations of Software Technology and …, 2019 | 1 | 2019 |
| Hitting and covering partially A Agrawal, P Choudhary, P Jain, L Kanesh, V Sahlot, S Saurabh Computing and Combinatorics: 24th International Conference, COCOON 2018 …, 2018 | 1 | 2018 |
| Parameterized Approximation Scheme for Biclique-free Max k-Weight SAT and Max Coverage P 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 | | 2023 |
| A Polynomial Kernel for Bipartite Permutation Vertex Deletion J Derbisz, L Kanesh, J Madathil, A Sahu, S Saurabh, S Verma Algorithmica 84 (11), 3246-3275, 2022 | | 2022 |
| 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 | | 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 | | 2022 |
| Odd Cycle Transversal in Mixed Graphs A Das, L Kanesh, J Madathil, S Saurabh Graph-Theoretic Concepts in Computer Science: 47th International Workshop …, 2021 | | 2021 |
| Circumventing Connectivity for Kernelization P Jain, L Kanesh, SK Roy, S Saurabh, R Sharma Algorithms and Complexity: 12th International Conference, CIAC 2021, Virtual …, 2021 | | 2021 |
