| On subgraph complementation to H-free graphs D Antony, J Garchar, S Pal, RB Sandeep, S Sen, R Subashini Algorithmica 84 (10), 2842-2870, 2022 | 3 | 2022 |
| Spanning caterpillar in biconvex bipartite graphs D Antony, A Das, S Gosavi, D Jacob, S Kulamarva arXiv preprint arXiv:2312.10956, 2023 | 1 | 2023 |
| Cutting a tree with subgraph complementation is hard, except for some small trees D Antony, S Pal, RB Sandeep, R Subashini Latin American Symposium on Theoretical Informatics, 3-19, 2022 | 1 | 2022 |
| Switching Classes: Characterization and Computation D Antony, Y Cao, S Pal, RB Sandeep arXiv preprint arXiv:2403.04263, 2024 | | 2024 |
| Total Domination, Separated-Cluster, CD-Coloring: Algorithms and Hardness D Antony, LS Chandran, A Gayen, S Gosavi, D Jacob Latin American Symposium on Theoretical Informatics, 97-113, 2024 | | 2024 |
| Graph Burning: Bounds and Hardness D Antony, A Das, S Gosavi, D Jacob, S Kulamarva arXiv preprint arXiv:2402.18984, 2024 | | 2024 |
| Algorithms and Discrete Applied Mathematics: 10th International Conference, CALDAM 2024, Bhilai, India, February 15–17, 2024, Proceedings S Kalyanasundaram, A Maheshwari Springer Nature, 2024 | | 2024 |
| Algorithms for subgraph complementation to some classes of graphs D Antony, S Pal, RB Sandeep arXiv preprint arXiv:2303.15873, 2023 | | 2023 |
| On Subgraph Complementation to H-free Graphs S Sen, R Subashini Graph-Theoretic Concepts in Computer Science: 47th International Workshop …, 2021 | | 2021 |
