I am a Postdoctoral Fellow in the algorithm group at the department of informatics, University of Bergen, Norway, hosted by Prof. Fedor V. Fomin . I mainly work on parameterized algorithms/complexity. Major part of my work is on graph algorithms. I also worked/interested in algorithms on matrices, matroids and strings. I completed PhD in Theoretical Computer Science from The Institute of mathematical sciences, Chennai, India under the supervision of Prof. Saket Saurabh in 2015. The title of my PhD thesis is ''Dynamic Programming using Representative Families''. You can see my PhD thesis here.

Short CV
Feb'16 -Post Doctoral Fellow, Department of Informatics, University of Bergen, Norway.
Aug'14 - Jul'15Researcher, Department of Informatics, University of Bergen, Norway.
Aug'10 - Jan'16Integrated PhD Student, The Institute of Mathematical Sciences, HBNI, Chennai, India.
Jun'09 - Jul'10Software Engineer, Yahoo!, Banglore, India.
Jul'06 - May'09MCA Student, National Institute of Technology, Calicut, India.
Selected Publications
Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, and Meirav Zehavi.
To appear in SODA 2018.
Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms.
Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh.
Journal of the ACM(JACM) : 63(4),29(2016)
Representative Sets of Product Families.
Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh.
ACM Transactions on Algorithms (TALG) 13(3): 36:1-36:29 (2017).
Lossy Kernelization.
Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh.
In Proc. Symposium on Theory of Computing(STOC) 2017 : 224-237 [pdf]
Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems.
Fedor V. Fomin, Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh.
In Proc. Symposium on Computational Geometry(SoCG) 2016 : 39:1-39:15
On Integer Programming and the Path-width of the Constraint Matrix.
Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan, Saket Saurabh.
Preprint [ pdf]
Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs.
Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi.
In Proc. International Colloquium on Automata, Languages, and Programming (ICALP) 2017: 65:1-65:15
Deterministic truncation of linear matroids.
Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh.
In Proc. International Colloquium on Automata, Languages, and Programming, Part I (ICALP (1)) 2015: 922-934
Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree.
Fedor V. Fomin, Petteri Kaski, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh.
In Proc. International Colloquium on Automata, Languages, and Programming, Part I (ICALP (1)) 2015: 494-505