Sensitivity, proximity and FPT algorithms for exact matroid problems

DOI10.1109/FOCS61266.2024.00100MaRDI QIDQ7286974zbMATH OpenFDO

Authors Friedrich Eisenbrand, Lars Rohwedder, Karol Węgrzycki

Publication date 23 June 2026

Full work available at URL https://doi.org/10.1109/FOCS61266.2024.00100

Mathematics Subject Classification ID

Computer science (68-XX)

This page was built for publication: Sensitivity, proximity and FPT algorithms for exact matroid problems

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