On the complexity of problems on tree-structured graphs

DOI10.4230/LIPICS.IPEC.2022.6MaRDI QIDQ6969006zbMATH OpenFDO

Authors Hans L. Bodlaender, Carla Groenland, H. Jacob, Marcin Pilipczuk, Michał Pilipczuk

Publication date 23 June 2025

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

treewidthparameterized complexityXNLPXALP

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx) Parameterized complexity, tractability and kernelization (68Q27)

This page was built for publication: On the complexity of problems on tree-structured graphs

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