1 citations · 1 across the 10 of their papers we have counts for
Showing 2026 · cs.DSShow all
3 papers · 2 filters
cs.DS2026
Eccentricity Shortest Path: the structural parameter landscape
Anand Babu, Ashwin Jacob, Hitendra Kumar +1
The Eccentricity Shortest Path problem asks, given a connected graph and a nonnegative integer , whether some shortest path is within distance of every vertex. We study its…
cs.DS2026
On the Parameterized Complexity of Conflict-Free Edge Cut in Undirected Graphs
Sourav Das, Ashwin Jacob, Arpit Kumar +1
In this paper, we study CONFLICT-FREE EDGE CUT (CF-CUT), which is a recently introduced conflict-free version of the MIN-CUT problem that asks to find the minimum number of edges t…
cs.DS2026
A Polynomial Kernel for Vertex Deletion to the Scattered Class of Proper Interval Graph and Trees
Ashwin Jacob, Arpit Kumar, Diptapriyo Majumdar
Vertex deletion to the hereditary graph class has been well-studied in parameterized complexity. Vertex deletion in scattered graph classes has attracted attention in recent years.…