Fahad Panolan
-
- Advanced Graph Theory Research 50
- Complexity and Algorithms in Graphs 32
- Graph Labeling and Dimension Problems 5
- semigroups and automata theory 4
-
- Limits and Structures in Graph Theory 12
-
- Interconnection Networks and Systems 9
- Optimization and Search Problems 6
-
- VLSI and FPGA Design Techniques 4
- Co-authors
- Saket SaurabhDaniel LokshtanovFedor V. FominM. S. RamanujanMeirav ZehaviAshutosh RaiGeevarghese PhilipPetr A. Golovach
- Cited by
- Computational Theory and MathematicsDiscrete Mathematics and CombinatoricsComputer Graphics and Computer-Aided Design
In The Last Decade
Fahad Panolan
46 papers receiving 203 citations
Peers
Comparison fields: 5 of 31
- Computational Theory and Mathematics 183
- Discrete Mathematics and Combinatorics 31
- Computer Graphics and Computer-Aided Design 20
- Computer Networks and Communications 75
- 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
The 21 scholars most cited alongside Fahad Panolan, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2025 | 0 | |
| 2 | 2023 | 1 | |
| 3 | 2022 | 1 | |
| 4 | Fixed-Parameter and Approximation Algorithms for PCA with Outliers | 2021 | 1 |
| 5 | 2020 | 1 | |
| 6 | 2020 | 1 | |
| 7 | 2020 | 0 | |
| 8 | 2020 | 2 | |
| 9 | 2019 | 1 | |
| 10 | 2019 | 2 | |
| 11 | 2018 | 2 | |
| 12 | 2018 | 0 | |
| 13 | 2018 | 8 | |
| 14 | 2018 | 3 | |
| 15 | 2018 | 1 | |
| 16 | 2017 | 3 | |
| 17 | 2017 | 5 | |
| 18 | 2016 | 0 | |
| 19 | 2016 | 3 | |
| 20 | 2013 | 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), Limits and Structures in Graph Theory (12 papers), Interconnection Networks and Systems (9 papers), Optimization and Search Problems (6 papers), Graph Labeling and Dimension Problems (5 papers), VLSI and FPGA Design Techniques (4 papers) and semigroups and automata theory (4 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.