Subexponential Parameterized Algorithms for Hitting Subgraphs

Lokshtanov, D., Panolan, F. orcid.org/0000-0001-6213-8687, Saurabh, S. et al. (2 more authors) (Accepted: 2025) Subexponential Parameterized Algorithms for Hitting Subgraphs. In: The 57th ACM Symposium on Theory of Computing (STOC 2025). The 57th ACM Symposium on Theory of Computing (STOC 2025), 23-27 Jun 2025, Prague, Czech Republic. ACM (In Press)

Metadata

Item Type: Proceedings Paper
Authors/Creators:
Copyright, Publisher and Additional Information:

© Owner/Author | ACM 2025. This is the author's version of the work. It is posted here for your personal use. Not for redistribution. The definitive Version of Record will be published in The 57th ACM Symposium on Theory of Computing (STOC 2025), https://doi.org/10.1145/3717823.3718192.
Keywords: Subgraph hitting, Subexponential parameterized algorithms, Separators, Generalized coloring numbers
Dates:
  • Accepted: 31 January 2025
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds)
Depositing User: Symplectic Publications
Date Deposited: 14 Apr 2025 12:43
Last Modified: 21 May 2025 14:44
Status: In Press
Publisher: ACM
Identification Number: 10.1145/3717823.3718192
Open Archives Initiative ID (OAI ID):

Export

Statistics


CORE (COnnecting REpositories)