Skip to content

Author

Fahad Panolan

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.

Preprint 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

We give randomized approximation algorithms for counting k-paths and k-forests in a host graph. Here k denotes the number of pattern vertices, n and m denote the numbers of host vertices and edges or arcs, {\epsilon} is the relative error, and {\delta} is the failure probability. Our main results are: 1. Paths: We appr...

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.