Skip to main content

3 Result(s)

within Article Remove this filter Lawqueen Kanesh Remove this filter

and

  1. 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)

  2. No Access

    Article

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

    Let π be a family of graphs. In the classical π-Vertex Deletion problem, given a graph G and a positive integer k, the objective is to check whether there exists a subset S of at most k vertices such that G − S i...

    Pallavi Jain, Lawqueen Kanesh, Pranabendu Misra in Theory of Computing Systems (2020)

  3. 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)