Treewidth, kernels, and algorithms. Essays dedicated to Hans L. Bodlaender on the occasion of his 60th birthday

DOI10.1007/978-3-030-42071-0zbMATH Open1496.68018OpenAlexW3034620713MaRDI QIDQ2152673

Author name not available (Why is that?)

Publication date: 10 July 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-42071-0

Mathematics Subject Classification ID

Biographies, obituaries, personalia, bibliographies (01A70) Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) History of computer science (68-03)

Related Items (2)

Parameterized problems complete for nondeterministic FPT time and logarithmic space ⋮ AntiFactor is FPT parameterized by treewidth and list size (but counting is hard)

This page was built for publication: Treewidth, kernels, and algorithms. Essays dedicated to Hans L. Bodlaender on the occasion of his 60th birthday

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