Dhanyamol Antony, Sagartanu Pal, R. B. Sandeep, R. Subashini. Cutting a Tree with Subgraph Complementation is Hard, Except for Some Small Trees. In Armando Castañeda, Francisco Rodríguez-Henríquez, editors, LATIN 2022: Theoretical Informatics - 15th Latin American Symposium, Guanajuato, Mexico, November 7-11, 2022, Proceedings. Volume 13568 of Lecture Notes in Computer Science, pages 3-19, Springer, 2022. [doi]
Abstract is missing.