15 citations · 20 across the 14 of their papers we have counts for
16 papers
Towards a conjecture on long induced rainbow paths in triangle-free graphs
N. R. Aravind, Shiwali Gupta, Rogers Mathew
Given a triangle-free graph with chromatic number and a proper vertex coloring of , it is conjectured that contains an induced rainbow path on vertices under…
The Parameterized Complexity of Terminal Monitoring Set
N. R. Aravind, Roopam Saxena
In Terminal Monitoring Set (TMS), the input is an undirected graph , together with a collection of terminal pairs and the goal is to find a subset of minimum size…
Line-Constrained -Semi-Obnoxious Facility Location
Vishwanath R. Singireddy, Manjanna Basappa, N. R. Aravind
Suppose we are given a set of blue points and a set of red points, all lying above a horizontal line , in the plane. Let the weight of a given point $p_i\in…
Parameterized Complexity of Path Set Packing
N. R. Aravind, Roopam Saxena
In Path Set Packing, the input is an undirected graph , a collection $\calp$ of simple paths in , and a positive integer . The problem is to decide whether there exist …
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…
Perfectly Matched Sets in Graphs: Parameterized and Exact Computation
N. R. Aravind, Roopam Saxena
In an undirected graph , we say is a pair of perfectly matched sets if and are disjoint subsets of and every vertex in (resp. ) has exactly one…