Skip to main content

4 Result(s)

within Lawqueen Kanesh Remove this filter Mathematics of Computing Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    On the Parameterized Complexity of Minus Domination

    Dominating Set is a well-studied combinatorial problem. Given a graph \(G=(V,E)\) G ...

    Sriram Bhyravarapu, Lawqueen Kanesh… in SOFSEM 2024: Theory and Practice of Comput… (2024)

  2. No Access

    Article

    A Polynomial Kernel for Bipartite Permutation Vertex Deletion

    In a permutation graph, vertices represent the elements of a permutation, and edges represent pairs of elements that are reversed by the permutation. In the Permutation Vertex Deletion problem, given an undirecte...

    Jan Derbisz, Lawqueen Kanesh, Jayakrishnan Madathil, Abhishek Sahu… in Algorithmica (2022)

  3. No Access

    Article

    Parameterized Complexity of Conflict-Free Matchings and Paths

    An input to a conflict-free variant of a classical problem \(\Gamma \)Γ, called Conflict-Free\(\Gamma \)Γ, consists of an instance I of \(\Gamma \)Γ coupled with a graph H, called the conflict graph. A solution t...

    Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Saket Saurabh in Algorithmica (2020)

  4. No Access

    Chapter and Conference Paper

    Parameterized Complexity of Fair Feedback Vertex Set Problem

    Given a graph \(G=(V,E)\), a subset \(S\subseteq V(G)\) is said to be a feedback vertex set of G if \(G-S\) is a forest. In the Feedback Vertex Set (FVS) problem, we are given an undirected graph G, and a positiv...

    Lawqueen Kanesh, Soumen Maity, Komal Muluk… in Computer Science – Theory and Applications (2020)