Hitting and Covering Partially. - Akanksha Agrawal 001; Pratibha Choudhary; Pallavi Jain 001; Lawqueen Kanesh; Vibha Sahlot; Saket Saurabh 001 (COCOON, 2018)

A parameterized runtime analysis of randomized local search and evolutionary algorithm for max l-uncut. - Pallavi Jain 001; Lawqueen Kanesh; Jayakrishnan Madathil; Saket Saurabh 001 (GECCO (Companion), 2018)

Exploring the Kernelization Borders for Hitting Cycles. - Akanksha Agrawal 001; Pallavi Jain 001; Lawqueen Kanesh; Pranabendu Misra; Saket Saurabh 001 (IPEC, 2018)

Conflict Free Feedback Vertex Set: A Parameterized Dichotomy. - Akanksha Agrawal 001; Pallavi Jain 001; Lawqueen Kanesh; Daniel Lokshtanov; Saket Saurabh 001 (MFCS, 2018)

Parameterized Complexity of Feedback Vertex Sets on Hypergraphs. - Pratibha Choudhary; Lawqueen Kanesh; Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001 (FSTTCS, 2020)

Parameterized Complexity of Conflict-Free Matchings and Paths. - Akanksha Agrawal 001; Pallavi Jain 001; Lawqueen Kanesh; Saket Saurabh 001 (Algorithmica, 2020)

Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized. - Pallavi Jain 001; Lawqueen Kanesh; Pranabendu Misra (Theory Comput. Syst., 2020)

Circumventing Connectivity for Kernelization. - Pallavi Jain 001; Lawqueen Kanesh; Shivesh Kumar Roy; Saket Saurabh 001; Roohani Sharma (CIAC, 2021)

A Polynomial Kernel for Bipartite Permutation Vertex Deletion. - Lawqueen Kanesh; Jayakrishnan Madathil; Abhishek Sahu; Saket Saurabh 001; Shaily Verma (IPEC, 2021)

An FPT Algorithm for Elimination Distance to Bounded Degree Graphs. - Akanksha Agrawal 001; Lawqueen Kanesh; Fahad Panolan; M. S. Ramanujan 001; Saket Saurabh 001 (STACS, 2021)

Odd Cycle Transversal in Mixed Graphs. - Avinandan Das; Lawqueen Kanesh; Jayakrishnan Madathil; Saket Saurabh 001 (WG, 2021)

Elimination Distance to Topological-minor-free Graphs is FPT. - Akanksha Agrawal 001; Lawqueen Kanesh; Daniel Lokshtanov; Fahad Panolan; M. S. Ramanujan 001; Saket Saurabh 001 (CoRR, 2021)

Paths to trees and cacti. - Akanksha Agrawal 001; Lawqueen Kanesh; Saket Saurabh 001; Prafullkumar Tale (Theor. Comput. Sci., 2021)

Parameterized complexity of fair feedback vertex set problem. - Lawqueen Kanesh; Soumen Maity; Komal Muluk; Saket Saurabh 001 (Theor. Comput. Sci., 2021)

Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent. - Akanksha Agrawal 001; Lawqueen Kanesh; Daniel Lokshtanov; Fahad Panolan; M. S. Ramanujan 001; Saket Saurabh 001; Meirav Zehavi (SODA, 2022)

Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems. - Lawqueen Kanesh; Jayakrishnan Madathil; Sanjukta Roy 001; Abhishek Sahu; Saket Saurabh 001 (STACS, 2022)

A Polynomial Kernel for Bipartite Permutation Vertex Deletion. - Jan Derbisz; Lawqueen Kanesh; Jayakrishnan Madathil; Abhishek Sahu; Saket Saurabh 001; Shaily Verma (Algorithmica, 2022)

A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs. - Akanksha Agrawal 001; Lawqueen Kanesh; Fahad Panolan; M. S. Ramanujan 001; Saket Saurabh 001 (SIAM J. Discret. Math., 2022)

On the complexity of singly connected vertex deletion. - Avinandan Das; Lawqueen Kanesh; Jayakrishnan Madathil; Komal Muluk; Nidhi Purohit; Saket Saurabh 001 (Theor. Comput. Sci., 2022)

Identifying and Eliminating Majority Illusion in Social Networks. - Umberto Grandi; Lawqueen Kanesh; Grzegorz Lisowski; Ramanujan Sridharan; Paolo Turrini (AAAI, 2023)

FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less. - Tanmay Inamdar 002; Lawqueen Kanesh; Madhumita Kundu; M. S. Ramanujan 001; Saket Saurabh 001 (FSTTCS, 2023)

Parameterized Algorithms for Eccentricity Shortest Path Problem. - Sriram Bhyravarapu; Satyabrata Jana; Lawqueen Kanesh; Saket Saurabh 001; Shaily Verma (IWOCA, 2023)

Parameterized Approximation Scheme for Biclique-free Max k-Weight SAT and Max Coverage. - Pallavi Jain 001; Lawqueen Kanesh; Fahad Panolan; Souvik Saha 002; Abhishek Sahu; Saket Saurabh 001; Anannya Upasana (SODA, 2023)

Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems. - Lawqueen Kanesh; Jayakrishnan Madathil; Sanjukta Roy 001; Abhishek Sahu; Saket Saurabh 001 (SIAM J. Discret. Math., 2023)

Subset Feedback Vertex Set in Tournaments as Fast as Without the Subset. - Satyabrata Jana; Lawqueen Kanesh; Madhumita Kundu; Saket Saurabh 001 (IPEC, 2024)

Max-SAT with Cardinality Constraint Parameterized by the Number of Clauses. - Pallavi Jain 001; Lawqueen Kanesh; Fahad Panolan; Souvik Saha 002; Abhishek Sahu; Saket Saurabh 001; Anannya Upasana (LATIN (2), 2024)

On the Parameterized Complexity of Minus Domination. - Sriram Bhyravarapu; Lawqueen Kanesh; A. Mohanapriya; Nidhi Purohit; N. Sadagopan; Saket Saurabh 001 (SOFSEM, 2024)

Decremental Sensitivity Oracles for Covering and Packing Minors. - Lawqueen Kanesh; Fahad Panolan; M. S. Ramanujan 001; Peter Strulo (STACS, 2024)

Exact and Parameterized Algorithms for Window Width Minimization in Bipartite Arrangement. - Shashank Chauhan; Tanmay Inamdar 002; Lawqueen Kanesh; Sanjukta Roy 001 (CIAC (2), 2025)

Parameterized Complexity of Disconnected Matchings. - Sushmita Gupta; Pallavi Jain 001; Lawqueen Kanesh; Sounak Modak; Saket Saurabh 001 (CIAC (2), 2025)

Parameterized Algorithms for Power Edge Set and Zero Forcing Set. - Sriram Bhyravarapu; Lawqueen Kanesh; Madhumita Kundu; Daniel Lokshtanov; Saket Saurabh 001 (IWOCA, 2025)

Bicriteria FPT-Approximation Algorithms for Vertex Deletion to Bounded Degeneracy Graphs. - Tanmay Inamdar 002; Lawqueen Kanesh; R. Krithika 001; Harshil Mittal; Saket Saurabh 001 (IWOCA, 2025)

Fixed-parameter algorithms for Fair Hitting Set problems. - Tanmay Inamdar 002; Lawqueen Kanesh; Madhumita Kundu; Nidhi Purohit; Saket Saurabh 001 (Inf. Comput., 2025)

A Complexity-Theoretic Analysis of Majority Illusion in Social Networks. - Umberto Grandi; Lawqueen Kanesh; Grzegorz Lisowski; M. S. Ramanujan 001; Paolo Turrini (J. Artif. Intell. Res., 2025)

Burn and win. - Pradeesha Ashok; Sayani Das; Lawqueen Kanesh; Saket Saurabh 001; Avi Tomar; Shaily Verma (Theor. Comput. Sci., 2025)

A Quadratic Vertex Kernel and a Subexponential Algorithm for Subset-FAST. - Satyabrata Jana; Lawqueen Kanesh; Madhumita Kundu; Daniel Lokshtanov; Saket Saurabh 001 (CoRR, 2025)

Exact and Approximate Digraph Bandwidth. - Pallavi Jain 001; Lawqueen Kanesh; William Lochet; Saket Saurabh 001; Roohani Sharma (Theory Comput. Syst., 2025)