Blar i Bergen Open Research Archive på forfatter "Ramanujan, M.S."
-
On the Complexity of Recovering Incidence Matrices
Fomin, Fedor; Golovach, Petr; Misra, Pranabendu; Ramanujan, M.S. (Journal article; Peer reviewed, 2020)The incidence matrix of a graph is a fundamental object naturally appearing in many applications, involving graphs such as social networks, communication networks, or transportation networks. Often, the data collected about ... -
On the parameterized complexity of deletion to H-free strong components
Neogi, Rian; Ramanujan, M.S.; Saurabh, Saket; Sharma, Roohani (Journal article; Peer reviewed, 2020)Directed Feedback Vertex Set (DFVS) is a fundamental computational problem that has received extensive attention in parameterized complexity. In this paper, we initiate the study of a wide generalization, the H-SCC Deletion ...