22 citations · 73 across the 32 of their papers we have counts for
4 papers · 1 filter
On the Complexity of the Eigenvalue Deletion Problem
Neeldhara Misra, Harshil Mittal, Saket Saurabh +1
For any fixed positive integer and a given budget , the -\textsc{Eigenvalue Vertex Deletion} (-EVD) problem asks if a graph admits a subset of at most vert…
Parameterized Aspects of Distinct Kemeny Rank Aggregation
Koustav De, Harshil Mittal, Palash Dey +1
The Kemeny method is one of the popular tools for rank aggregation. However, computing an optimal Kemeny ranking is NP-hard. Consequently, the computational task of finding a Kemen…
Spartan Bipartite Graphs are Essentially Elementary
Neeldhara Misra, Saraswati Girish Nanoti
We study a two-player game on a graph between an attacker and a defender. To begin with, the defender places guards on a subset of vertices. In each move, the attacker attacks an e…
The Price of Equity with Binary Valuations and Few Agent Types
Umang Bhaskar, Neeldhara Misra, Aditi Sethia +1
In fair division problems, the notion of price of fairness measures the loss in welfare due to a fairness constraint. Prior work on the price of fairness has focused primarily on e…