Skip to main content

8 Result(s)

within Pallavi Jain Remove this filter Algorithm Analysis and Problem Complexity Remove this filter

and

  1. No Access

    Article

    Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules

    Multiwinner elections have proven to be a fruitful research topic with many real-world applications. We contribute to this line of research by improving the state of the art regarding the computational complex...

    Sushmita Gupta, Pallavi Jain, Saket Saurabh, Nimrod Talmon in Algorithmica (2023)

  2. No Access

    Chapter and Conference Paper

    Gehrlein Stable Committee with Multi-modal Preferences

    Inspired by Gehrlein stability in multiwinner election, in this paper, we define several notions of stability that are applicable in multiwinner elections with multimodal preferences, a model recently proposed...

    Sushmita Gupta, Pallavi Jain, Daniel Lokshtanov, Sanjukta Roy… in Algorithmic Game Theory (2022)

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

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

  5. No Access

    Chapter and Conference Paper

    Vertex Deletion on Split Graphs: Beyond 4-Hitting Set

    In vertex deletion problems on graphs, the task is to find a set of minimum number of vertices whose deletion results in a graph with some specific property. The class of vertex deletion problems contains seve...

    Pratibha Choudhary, Pallavi Jain, R. Krithika, Vibha Sahlot in Algorithms and Complexity (2019)

  6. No Access

    Chapter and Conference Paper

    Quadratic Vertex Kernel for Split Vertex Deletion

    A graph is called a split graph if its vertex set can be partitioned into a clique and an independent set. Split graphs have rich mathematical structure and interesting algorithmic properties making it one of ...

    Akanksha Agrawal, Sushmita Gupta, Pallavi Jain, R. Krithika in Algorithms and Complexity (2019)

  7. No Access

    Chapter and Conference Paper

    Hitting and Covering Partially

    d-Hitting Set and d-Set Cover are among the classical NP-hard problems. In this paper, we study variants of d-Hitting Set and d-Set Cover, which are called Partial d -Hitting Set (Partial

    Akanksha Agrawal, Pratibha Choudhary, Pallavi Jain… in Computing and Combinatorics (2018)

  8. No Access

    Chapter and Conference Paper

    Mixed Dominating Set: A Parameterized Perspective

    In the mixed dominating set (mds) problem, we are given an n-vertex graph G and a positive integer k, and the objective is to decide whether there exists a set

    Pallavi Jain, M. Jayakrishnan, Fahad Panolan… in Graph-Theoretic Concepts in Computer Scien… (2017)