XNLP-hardness of parameterized problems on planar graphs

DOI10.1007/978-3-031-75409-8_8MaRDI QIDQ6988725zbMATH OpenFDO

Authors Hans L. Bodlaender, Krisztina Szilágyi

Publication date 2 May 2025

zbMATH Keywords

parameterized complexityplanar graphsouterplanarityXNLPXALP

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

This page was built for publication: XNLP-hardness of parameterized problems on planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6988725)