15 citations · 15 across the 4 of their papers we have counts for
3 papers · 1 filter
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…
Bipartitioning Problems on Graphs with Bounded Tree-Width
N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare
For an undirected graph G, we consider the following problems: given a fixed graph H, can we partition the vertices of G into two non-empty sets A and B such that neither the induc…
Algorithms and hardness results for happy coloring problems
N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare +1
In a vertex-colored graph, an edge is happy if its endpoints have the same color. Similarly, a vertex is happy if all its incident edges are happy. Motivated by the computation of…