On the Complexity of Singly Connected Vertex Deletion

Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk, Nidhi Purohit, Saket Saurabh 0001. On the Complexity of Singly Connected Vertex Deletion. In Leszek Gasieniec, Ralf Klasing, Tomasz Radzik, editors, Combinatorial Algorithms - 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8-10, 2020, Proceedings. Volume 12126 of Lecture Notes in Computer Science, pages 237-250, Springer, 2020. [doi]

Abstract

Abstract is missing.