Lawqueen Kanesh

Orcid: 0000-0001-9274-4119

According to our database1, Lawqueen Kanesh authored at least 30 papers between 2018 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Decremental Sensitivity Oracles for Covering and Packing Minors.
Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

On the Parameterized Complexity of Minus Domination.
Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

Max-SAT with Cardinality Constraint Parameterized by the Number of Clauses.
Proceedings of the LATIN 2024: Theoretical Informatics, 2024

2023
Further Exploiting <i>c</i>-Closure for FPT Algorithms and Kernels for Domination Problems.
SIAM J. Discret. Math., December, 2023

Parameterized Approximation Scheme for Biclique-free Max <i>k</i>-Weight SAT and Max Coverage.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Fixed-Parameter Algorithms for Fair Hitting Set Problems.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Parameterized Algorithms for Eccentricity Shortest Path Problem.
Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

Burn and Win.
Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less.
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.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
On the complexity of singly connected vertex deletion.
Theor. Comput. Sci., 2022

A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs.
SIAM J. Discret. Math., 2022

A Polynomial Kernel for Bipartite Permutation Vertex Deletion.
Algorithmica, 2022

Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems.
Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021
Parameterized complexity of fair feedback vertex set problem.
Theor. Comput. Sci., 2021

Paths to trees and cacti.
Theor. Comput. Sci., 2021

Elimination Distance to Topological-minor-free Graphs is FPT.
CoRR, 2021

Odd Cycle Transversal in Mixed Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

An FPT Algorithm for Elimination Distance to Bounded Degree Graphs.
Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

A Polynomial Kernel for Bipartite Permutation Vertex Deletion.
Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

Circumventing Connectivity for Kernelization.
Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

2020
Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized.
Theory Comput. Syst., 2020

Parameterized Complexity of Conflict-Free Matchings and Paths.
Algorithmica, 2020

Parameterized Complexity of Feedback Vertex Sets on Hypergraphs.
Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

2019
Exact and Approximate Digraph Bandwidth.
Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

2018
Conflict Free Feedback Vertex Set: A Parameterized Dichotomy.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Exploring the Kernelization Borders for Hitting Cycles.
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.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2018

Hitting and Covering Partially.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018


  Loading...