Fahad Panolan
- Computational Theory and Mathematics top 5%
- Computer Networks and Communications top 10%
- Discrete Mathematics and Combinatorics top 10%
- Computer Graphics and Computer-Aided Design top 10%
- Industrial and Manufacturing Engineering
- Co-authors
- Saket SaurabhDaniel LokshtanovFedor V. FominM. S. RamanujanMeirav ZehaviAshutosh RaiGeevarghese PhilipPetr A. Golovach
- Topics
- Advanced Graph Theory Research (50 papers)Complexity and Algorithms in Graphs (32 papers)Limits and Structures in Graph Theory (12 papers)
In The Last Decade
Fahad Panolan
46 papers receiving 203 citations
Peers
Comparison fields: 5 of 31
- Computational Theory and Mathematics 183
- Computer Networks and Communications 75
- Discrete Mathematics and Combinatorics 31
- Computer Graphics and Computer-Aided Design 20
- Industrial and Manufacturing Engineering 16
Countries citing papers authored by Fahad Panolan
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
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
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 1 | |
| 3 | 1 | |
| 4 | Fixed-Parameter and Approximation Algorithms for PCA with Outliers | 1 |
| 5 | 1 | |
| 6 | 1 | |
| 7 | 0 | |
| 8 | 2 | |
| 9 | 1 | |
| 10 | 2 | |
| 11 | 2 | |
| 12 | 0 | |
| 13 | 8 | |
| 14 | 3 | |
| 15 | 1 | |
| 16 | 3 | |
| 17 | 5 | |
| 18 | 0 | |
| 19 | 3 | |
| 20 | 21 |
About Fahad Panolan
Fahad Panolan is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Computer Graphics and Computer-Aided Design, having authored 57 papers that have together received 205 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (50 papers), Complexity and Algorithms in Graphs (32 papers) and Limits and Structures in Graph Theory (12 papers). The work is most often cited by research in Computational Theory and Mathematics (183 citations), Discrete Mathematics and Combinatorics (31 citations) and Computer Graphics and Computer-Aided Design (20 citations). Fahad Panolan has collaborated with scholars based in India, Norway and Israel. Frequent 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. Their work appears in journals such as Journal of the ACM, Mathematical Programming and Theoretical Computer Science.
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.