Skip to main content

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

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