Home
Click
Fahad Panolan's picture

Fahad Panolan

Postdoctoral fellow, Post doctoral Fellow
  • E-mailFahad.Panolan@uib.no
  • Visitor Address
    HIB - Thormøhlensgt. 55
  • Postal Address
    Postboks 7803
    5020 Bergen

I am a Postdoctoral Fellow in the algorithm group at department of informatics. I mainly work on parameterized algorithms and graph algorithms. I completed PhD from The Institute of mathematical sciences, Chennai, India under the supervision of Prof. Saket Saurabh in 2015. The title of my PhD theis is ''Dynamic Programming using Representative Families'' and you can view it here.

 

 
  1. Lossy Kernelization. Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh. To appear in STOC 2017.
  2. Representative Sets of Product Families.
    Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh.
    To appear in TALG. A preliminary version appeared in Proc., ESA 2014.
  3. On Integer Programming and the Path-width of the Constraint Matrix. Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan, Saket Saurabh. Manuscript (https://arxiv.org/abs/1607.05342) 2016.
  4. On the parameterized complexity of b-chromatic number. Fahad Panolan, Geevarghese Philip, Saket Saurabh. J. Comput. Syst. Sci. 84: 120-131 (2017). A preliminary version appeared in Proc., IPEC 2015.
  5. Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms.  Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan and Saket Saurabh. J. ACM 63(4): 29:1-29:60 (2016).
  6. Parameterized Algorithms on Perfect Graphs for Deletion to (r, l)-Graphs. 
    Sudeshna Kolay, Fahad Panolan, Venkatesh Raman, Saket Saurabh.  MFCS 2016: 75:1-75:13.
  7. Subexponential algorithms for rectilinear Steiner tree and arborescence problems. Fedor Fomin, Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan and Saket Saurabh. Symposium on Computational Geometry(SoCG) 2016: 39:1-39:15
  8. Parameterized Algorithms for List K-Cycle. Fahad Panolan, Meirav Zehavi. FSTTCS 2016: 22:1-22:15.
  9. Fréchet Distance Between a Line and Avatar Point Set. Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot. FSTTCS 2016: 32:1-32:14
  10. Editing to Connected f-Degree Graph. Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Saket Saurabh. STACS 2016: 36:1-36:14.
  11. Simultaneous Feedback Edge Set: A Parameterized Perspective. Akanksha Agrawal, Fahad Panolan, Saket Saurabh, Meirav Zehavi. ISAAC 2016: 5:1-5:13
  12. Finding Even Subgraphs Even Faster. Prachi Goyal, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh. FSTTCS 2015: 434-447.
  13. Parameterized Algorithms for Deletion to (r, ell)-Graphs. Sudeshna Kolay, Fahad Panolan. FSTTCS 2015: 420-433
  14. Quick but Odd Growth of Cacti.
    Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan and Saket Saurabh.
    To appear in IPEC 2015.
  15. On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids.
    Fahad Panolan, M. S. Ramanujan, Saket Saurabh.
    In proc., WADS 2015
  16. Reconfiguration on sparse graphs.
    Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, M. S. Ramanujan, Saket Saurabh.
    In proc., WADS 2015
  17. Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree.
    Fedor V. Fomin, Petteri Kaski, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh.
    In Proc.,ICALP(1)
  18. Deterministic Truncation of Linear Matroids.
    Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh.
    In Proc.,ICALP(1)
  19. On the Kernelization Complexity of String Problems.
    Manu Basavaraju, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan, Saket Saurabh.
    In Proc., COCOON 2014
  20. Faster Deterministic Algorithms for r-Dimensional Matching Using Representative Sets.
    Prachi Goyal, Neeldhara Misra and Fahad Panolan.
    In Proc., FSTTCS 2013
  21. Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule?
    Neeldhara Misra, Fahad Panolan and Saket Saurabh.
    In Proc., MFCS 2013
  22. Parameterized Algorithms for Max Colorable Induced Subgraph problem on Perfect Graphs .
    Neeldhara Misra, Fahad Panolan, Ashutosh Rai, Venkatesh Raman and Saket Saurabh.
    In Proc., WG 2013
  23. On the kernelization complexity of problems on graphs without long odd cycles.
    Fahad Panolan, Ashutosh Rai
    In Proc., COCOON 2012
  24. Faster Parameterized Algorithms for Deletion to Split Graphs.
    Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan
    In Proc.,Algorithmica 2015.
    A preliminary version appeared in Proc., SWAT 2012
Journal articles
  • Agrawal, Akanksha; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav. 2016. Simultaneous feedback edge set: A parameterized perspective. Leibniz International Proceedings in Informatics. 64: 5.1-5.13. doi: 10.4230/LIPIcs.ISAAC.2016.5
  • Banik, Aritra; Panolan, Fahad; Raman, Venkatesh; Sahlot, Vibha. 2016. Frechet distance between a line and avatar point set. Leibniz International Proceedings in Informatics. 65: 32.1-32.14. doi: 10.4230/LIPIcs.FSTTCS.2016.32
  • Fomin, Fedor; Golovach, Petr; Panolan, Fahad; Saurabh, Saket. 2016. Editing to connected f-degree graph. Leibniz International Proceedings in Informatics. 47:36: 1-15. doi: 10.4230/LIPIcs.STACS.2016.36
  • Fomin, Fedor; Kolay, Sudeshna; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket. 2016. Subexponential algorithms for rectilinear Steiner tree and arborescence problems. Leibniz International Proceedings in Informatics. 51: 39.1-39.15. doi: 10.4230/LIPIcs.SoCG.2016.39
  • Fomin, Fedor; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket. 2016. Efficient computation of representative families with applications in parameterized and exact algorithms. Journal of the ACM. 63:29. doi: 10.1145/2886094
  • Kolay, Sudeshna; Pandurangan, Ragukumar; Panolan, Fahad; Raman, Venkatesh; Tale, Prafullkumar. 2016. Harmonious coloring: Parameterized algorithms and upper bounds. Lecture Notes in Computer Science. 9941 LNCS: 245-256. doi: 10.1007/978-3-662-53536-3_21
  • Kolay, Sudeshna; Panolan, Fahad; Raman, Venkatesh; Saurabh, Saket. 2016. Parameterized algorithms on perfect graphs for deletion to (r,l)-Graphs. Leibniz International Proceedings in Informatics. 58:75: 1-13. doi: 10.4230/LIPIcs.MFCS.2016.75
  • Panolan, Fahad. 2016. Parameterized algorithms for list K-Cycle. Leibniz International Proceedings in Informatics. 65: 22.1-22.15. doi: 10.4230/LIPIcs.FSTTCS.2016.22
  • Fomin, Fedor; Kaski, Petteri; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket. 2015. Parameterized single-exponential time polynomial space algorithm for steiner tree. Lecture Notes in Computer Science. 9134: 494-505. doi: 10.1007/978-3-662-47672-7_40
  • Goyal, Prachi; Misra, Pranabendu; Panolan, Fahad; Philip, Geevarghese; Saurabh, Saket. 2015. Finding even subgraphs even faster. Leibniz International Proceedings in Informatics. 45: 434-447. doi: 10.4230/LIPIcs.FSTTCS.2015.434
  • Kolay, Sudeshna; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket. 2015. Quick but odd growth of cacti. Leibniz International Proceedings in Informatics. 43: 258-269. doi: 10.4230/LIPIcs.IPEC.2015.258
  • Lokshtanov, Daniel; Misra, Pranabendu; Panolan, Fahad; Saurabh, Saket. 2015. Deterministic truncation of linear matroids. Lecture Notes in Computer Science. 9134: 922-934. doi: 10.1007/978-3-662-47672-7_75
  • Lokshtanov, Daniel; Mouawad, Amer E.; Panolan, Fahad; Maadapuzhi Shridharan, Ramanujan; Saurabh, Saket. 2015. Reconfiguration on sparse graphs. Lecture Notes in Computer Science. 9214: 506-517. doi: 10.1007/978-3-319-21840-3_42
  • Panolan, Fahad; Maadapuzhi Shridharan, Ramanujan; Saurabh, Saket. 2015. On the parameterized complexity of GIRTH and CONNECTIVITY problems on linear matroids. Lecture Notes in Computer Science. 9214: 566-577. doi: 10.1007/978-3-319-21840-3_47
  • Panolan, Fahad; Philip, Geevarghese; Saurabh, Saket. 2015. B-chromatic number: Beyond NP-hardness. Leibniz International Proceedings in Informatics. 43: 389-401. doi: 10.4230/LIPIcs.IPEC.2015.389
  • Fomin, Fedor; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket. 2014. Representative sets of product families. Lecture Notes in Computer Science. 8737 LNCS: 443-454. doi: 10.1007/978-3-662-44777-2_37

More information in national current research information system (CRIStin)