scientific article; zbMATH DE number 7650914

DOI10.4230/LIPICS.STACS.2020.29MaRDI QIDQ5874302zbMATH OpenFDO

Authors Falko Hegerfeld, Stefan Kratsch

Publication date 7 February 2023

Full work available at URL https://arxiv.org/abs/2001.05364

zbMATH Keywords

connectivityCut\&Countparameterized complexitypolynomial spacetreedepth

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(13)

• Problems Parameterized by Treewidth Tractable in Single Exponential Time: A Logical Approach
• Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
• On the lossy kernelization for connected treedepth deletion set
• Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space
• Computing generalized convolutions faster than brute force
• Tight Algorithms for Connectivity Problems Parameterized by Modular-Treewidth
• On the size of minimal separators for treedepth decomposition
• All paths lead to Rome
• Space-efficient parameterized algorithms on graphs of low shrubdepth
• Computing generalized convolutions faster than brute force
• Computing treedepth in polynomial space and linear FPT time
• A parameterized complexity analysis of bounded height depth-first search trees
• Tight bounds for some classical problems parameterized by cutwidth

This page was built for publication:

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