Conference
2026
The Parameterized Complexity of Maximum Span on Natural Matroid Classes
Madhumita Kundu, Ashutosh Rai, Sahiba et al.
· International Symposium on M... · 0 citations
2 papers indexed here
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
The framework unifies and strengthens previous oracle-based approaches, and recovers fixed-parameter tractable algorithms for all problems covered by that framework, with improved oracle complexity, and obtain strong bounds for diverse variants of classical graph and matroid problems.
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.