Collaborating with Hans: Some Remaining Wonderments
From MaRDI portal
Publication:5042446
DOI10.1007/978-3-030-42071-0_2OpenAlexW3018618271MaRDI QIDQ5042446
Michael R. Fellows, Frances A. Rosamond
Publication date: 19 October 2022
Published in: Treewidth, Kernels, and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-42071-0_2
Related Items (4)
From the \(W\)-hierarchy to XNLP. Classes of fixed parameter intractability ⋮ Parameterized complexity of \textsc{bandwidth} of \textsc{caterpillars} and \textsc{weighted path emulation} ⋮ On the parameterized complexity of the structure of lineal topologies (depth-first spanning trees) of finite graphs: the number of leaves ⋮ Unnamed Item
Cites Work
- Fundamentals of parameterized complexity
- On computing graph minor obstruction sets
- Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes
- Color-coding
- Parameterized Complexity of Connected Induced Subgraph Problems
- Ordering by Divisibility in Abstract Algebras
- What Is Known About Vertex Cover Kernelization?
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Collaborating with Hans: Some Remaining Wonderments
