Algorithms, Complexity, and Hans

DOI10.1007/978-3-030-42071-0_4MaRDI QIDQ5042448zbMATH OpenOpenAlexFDO

Authors J. Van Leeuwen

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_4

zbMATH Keywords

algorithmscomputational complexitygraphsnetworksparameterized complexitystructural algorithmicstreewidth

Mathematics Subject Classification ID

Computer science (68-XX)

Recommendations

• Hans Bodlaender and the Theory of Kernelization Lower Bounds
• Preface: Special issue in honor of the 60th birthday of Prof. Gad M. Landau
• Landmarks in Algorithmic Graph Theory: A Personal Retrospective
• Preface: Taming randomness and complexity -- essays in honour of Professor Péter Gács

Cites work

• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
• Diameter increase caused by edge deletion
• Distributed algorithms. 8th international workshop, WDAG 1994, Terschelling, The Netherlands, September 29 -- October 1, 1994. Proceedings
• Graph minors. I. Excluding a forest
• Graph minors. II. Algorithmic aspects of tree-width
• scientific article; zbMATH DE number 4028858 (Why is no real title available?)
• scientific article; zbMATH DE number 4060712 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 1507224 (Why is no real title available?)
• Infeasibility of instance compression and succinct PCPs for NP
• NC-algorithms for graphs with small treewidth
• On interval routing schemes and treewidth
• On problems without polynomial kernels
• Simulation of large networks on smaller networks

This page was built for publication: Algorithms, Complexity, and Hans

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