Collaborating with Hans: Some Remaining Wonderments

DOI10.1007/978-3-030-42071-0_2MaRDI QIDQ5042446zbMATH OpenOpenAlexFDO

Authors Michael R. Fellows, Frances 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

zbMATH Keywords

functorial FPTparameterized complexity

Mathematics Subject Classification ID

Computer science (68-XX)

Cites work

• Color-coding
• Cutting up is hard to do: the parameterised complexity of k-cut and related problems
• Fundamentals of parameterized complexity
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1507224 (Why is no real title available?)
• scientific article; zbMATH DE number 867680 (Why is no real title available?)
• scientific article; zbMATH DE number 7650282 (Why is no real title available?)
• On computing graph minor obstruction sets
• Ordering by Divisibility in Abstract Algebras
• Parameterized algorithms for the independent set problem in some hereditary graph classes
• Parameterized complexity of connected induced subgraph problems
• What Is Known About Vertex Cover Kernelization?

Cited in

(6)

• From the \(W\)-hierarchy to XNLP. Classes of fixed parameter intractability
• Parameterized complexity of \textsc{bandwidth} of \textsc{caterpillars} and \textsc{weighted path emulation}
• M. K. Venkatesha Murthy and G. Stampacchia: A Beautiful Collaboration
• On the parameterized complexity of the structure of lineal topologies (depth-first spanning trees) of finite graphs: the number of leaves
• scientific article; zbMATH DE number 7764095 (Why is no real title available?)
• Does subset sum admit short proofs?

This page was built for publication: Collaborating with Hans: Some Remaining Wonderments

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