DA
DHANYAMOL ANTONY
Indian Institute of Science Education and Research Thiruvananthapuram, National Institute of Technology Calicut
Research areas: Computer Science · Computational Theory and Mathematics · Advanced Graph Theory Research · Complexity and Algorithms in Graphs · Limits and Structures in Graph Theory
0000-0001-7875-3457
Employment
-
Indian Institute of Science Education and Research Thiruvananthapuram Assistant Pofessor2024 - Present
Education
-
National Institute of Technology Calicut PhD scholar2017 - 2023
Projects & Funding
Projects & funding information is unavailable.
Publications (9)
- Algorithms for subgraph complementation to some classes of graphs Save
- Spanning caterpillar in biconvex bipartite graphs Save
- Cutting a tree with subgraph complementation is hard, except for some small trees Save
- Switching Classes: Characterization and Computation Save
- Total Domination, Separated-Cluster, CD-Coloring: Algorithms and Hardness Save
- Algorithms for subgraph complementation to some classes of graphs Save
- On Subgraph Complementation to H-free Graphs Save
- Cutting a Tree with Subgraph Complementation is Hard, Except for Some Small Trees Save
- On Subgraph Complementation to H-free Graphs Save