Skip to main content

2 Result(s)

within Lawqueen Kanesh Remove this filter Symbolic and Algebraic Manipulation 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

    Chapter and Conference Paper

    Circumventing Connectivity for Kernelization

    Classical vertex subset problems demanding connectivity are of the following form: given an input graph G on n vertices and an integer k, find a set S of at most k vertices that satisfies a property and G[S] is c...

    Pallavi Jain, Lawqueen Kanesh, Shivesh Kumar Roy… in Algorithms and Complexity (2021)