Bidimensionality and parameterized algorithms (invited talk)

DOI10.4230/LIPICS.IPEC.2015.1MaRDI QIDQ5363755zbMATH OpenOpenAlexFDO

Authors Dimitrios M. Thilikos

Publication date 29 September 2017

Full work available at URL https://doi.org/10.4230/LIPIcs.IPEC.2015.1

zbMATH Keywords

graph minorskernelizationparameterized algorithmsbidimensionalitylinear kernelssubexponential FPT-algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• Bidimensionality and kernels
• Bidimensionality and kernels
• Algorithmic Graph Minors and Bidimensionality
• The Bidimensional Theory of Bounded-Genus Graphs
• Mathematical Foundations of Computer Science 2004

Cited in

(14)

• Compactors for parameterized counting problems
• Bidimensionality: new connections between FPT algorithms and PTASs
• Coverability and sub-exponential parameterized algorithms in planar graphs
• Computational study on bidimensionality theory based algorithm for longest path problem
• Contraction bidimensionality of geometric intersection graphs
• A Retrospective on (Meta) Kernelization
• Bidimensional Parameters and Local Treewidth
• Graph minors and parameterized algorithm design
• Contraction Bidimensionality: The Accurate Picture
• Mathematical Foundations of Computer Science 2004
• Bidimensionality and kernels
• Subexponential Parameterized Algorithms
• Graph Drawing
• Bidimensionality and kernels

This page was built for publication: Bidimensionality and parameterized algorithms (invited talk)

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