A. Dhar

collaborators

Showing cs.CCShow all

2 papers · 1 filter

cs.CC2026

Parameterized Complexity of Finding a Maximum Common Vertex Subgraph Without Isolated Vertices

Palash Dey, Anubhav Dhar, Ashlesha Hota +2

In this paper, we study the Maximum Common Vertex Subgraph problem: Given two input graphs $G_{1}, G_{2}$ and a non-negative integer $h$ , is there a common subgraph $H$ on at least $h$ …

cs.CC2026

Universal Solvability for Robot Motion Planning on Graphs

Anubhav Dhar, Pranav Nyati, Tanishq Prasad +2

We study the Universal Solvability of Robot Motion Planning on Graphs (USolR) problem: given an undirected graph $G = (V, E)$ and $p$ robots, determine whether any arbitrary config…