Author of the publication

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

, , , , and . LATIN (1), volume 14578 of Lecture Notes in Computer Science, page 97-113. Springer, (2024)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

On Subgraph Complementation to H-free Graphs., , , , , and . Algorithmica, 84 (10): 2842-2870 (2022)Cutting a Tree with Subgraph Complementation is Hard, Except for Some Small Trees., , , and . LATIN, volume 13568 of Lecture Notes in Computer Science, page 3-19. Springer, (2022)Algorithms for subgraph complementation to some classes of graphs., , and . Inf. Process. Lett., (2025)Total Domination, Separated-Cluster, CD-Coloring: Algorithms and Hardness., , , , and . LATIN (1), volume 14578 of Lecture Notes in Computer Science, page 97-113. Springer, (2024)Spanning caterpillar in biconvex bipartite graphs., , , , and . Discret. Appl. Math., (2024)Switching Classes: Characterization and Computation., , , and . MFCS, volume 306 of LIPIcs, page 11:1-11:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)On Subgraph Complementation to H-free Graphs., , , , , and . WG, volume 12911 of Lecture Notes in Computer Science, page 118-129. Springer, (2021)