3 papers
cs.DS2020
Recognizing -Clique Extendible Orderings
Mathew Francis, Rian Neogi, Venkatesh Raman
A graph is -clique-extendible if there is an ordering of the vertices such that whenever two -sized overlapping cliques and have common vertices, and these comm…
cs.DS2020
On the Parameterized Complexity of Deletion to -free Strong Components
Rian Neogi, M. S. Ramanujan, Saket Saurabh +1
{\sc Directed Feedback Vertex Set (DFVS)} is a fundamental computational problem that has received extensive attention in parameterized complexity. In this paper, we initiate the s…
cs.DS2018
Tractability of Konig Edge Deletion Problems
Diptapriyo Majumdar, Rian Neogi, Venkatesh Raman +1
A graph is said to be a Konig graph if the size of its maximum matching is equal to the size of its minimum vertex cover. The Konig Edge Deletion problem asks if in a given graph t…