External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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

Dhanyamol Antony, Sagartanu Pal, R. B. Sandeep, R. Subashini. Cutting a Tree with Subgraph Complementation is Hard, Except for Some Small Trees. In Armando Castañeda, Francisco Rodríguez-Henríquez, editors, LATIN 2022: Theoretical Informatics - 15th Latin American Symposium, Guanajuato, Mexico, November 7-11, 2022, Proceedings. Volume 13568 of Lecture Notes in Computer Science, pages 3-19, Springer, 2022. [doi]

Authors

Dhanyamol Antony

This author has not been identified. Look up 'Dhanyamol Antony' in Google

Sagartanu Pal

This author has not been identified. Look up 'Sagartanu Pal' in Google

R. B. Sandeep

This author has not been identified. Look up 'R. B. Sandeep' in Google

R. Subashini

This author has not been identified. Look up 'R. Subashini' in Google
runs on