22 citations · 73 across the 32 of their papers we have counts for
20 papers · 1 filter
Permutation Match Puzzles: How Young Tanvi Learned About Computational Complexity
Kshitij Gajjar, Neeldhara Misra
We study a family of sorting match puzzles on grids, which we call permutation match puzzles. In this puzzle, each row and column of a grid is labeled with an ordering…
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…
Romeo and Juliet Meeting in Forest Like Regions
Neeldhara Misra, Manas Mulpuri, Prafullkumar Tale +1
The game of rendezvous with adversaries is a game on a graph played by two players: Facilitator and Divider. Facilitator has two agents and Divider has a team of agents.…
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…