3 citations · 3 across the 4 of their papers we have counts for
5 papers · 1 filter
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 and a non-negative integer , is there a common subgraph on at least …
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 and robots, determine whether any arbitrary config…
Structural Parameterization for Graph Deletion Problems over Data Streams
Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay +2
The study of parameterized streaming complexity on graph problems was initiated by Fafianie et al. (MFCS'14) and Chitnis et al. (SODA'15 and SODA'16). Simply put, the main goal is…
Parameterized Complexity of Conflict-free Graph Coloring
Hans L. Bodlaender, Sudeshna Kolay, Astrid Pieterse
Given a graph G, a q-open neighborhood conflict-free coloring or q-ONCF-coloring is a vertex coloring such that for each vertex t…
Parameterized Algorithms for Deletion to (r,l)-graphs
Sudeshna Kolay, Fahad Panolan
For fixed integers , a graph is called an {\em -graph} if the vertex set can be partitioned into independent sets and cliques. This b…