Fahad Panolan

Fahad Panolan is a Lecturer in the Algorithms and Complexity group at the School of Computing, University of Leeds, UK, a position he has held since August 2023. Prior to this, he was an Assistant Professor in the Department of Computer Science and Engineering at IIT Hyderabad, India, from July 2019 to August 2023. He conducted postdoctoral research at the Department of Informatics, University of Bergen, Norway, between 2016 and 2019.

Education:

• PhD in Theoretical Computer Science, The Institute of Mathematical Sciences, HBNI, Chennai, India (2012–2015)
• MSc in Theoretical Computer Science, The Institute of Mathematical Sciences, HBNI, Chennai, India (2010–2012)
• Master of Computer Applications, National Institute of Technology, Calicut, India (2006–2009)
• BSc in Physics, DGM MES Mampad College, University of Calicut, India (2002–2005)

His research lies at the intersection of theoretical computer science and algorithm design, with core interests in Parameterized Algorithms and Complexity, Graph Theory, Approximation Algorithms, and Streaming Algorithms. He has made significant contributions to kernelization, matroid-based techniques, and the development of subexponential-time algorithms for NP-hard graph problems. His work often bridges structural graph theory with algorithmic efficiency, particularly on sparse and geometric graphs.

The recent publications show a strong trend in advancing the frontiers of fixed-parameter tractability, including efficient kernelization, approximation schemes for matrix problems, and reconfiguration algorithms. His work frequently appears in top-tier venues such as STOC, SODA, ICALP, and journals like JACM and Algorithmica.

Scientific Service:

• PC Member: WALCOM 2026, IPEC 2023, ESA 2022, IPEC 2021, AAAI 2021
• Scientific Coordinator: Parameterized Complexity 201 Workshop
• Referee for journals including TALG, SIDMA, TCS, Algorithmica, and conferences like STOC, SODA, ICALP, ESA.

Fahad Panolan advises PhD students and interns, including Shubhada Suresh Aute and Seshikanth Varma. He has secured research grants through collaborative projects and has delivered invited talks at international workshops and seminars, including Dagstuhl, DIMAP, and Parameterized Complexity workshops. He has taught courses such as Algorithms, Design and Analysis of Algorithms, and Parameterized Algorithms at both University of Leeds and IIT Hyderabad.

He is actively involved in the parameterized complexity and algorithms research community, organizing workshops and contributing to the theoretical foundations of efficient computation on hard problems.