1 citations · 1 across the 4 of their papers we have counts for
6 papers · 1 filter
On the Parameterized Complexity of Diverse SAT
Neeldhara Misra, Harshil Mittal, Ashutosh Rai
We study the Boolean Satisfiability problem (SAT) in the framework of diversity, where one asks for multiple solutions that are mutually far apart (i.e., sufficiently dissimilar fr…
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…
Chess is hard even for a single player
N. R. Aravind, Neeldhara Misra, Harshil Mittal
We introduce a generalization of "Solo Chess", a single-player variant of the game that can be played on chess.com. The standard version of the game is played on a regular 8 x 8 ch…
Red-Blue Point Separation for Points on a Circle
Neeldhara Misra, Harshil Mittal, Aditi Sethia
Given a set R of red points and a set B of blue points in the plane, the Red-Blue point separation problem asks if there are at most k lines that separate R from B, that is, each c…
Imbalance Parameterized by Twin Cover Revisited
Neeldhara Misra, Harshil Mittal
We study the problem of Imbalance parameterized by the twin cover of a graph. We show that Imbalance is XP parameterized by twin cover, and FPT when parameterized by the twin cover…