1 citations · 1 across the 4 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.DS2023
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…
cs.DS2023★ 1 cited
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…