Boundaried kernelization via representative sets

DOI10.4230/LIPICS.IPEC.2025.6MaRDI QIDQ7356322zbMATH OpenFDO

Authors Leonid Antipov, Stefan Kratsch

Publication date 23 September 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.IPEC.2025.6

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parameterized complexity, tractability and kernelization (68Q27) Algorithms in computer science (68Wxx)

Cites work

• (Meta) kernelization
• A parameterized view on matroid optimization problems
• A structural approach to kernels for ILPs: treewidth and total unimodularity
• Abusing the Tutte matrix: an algebraic instance compression for the K-set-cycle problem
• Applications of Menger's graph theorem
• Compression via Matroids
• Finding odd cycle transversals.
• FPT algorithms for path-transversal and cycle-transversal problems
• Graph theory (to appear)
• Kernelization. Theory of parameterized preprocessing
• Kernels for (connected) dominating set on graphs with excluded topological minors
• Parameterized algorithms
• Recent developments in kernelization: a survey
• Representative sets and irrelevant vertices: new tools for kernelization
• Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter

This page was built for publication: Boundaried kernelization via representative sets

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