Dhanyamol Antony

According to our database, Dhanyamol Antony authored at least 10 papers between 2021 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Hardness of Burning Number Problem on Regular Graphs.

Dhanyamol Antony, L. Sunil Chandran, Anita Das, Shirish Gosavi, Dalu Jacob, Shashanka Kulamarva

CoRR, May, 2026

Parameterized Algorithms for k-Inversion.

Dhanyamol Antony, L. Sunil Chandran, Dalu Jacob, R. B. Sandeep

Proceedings of the Combinatorial Algorithms - 37th International Workshop, 2026

2025

Algorithms for subgraph complementation to some classes of graphs.

Dhanyamol Antony, Sagartanu Pal, R. B. Sandeep

Inf. Process. Lett., 2025

2024

Spanning caterpillar in biconvex bipartite graphs.

Dhanyamol Antony, Anita Das, Shirish Gosavi, Dalu Jacob, Shashanka Kulamarva

Discret. Appl. Math., 2024

Graph Burning: Bounds and Hardness.

Dhanyamol Antony, Anita Das, Shirish Gosavi, Dalu Jacob, Shashanka Kulamarva

CoRR, 2024

Switching Classes: Characterization and Computation.

Dhanyamol Antony, Yixin Cao, Sagartanu Pal, R. B. Sandeep

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

Total Domination, Separated-Cluster, CD-Coloring: Algorithms and Hardness.

Dhanyamol Antony, L. Sunil Chandran, Ankit Gayen, Shirish Gosavi, Dalu Jacob

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

2023

Total Domination, Separated Clusters, CD-Coloring: Algorithms and Hardness.

Dhanyamol Antony, L. Sunil Chandran, Ankit Gayen, Shirish Gosavi, Dalu Jacob

CoRR, 2023

2022

Cutting a Tree with Subgraph Complementation is Hard, Except for Some Small Trees.

Dhanyamol Antony, Sagartanu Pal, R. B. Sandeep, R. Subashini

Proceedings of the LATIN 2022: Theoretical Informatics, 2022

2021

On Subgraph Complementation to H-free Graphs.

Dhanyamol Antony, Jay Garchar, Sagartanu Pal, R. B. Sandeep, Sagnik Sen, R. Subashini

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021