Skip to content

Author

Fahad Panolan

We have 3 of 139 papers

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.

Preprint Nov 2026

Vertex Deletion on $H$-Induced-Minor-Free Graphs: Subexponential FPT Algorithms and Approximation Schemes

We study vertex-deletion problems on string graphs and, more generally, on graphs excluding a fixed graph as an induced minor. For every fixed graph $H$, fixed nonnegative integer $t$, and fixed monadic second-order formula $\phi$, we consider the problem of finding a minimum-cardinality set $S$ such that $G-S$ has tre...

D. Lokshtanov, Fahad Panolan, Saket Saurabh et al. · 0 citations
Sep 2026

Vertex-Coloring Edge-Weighting: Kernelization and Generalization

This work shows that both pre-weighted problems have polynomial kernels when parameterized by $k, and shows that both problems are W[1]-hard parameterized by treedepth, answering another question from earlier work.

Shubhada Aute, Fahad Panolan, Geevarghese Philip · 0 citations
Preprint Sep 2026

Counting Paths and Trees via Exterior Algebra

These algorithms combine exterior algebra with random matrix estimators, using the tensor-train moment bound of Rakhshan and Rabusseau~[AISTATS 2020].

Fahad Panolan, Saket Saurabh, M. Zehavi et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.