Skip to main content

4 Result(s)

within Article Remove this filter Pallavi Jain Remove this filter Computer Science 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

    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

    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

    Article

    Gehrlein stability in committee selection: parameterized hardness and algorithms

    In a multiwinner election based on the Condorcet criterion, we are given a set of candidates, and a set of voters with strict preference rankings over the candidates. A committee is weakly Gehrlein stable (WGS) i...

    Sushmita Gupta, Pallavi Jain, Sanjukta Roy… in Autonomous Agents and Multi-Agent Systems (2020)