International Journal Articles 

1. Dhanyamol Antony, Sagartanu Pal, and R. B. Sandeep. “Algorithms for subgraph complementation to some classes of graphs”, Information Processing Letters, 188: 2024. https://doi.org/10.1016/j.ipl.2024.106530
2. Dhanyamol Antony, Sagartanu Pal, R. B. Sandeep, and R. Subashini. “Cutting a tree with Subgraph Complementation is hard, except for some small trees”, Journal of Graph Theory, 107: 126–168, 2024. https://doi.org/10.1002/jgt.23112
3. Dhanyamol Antony, Anita Das, Shirish Gosavi, Shashanka Kulamarva, and Dalu Jacob. “Spanning caterpillar in biconvex bipartite graphs”, Discrete Applied Mathematics, 356, 32-36, 2024. https://doi.org/10.1016/j.dam.2024.05.016
4. Dhanyamol Antony, Jay Garchar, Sagartanu Pal, R. B. Sandeep, Sagnik Sen, and R. Subashini. “On subgraph complementation to H-free graphs”, Algorithmica, 84(10): 2842–2870, 2022. https://doi.org/10.1007/s00453-022-00991-3 

International Conference Publications 

1. Dhanyamol Antony, Yixin Cao, Sagartanu Pal, and R. B. Sandeep. “Switching Classes: Characterization and Computation”, 49th International Symposium on Mathematical Foundations of Computer Science, MFCS 2024,  Bratislava, Slovakia, Leibniz International Proceedings in Informatics (LIPIcs), 306, pages 11:1-11:15. 10.4230/LIPIcs.MFCS.2024.11
2. Dhanyamol Antony, L. Sunil Chandran, Ankit Gayen, Shirish Gosavi, and Dalu Jacob. “Total Domination, Separated Clusters, CD-Coloring: Algorithms and Hardness”.  In Proceedings of Theoretical Informatics - 16th Latin American Symposium LATIN 2024, Puerto Varas, Chile, LNCS, Springer, pages 97-113. https://doi.org/10.1007/978-3-031-55598-5
3. Dhanyamol Antony, Sagartanu Pal, and R. B. Sandeep. “Algorithms for subgraph complementation to some classes of graphs”. In Proceedings of Theoretical Informatics - 15th European Conference on Combinatorics, Graph Theory and Applications; Eurocomb 2023, Prague, Czech Republic, Proceedings pages 42–49. https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-006
4. Dhanyamol Antony, Sagartanu Pal, R. B. Sandeep, and R. Subashini. “Cutting a tree with subgraph complementation is hard, except for some small trees”. In Proceedings of Theoretical Informatics - 15th Latin American Symposium LATIN 2022, Guanajuato, Mexico, Proceedings pages 3–19. Springer, 2022.https://doi.org/10.1007/978-3-031-20624-5_1
5. Dhanyamol Antony, Jay Garchar, Sagartanu Pal, R. B. Sandeep, Sagnik Sen, and R. Subashini. “On subgraph complementation to H-free graphs”. In Graph-Theoretic Concepts in Computer Science - 47th International Workshop, WG 2021, Warsaw, Poland, pages 118–129. Springer, 2021. https://doi.org/10.1007/978-3-030-86838-3_9