Fahad Panolan

781 total citations
57 papers, 205 citations indexed

About

Fahad Panolan is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Fahad Panolan has authored 57 papers receiving a total of 205 indexed citations (citations by other indexed papers that have themselves been cited), including 50 papers in Computational Theory and Mathematics, 16 papers in Computer Networks and Communications and 12 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Fahad Panolan's work include Advanced Graph Theory Research (50 papers), Complexity and Algorithms in Graphs (32 papers) and Limits and Structures in Graph Theory (12 papers). Fahad Panolan is often cited by papers focused on Advanced Graph Theory Research (50 papers), Complexity and Algorithms in Graphs (32 papers) and Limits and Structures in Graph Theory (12 papers). Fahad Panolan collaborates with scholars based in India, Norway and Israel. Fahad Panolan's co-authors include Saket Saurabh, Daniel Lokshtanov, Fedor V. Fomin, M. S. Ramanujan, Meirav Zehavi, Ashutosh Rai, Geevarghese Philip, Petr A. Golovach, Mrinal Kumar and Venkatesh Raman and has published in prestigious journals such as Journal of the ACM, Mathematical Programming and Theoretical Computer Science.

In The Last Decade

Fahad Panolan

46 papers receiving 203 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Fahad Panolan India	7	183	75	31	20	16	57	205
Eelko Penninkx Netherlands	4	145 0.8×	52 0.7×	22 0.7×	26 1.3×	10 0.6×	6	159
Geevarghese Philip India	8	158 0.9×	54 0.7×	32 1.0×	8 0.4×	15 0.9×	32	193
Frederic Dorn Norway	9	178 1.0×	75 1.0×	25 0.8×	36 1.8×	9 0.6×	16	207
Somnath Sikdar Germany	11	238 1.3×	77 1.0×	42 1.4×	12 0.6×	7 0.4×	23	264
Tamás Király Hungary	7	137 0.7×	54 0.7×	26 0.8×	31 1.6×	11 0.7×	36	193
Luérbio Faria Brazil	8	175 1.0×	61 0.8×	49 1.6×	41 2.0×	16 1.0×	56	212
Pål Grønås Drange Norway	5	135 0.7×	57 0.8×	11 0.4×	6 0.3×	7 0.4×	9	157
Vincent Bouchitté France	7	196 1.1×	88 1.2×	26 0.8×	14 0.7×	4 0.3×	15	224
Mathieu Liedloff France	11	217 1.2×	110 1.5×	39 1.3×	6 0.3×	32 2.0×	36	276
Dimitrios M. Thilikos France	7	127 0.7×	36 0.5×	43 1.4×	5 0.3×	7 0.4×	25	149

Countries citing papers authored by Fahad Panolan

Since Specialization

Citations

This map shows the geographic impact of Fahad Panolan's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Fahad Panolan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Fahad Panolan more than expected).

Fields of papers citing papers by Fahad Panolan

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Fahad Panolan. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Fahad Panolan. The network helps show where Fahad Panolan may publish in the future.

Co-authorship network of co-authors of Fahad Panolan

This figure shows the co-authorship network connecting the top 25 collaborators of Fahad Panolan. A scholar is included among the top collaborators of Fahad Panolan based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Fahad Panolan. Fahad Panolan is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Fomin, Fedor V., et al.. (2025). Packing Short Cycles. ACM Transactions on Algorithms. 22(1). 1–35.

Fomin, Fedor V., Petr A. Golovach, Fahad Panolan, Geevarghese Philip, & Saket Saurabh. (2023). Diverse collections in matroids and graphs. Mathematical Programming. 204(1-2). 415–447. 1 indexed citations

Fomin, Fedor V., Fahad Panolan, M. S. Ramanujan, & Saket Saurabh. (2022). On the optimality of pseudo-polynomial algorithms for integer programming. Mathematical Programming. 198(1). 561–593. 1 indexed citations

Fomin, Fedor V., et al.. (2021). Fixed-Parameter and Approximation Algorithms for PCA with Outliers. International Conference on Machine Learning. 2341–2351. 1 indexed citations

Panolan, Fahad, et al.. (2020). Improved FPT Algorithms for Deletion to Forest-Like Structures. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

Fomin, Fedor V., Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, & Meirav Zehavi. (2020). ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

Panolan, Fahad, et al.. (2020). Quick Separation in Chordal and Split Graphs. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics).

Fomin, Fedor V., et al.. (2020). Manipulating Districts to Win Elections: Fine-Grained Complexity. Proceedings of the AAAI Conference on Artificial Intelligence. 34(2). 1902–1909. 2 indexed citations

Knop, Dušan, et al.. (2019). Complexity of the Steiner Network Problem with Respect to the Number of Terminals. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 17. 1 indexed citations

10.

Fomin, Fedor V., Petteri Kaski, Daniel Lokshtanov, Fahad Panolan, & Saket Saurabh. (2019). Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree. SIAM Journal on Discrete Mathematics. 33(1). 327–345. 2 indexed citations

11.

Lokshtanov, Daniel, et al.. (2018). Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 94. 13. 2 indexed citations

12.

Panolan, Fahad, et al.. (2018). Harmonious coloring: Parameterized algorithms and upper bounds. Theoretical Computer Science. 772. 132–142.

13.

Lokshtanov, Daniel, Amer E. Mouawad, Fahad Panolan, M. S. Ramanujan, & Saket Saurabh. (2018). Reconfiguration on sparse graphs. Journal of Computer and System Sciences. 95. 122–131. 8 indexed citations

14.

Basavaraju, Manu, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan, & Saket Saurabh. (2018). On the kernelization complexity of string problems. Theoretical Computer Science. 730. 21–31. 3 indexed citations

15.

Panolan, Fahad, et al.. (2018). Linear representation of transversal matroids and gammoids parameterized by rank. Theoretical Computer Science. 818. 51–59. 1 indexed citations

16.

Fomin, Fedor V., Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, & Meirav Zehavi. (2017). Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk\n Graphs. arXiv (Cornell University). 3 indexed citations

17.

Lokshtanov, Daniel, et al.. (2017). Quick but Odd Growth of Cacti. Algorithmica. 79(1). 271–290. 5 indexed citations

18.

Panolan, Fahad, et al.. (2016). Fréchet Distance Between a Line and Avatar Point Set. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics).

19.

Panolan, Fahad, Geevarghese Philip, & Saket Saurabh. (2016). On the parameterized complexity of b-chromatic number. Journal of Computer and System Sciences. 84. 120–131. 3 indexed citations

20.

Ghosh, Esha, et al.. (2013). Faster Parameterized Algorithms for Deletion to Split Graphs. Algorithmica. 71(4). 989–1006. 21 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact