Saket Saurabh

Connected Dominating Set on Semi-Ladder-Free Graphs

We study \textsc{Connected Dominating Set} on graphs whose closed-neighborhood set systems are $d$-semi-ladder-free. This structural condition strictly generalizes the biclique-free setting and provides a natural regime for connectivity-constrained domination. We obtain both a fixed-parameter algorithm and an approxima...

The Parameterized Complexity of Maximum Span on Natural Matroid Classes

From One Solution to Many: An Oracle-Based FPT Framework for Diverse Solutions under Generalized Diversity Measures

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.