Quasipolynomial-time deterministic kernelization and (gammoid) representation

DOI10.4230/LIPICS.MFCS.2025.54MaRDI QIDQ7310227zbMATH OpenFDO

Authors Rohit Gurjar, Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi

Publication date 5 August 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2025.54

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A parameterized view on matroid optimization problems
• A probabilistic remark on algebraic program testing
• A randomized polynomial kernel for subset feedback vertex set
• A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter
• Bipartite perfect matching is in quasi-NC
• Efficient computation of representative families with applications in parameterized and exact algorithms
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Faster graph bipartization
• Fundamentals of parameterized complexity
• scientific article; zbMATH DE number 3651744 (Why is no real title available?)
• scientific article; zbMATH DE number 1261820 (Why is no real title available?)
• scientific article; zbMATH DE number 5047784 (Why is no real title available?)
• scientific article; zbMATH DE number 3220175 (Why is no real title available?)
• scientific article; zbMATH DE number 3232667 (Why is no real title available?)
• scientific article; zbMATH DE number 7053262 (Why is no real title available?)
• Linear matroid intersection is in quasi-NC
• Linear representation of transversal matroids and gammoids parameterized by rank
• Matching is as easy as matrix inversion
• Matching theory
• Mimicking Networks and Succinct Representations of Terminal Cuts
• Multiway cuts in node weighted graphs
• Parameterized algorithms
• Paths, Trees, and Flowers
• Powers of tensors and fast matrix multiplication
• Quasipolynomial Multicut-mimicking Networks and Kernels for Multiway Cut Problems
• Quasipolynomial representation of transversal matroids with applications in parameterized complexity
• Representative set statements for delta-matroids and the Mader delta-matroid
• Representative sets and irrelevant vertices: new tools for kernelization

This page was built for publication: Quasipolynomial-time deterministic kernelization and (gammoid) representation

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