Lawqueen Kanesh

According to our database, Lawqueen Kanesh authored at least 37 papers between 2018 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Exact and Approximate Digraph Bandwidth.

Pallavi Jain, Lawqueen Kanesh, William Lochet, Saket Saurabh, Roohani Sharma

Theory Comput. Syst., March, 2025

A Quadratic Vertex Kernel and a Subexponential Algorithm for Subset-FAST.

Satyabrata Jana, Lawqueen Kanesh, Madhumita Kundu, Daniel Lokshtanov, Saket Saurabh

CoRR, March, 2025

Burn and win.

Pradeesha Ashok, Sayani Das, Lawqueen Kanesh, Saket Saurabh, Avi Tomar, Shaily Verma

Theor. Comput. Sci., 2025

A Complexity-Theoretic Analysis of Majority Illusion in Social Networks.

Umberto Grandi, Lawqueen Kanesh, Grzegorz Lisowski, M. S. Ramanujan, Paolo Turrini

J. Artif. Intell. Res., 2025

Fixed-parameter algorithms for Fair Hitting Set problems.

Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, Nidhi Purohit, Saket Saurabh

Inf. Comput., 2025

Bicriteria FPT-Approximation Algorithms for Vertex Deletion to Bounded Degeneracy Graphs.

Tanmay Inamdar, Lawqueen Kanesh, R. Krithika, Harshil Mittal, Saket Saurabh

Proceedings of the Combinatorial Algorithms - 36th International Workshop, 2025

Parameterized Algorithms for Power Edge Set and Zero Forcing Set.

Sriram Bhyravarapu, Lawqueen Kanesh, Madhumita Kundu, Daniel Lokshtanov, Saket Saurabh

Proceedings of the Combinatorial Algorithms - 36th International Workshop, 2025

Parameterized Complexity of Disconnected Matchings.

Sushmita Gupta, Pallavi Jain, Lawqueen Kanesh, Sounak Modak, Saket Saurabh

Proceedings of the Algorithms and Complexity - 14th International Conference, 2025

Exact and Parameterized Algorithms for Window Width Minimization in Bipartite Arrangement.

Shashank Chauhan, Tanmay Inamdar, Lawqueen Kanesh, Sanjukta Roy

Proceedings of the Algorithms and Complexity - 14th International Conference, 2025

2024

Decremental Sensitivity Oracles for Covering and Packing Minors.

Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Peter Strulo

Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

On the Parameterized Complexity of Minus Domination.

Sriram Bhyravarapu, Lawqueen Kanesh, A. Mohanapriya, Nidhi Purohit, N. Sadagopan, Saket Saurabh

Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

Max-SAT with Cardinality Constraint Parameterized by the Number of Clauses.

Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

Subset Feedback Vertex Set in Tournaments as Fast as Without the Subset.

Satyabrata Jana, Lawqueen Kanesh, Madhumita Kundu, Saket Saurabh

Proceedings of the 19th International Symposium on Parameterized and Exact Computation, 2024

2023

Further Exploiting <i>c</i>-Closure for FPT Algorithms and Kernels for Domination Problems.

Lawqueen Kanesh, Jayakrishnan Madathil, Sanjukta Roy, Abhishek Sahu, Saket Saurabh

SIAM J. Discret. Math., December, 2023

Parameterized Approximation Scheme for Biclique-free Max <i>k</i>-Weight SAT and Max Coverage.

Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Parameterized Algorithms for Eccentricity Shortest Path Problem.

Sriram Bhyravarapu, Satyabrata Jana, Lawqueen Kanesh, Saket Saurabh, Shaily Verma

Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less.

Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, M. S. Ramanujan, Saket Saurabh

Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

Identifying and Eliminating Majority Illusion in Social Networks.

Umberto Grandi, Lawqueen Kanesh, Grzegorz Lisowski, Ramanujan Sridharan, Paolo Turrini

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

On the complexity of singly connected vertex deletion.

Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk, Nidhi Purohit, Saket Saurabh

Theor. Comput. Sci., 2022

A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs.

Akanksha Agrawal, Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Saket Saurabh

SIAM J. Discret. Math., 2022

A Polynomial Kernel for Bipartite Permutation Vertex Deletion.

Jan Derbisz, Lawqueen Kanesh, Jayakrishnan Madathil, Abhishek Sahu, Saket Saurabh, Shaily Verma

Algorithmica, 2022

Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems.

Lawqueen Kanesh, Jayakrishnan Madathil, Sanjukta Roy, Abhishek Sahu, Saket Saurabh

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent.

Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021

Parameterized complexity of fair feedback vertex set problem.

Lawqueen Kanesh, Soumen Maity, Komal Muluk, Saket Saurabh

Theor. Comput. Sci., 2021

Paths to trees and cacti.

Akanksha Agrawal, Lawqueen Kanesh, Saket Saurabh, Prafullkumar Tale

Theor. Comput. Sci., 2021

Elimination Distance to Topological-minor-free Graphs is FPT.

Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh

CoRR, 2021

Odd Cycle Transversal in Mixed Graphs.

Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Saket Saurabh

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

An FPT Algorithm for Elimination Distance to Bounded Degree Graphs.

Akanksha Agrawal, Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Saket Saurabh

Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

A Polynomial Kernel for Bipartite Permutation Vertex Deletion.

Lawqueen Kanesh, Jayakrishnan Madathil, Abhishek Sahu, Saket Saurabh, Shaily Verma

Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

Circumventing Connectivity for Kernelization.

Pallavi Jain, Lawqueen Kanesh, Shivesh Kumar Roy, Saket Saurabh, Roohani Sharma

Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

2020

Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized.

Pallavi Jain, Lawqueen Kanesh, Pranabendu Misra

Theory Comput. Syst., 2020

Parameterized Complexity of Conflict-Free Matchings and Paths.

Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Saket Saurabh

Algorithmica, 2020

Parameterized Complexity of Feedback Vertex Sets on Hypergraphs.

Pratibha Choudhary, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh

Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

2018

Conflict Free Feedback Vertex Set: A Parameterized Dichotomy.

Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Daniel Lokshtanov, Saket Saurabh

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Exploring the Kernelization Borders for Hitting Cycles.

Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Pranabendu Misra, Saket Saurabh

Proceedings of the 13th International Symposium on Parameterized and Exact Computation, 2018

A parameterized runtime analysis of randomized local search and evolutionary algorithm for max <i>l</i>-uncut.

Pallavi Jain, Lawqueen Kanesh, Jayakrishnan Madathil, Saket Saurabh

Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2018

Hitting and Covering Partially.

Akanksha Agrawal, Pratibha Choudhary, Pallavi Jain, Lawqueen Kanesh, Vibha Sahlot, Saket Saurabh

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018