Finding large induced sparse subgraphs in c >t -free graphs in quasipolynomial time

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Peter Gartland, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk, Paweł Rzążewski

Journal title: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing

Journal publisher: ACM

Published year: 2021

Published pages: 330-341

DOI identifier: 10.1145/3406325.3451034

ISBN: 9781450380539