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]
@inproceedings{AntonyPSS22,
title = {Cutting a Tree with Subgraph Complementation is Hard, Except for Some Small Trees},
author = {Dhanyamol Antony and Sagartanu Pal and R. B. Sandeep and R. Subashini},
year = {2022},
doi = {10.1007/978-3-031-20624-5_1},
url = {https://doi.org/10.1007/978-3-031-20624-5_1},
researchr = {https://researchr.org/publication/AntonyPSS22},
cites = {0},
citedby = {0},
pages = {3-19},
booktitle = {LATIN 2022: Theoretical Informatics - 15th Latin American Symposium, Guanajuato, Mexico, November 7-11, 2022, Proceedings},
editor = {Armando Castañeda and Francisco Rodríguez-Henríquez},
volume = {13568},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-031-20624-5},
}