In each section, articles are listed in the reverse chronological order.

Journal Publications

  1. On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets.
    Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz.
    Algorithmica 84(2): 482-509 (2022)
  2. Simultaneous Feedback Edge Set: A Parameterized Perspective.
    Akanksha Agrawal, Fahad Panolan, Saket Saurabh, Meirav Zehavi.
    Algorithmica 83(2): 753-774 (2021)
  3. 2-Approximating Feedback Vertex Set in Tournaments.
    Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Fahad Panolan, Geevarghese Philip, Saket Saurabh.
    ACM Trans. Algorithms 17(2): 11:1-11:14 (2021)
  4. Parameterized Complexity of Geometric Covering Problems Having Conflicts.
    Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot, Saket Saurabh.
    Algorithmica 82(1): 1-19 (2020)
  5. Parameterized low-rank binary matrix approximation.
    Fedor V. Fomin, Petr A. Golovach, Fahad Panolan.
    Data Min. Knowl. Discov. 34(2): 478-532 (2020)
  6. Subexponential algorithm for d-cluster edge deletion: Exception or rule?
    Neeldhara Misra, Fahad Panolan, Saket Saurabh.
    J. Comput. Syst. Sci. 113: 150-162 (2020)
  7. Going Far from Degeneracy.
    Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi.
    SIAM J. Discret. Math. 34(3): 1587-1601 (2020)
  8. Approximation Schemes for Low-rank Binary Matrix Approximation Problems.
    Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh.
    ACM Trans. Algorithms 16(1): 12:1-12:39 (2020)
  9. Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems.
    Fedor V. Fomin, Daniel Lokshtanov, Sudeshna Kolay, Fahad Panolan, Saket Saurabh.
    ACM Trans. Algorithms 16(2): 21:1-21:37 (2020)
  10. Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms.
    Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Meirav Zehavi.
    ACM Trans. Algorithms 16(3): 32:1-32:31 (2020)
  11. On the parameterized complexity of [1, j]-domination problems.
    Mohsen Alambardar Meybodi, Fedor V. Fomin, Amer E. Mouawad, Fahad Panolan.
    Theor. Comput. Sci. 804: 207-218 (2020)
  12. Linear representation of transversal matroids and gammoids parameterized by rank.
    Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh.
    Theor. Comput. Sci. 818: 51-59 (2020)
  13. Stability in barter exchange markets.
    Sushmita Gupta, Fahad Panolan, Saket Saurabh, Meirav Zehavi.
    Auton. Agents Multi Agent Syst. 33(5): 518-539 (2019)
  14. Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs.
    Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi.
    Discrete and Computational Geometry (DCG) 1-33 (2019)
  15. Stability in barter exchange markets.
    Sushmita Gupta, Fahad Panolan, Saket Saurabh, Meirav Zehavi.
    Autonomous Agents and Multi-Agent Systems 518-539 (2019)
  16. Rank Vertex Cover as a Natural Problem for Algebraic Compression.
    Syed M. Meesum, Fahad Panolan, Saket Saurabh, Meirav Zehavi.
    SIAM Journal on Discrete Mathematics (SIDMA) 33(3): 1277-1296 (2019).
  17. Editing to Connected F-Degree Graph.
    Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Saket Saurabh.
    SIAM Journal on Discrete Mathematics (SIDMA) 33(2): 795-836 (2019).
  18. Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree.
    Fedor V. Fomin, Petteri Kaski, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh.
    SIAM Journal on Discrete Mathematics (SIDMA) 33(1): 327-345 (2019).
  19. Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs.
    Neeldhara Misra, Fahad Panolan, Ashutosh Rai, Venkatesh Raman, Saket Saurabh.
    Algorithmica 81(1): 26-46 (2019).
  20. Harmonious coloring: Parameterized algorithms and upper bounds.
    Sudeshna Kolay, Ragukumar Pandurangan, Fahad Panolan, Venkatesh Raman, Prafullkumar Tale.
    Theoretical Computer Science (TCS) 772: 132-142 (2019).
  21. Communication Complexity and Graph Families.
    Sudeshna Kolay, Fahad Panolan, Saket Saurabh.
    ACM Transactions on Computation Theory (TOCT) 11(2): 11:1-11:28 (2019).
  22. Parameterized Algorithms for List K-Cycle.
    Fahad Panolan, Saket Saurabh, Meirav Zehavi.
    Algorithmica 81(3): 1267-1287 (2019).
  23. Finding Even Subgraphs Even Faster.
    Prachi Goyal, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh.
    Journal of Computer and System Sciences (JCSS) 97: 1-13 (2018).
  24. Linear representation of transversal matroids and gammoids parameterized by rank.
    Pranabendu Misra, Fahad Panolan, M.S. Ramanujan, and Saket Saurabh.
    Theoretical Computer Science (TCS) 2018, ISSN 0304-3975.
  25. Long Directed (s,t)-Path: FPT Algorithm.
    Fedor Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi.
    Information Processing Letters (IPL), 140:8-12 (2018).
  26. Deterministic Truncation of Linear Matroids.
    Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh.
    ACM Transactions on Algorithms (TALG) 14(2): 14:1-14:20 (2018).
  27. On the kernelization complexity of string problems.
    Manu Basavaraju, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan, Saket Saurabh.
    Theoretical Computer Science (TCS) 730: 21-31 (2018).
  28. Reconfiguration on sparse graphs.
    Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, M. S. Ramanujan, Saket Saurabh.
    Journal of Computer and System Sciences (JCSS) 95: 122-131 (2018).
  29. Frèchet Distance Between a Line and Avatar Point Set.
    Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot.
    Algorithmica 80(9): 2616-2636 (2018).
  30. 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).
  31. Quick but Odd Growth of Cacti.
    Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh.
    Algorithmica 79(1): 271-290 (2017).
  32. On the parameterized complexity of b-chromatic number.
    Fahad Panolan, Geevarghese Philip, Saket Saurabh.
    Journal of Computer and System Sciences (JCSS) 84: 120-131 (2017).
  33. 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:1-29:60 (2016).
  34. Faster Parameterized Algorithms for Deletion to Split Graphs.
    Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan.
    Algorithmica 71(4): 989-1006 (2015).
  35. Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets.
    Prachi Goyal, Neeldhara Misra, Fahad Panolan, Meirav Zehavi.
    SIAM Journal on Discrete Mathematics (SIDMA) 29(4): 1815-1836 (2015).

Conference Publications

  1. Fixed-Parameter and Approximation Algorithms for PCA with Outliers.
    Yogesh Dahiya, Fedor V. Fomin, Fahad Panolan, Kirill Simonov.
    ICML 2021: 2341-2351.
  2. Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms.
    Sushmita Gupta, Pallavi Jain, Fahad Panolan, Sanjukta Roy, Saket Saurabh.
    SAGT 2021: 140-155.
  3. EPTAS for k-means Clustering of Affine Subspaces.
    Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov.
    SODA 2021: 2649-2659.
  4. An FPT Algorithm for Elimination Distance to Bounded Degree Graphs.
    Akanksha Agrawal, Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Saket Saurabh.
    STACS 2021: 5:1-5:11.
  5. Diverse Collections in Matroids and Graphs.
    Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh.
    STACS 2021: 31:1-31:14.
  6. Hitting Topological Minors is FPT.
    Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh and Meirav Zehavi.
    STOC 2020: 1317-1326.
  7. ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs.
    Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh and Meirav Zehavi.
    SoCG 2020: 44:1-44:18
  8. Manipulating Districts to Win Elections: Fine-Grained Complexity.
    Fedor Fomin, Eduard Eiben, Fahad Panolan, Kirill Simonov.
    AAAI 2020: 1902-1909
  9. Low-Rank Binary Matrix Approximation in Column-Sum Norm.
    Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Kirill Simonov.
    APPROX/RANDOM 2020: 32:1-32:18. [Video]
  10. Parameterization Above a Multiplicative Guarantee.
    Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi.
    ITCS 2020: 39:1-39:13.
  11. 2-Approximating Feedback Vertex Set in Tournaments.
    Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Fahad Panolan, Geevarghese Philip, Saket Saurabh.
    SODA 2020: 1010-1018.
  12. A (2 + epsilon)-Factor Approximation Algorithm for Split Vertex Deletion.
    Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh.
    ICALP 2020: 80:1-80:16.
  13. Parameterized Complexity of Feedback Vertex Sets on Hypergraphs.
    Pratibha Choudhary, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh.
    FSTTCS 2020: 18:1-18:15.
  14. On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets.
    Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz.
    IPEC 2020: 24:1-24:15.
  15. Structural Parameterizations with Modulator Oblivion.
    Ashwin Jacob, Fahad Panolan, Venkatesh Raman, Vibha Sahlot.
    IPEC 2020: 19:1-19:18.
  16. Quick Separation in Chordal and Split Graphs.
    Pranabendu Misra, Fahad Panolan, Ashutosh Rai, Saket Saurabh, Roohani Sharma.
    MFCS 2020: 70:1-70:14.
  17. Improved FPT Algorithms for Deletion to Forest-Like Structures.
    Kishen N. Gowda, Aditya Lonkar, Fahad Panolan, Vraj Patel, Saket Saurabh.
    ISAAC 2020: 34:1-34:16.
  18. Going Far From Degeneracy.
    Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi.
    ESA 2019: 47:1-47:14.
  19. Refined Complexity of PCA with Outliers.
    Kirill Simonov, Fedor V. Fomin, Petr A. Golovach, Fahad Panolan.
    ICML 2019: 5818-5826.
  20. Decomposition of Map Graphs with Applications.
    Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi.
    ICALP 2019: 60:1-60:15.
  21. On the Complexity of Mixed Dominating Set.
    Jayakrishnan Madathil, Fahad Panolan, Abhishek Sahu, Saket Saurabh.
    CSR 2019: 262-274.
  22. On the Parameterized Complexity of Edge-Linked Paths.
    Neeldhara Misra, Fahad Panolan, Saket Saurabh.
    CSR 2019: 286-298.
  23. Complexity of the Steiner Network Problem with Respect to the Number of Terminals.
    Eduard Eiben, Dusan Knop, Fahad Panolan, Ondrej Suchy
    STACS 2019: 25:1-25:17.
  24. Contraction decomposition in unit disk graphs and algorithmic applications in parameterized complexity.
    Fahad Panolan, Saket Saurabh, Meirav Zehavi.
    SODA 2019: 1035-1054.
  25. On the parameterized complexity of [1,j]-domination problems.
    Mohsen Alambardar Meybodi, Fedor V. Fomin, Amer E. Mouawad, Fahad Panolan
    FSTTCS 2018: 34:1-34:14.
  26. Parameterized Low-Rank Binary Matrix Approximation.
    Fedor V. Fomin, Petr A. Golovach, Fahad Panolan.
    ICALP 2018: 53:1-53:16
  27. On the Optimality of Pseudo-polynomial Algorithms for Integer Programming.
    Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan, Saket Saurabh.
    ESA 2018: 31:1-31:13
  28. Stability in Barter Exchange Markets.
    Fahad Panolan, Sushmita Gupta, Saket Saurabh, Meirav Zehavi.
    AAMAS 2018: 1371-1379
  29. Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms.
    Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Meirav Zehavi.
    SODA 2018: 2785-2800
  30. Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity.
    Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi
    ITCS 2018: 32:1-32:13
  31. Lossy Kernels for Connected Dominating Set.
    Eduard Eiben, Mithilesh Kumar, Amer Mouawad, Fahad Panolan, and Sebastian Siebertz
    STACS 2018: 29:1-29:15
  32. Lossy kernelization.
    Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh.
    STOC 2017: 224-237
  33. Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs.
    Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi.
    ICALP 2017: 65:1-65:15
  34. Communication Complexity of Pairs of Graph Families with Applications.
    Sudeshna Kolay, Fahad Panolan and Saket Saurabh.
    To appear in MFCS 2017.
  35. Mixed dominating set: A parameterized perspective.
    Pallavi Jain, Jayakrishnan M, Fahad Panolan, Abhishek Sahu.
    To appear in WG 2017.
  36. Linear Representation of Transversal Matroids and Gammoids Parameterized by Rank.
    Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh.
    COCOON 2017: 420-432
  37. Fast Exact Algorithms for Survivable Network Design with Uniform Requirements.
    Akanksha Agrawal, Pranabendu Misra, Fahad Panolan, Saket Saurabh.
    WADS 2017: 25-36
  38. Parameterized Complexity of Geometric Covering Problems Having Conflicts.
    Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot, Saket Saurabh.
    WADS 2017: 61-72
  39. Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems.
    Fedor V. Fomin, Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh.
    Symposium on Computational Geometry 2016: 39:1-39:15
  40. Parameterized Algorithms for List K-Cycle.
    Fahad Panolan, Meirav Zehavi.
    FSTTCS 2016: 22:1-22:15
  41. Frèchet Distance Between a Line and Avatar Point Set.
    Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot.
    FSTTCS 2016: 32:1-32:14
  42. Simultaneous Feedback Edge Set: A Parameterized Perspective.
    Akanksha Agrawal, Fahad Panolan, Saket Saurabh, Meirav Zehavi.
    ISAAC 2016: 5:1-5:13
  43. 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
  44. Editing to Connected f-Degree Graph.
    Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Saket Saurabh.
    STACS 2016: 36:1-36:14
  45. Harmonious Coloring: Parameterized Algorithms and Upper Bounds.
    Sudeshna Kolay, Ragukumar Pandurangan, Fahad Panolan, Venkatesh Raman, Prafullkumar Tale.
    WG 2016: 245-256
  46. Parameterized Algorithms for Deletion to (r, l)-Graphs.
    Sudeshna Kolay, Fahad Panolan.
    FSTTCS 2015: 420-433
  47. Finding Even Subgraphs Even Faster.
    Prachi Goyal, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh.
    FSTTCS 2015: 434-447
  48. Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree.
    Fedor V. Fomin, Petteri Kaski, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh.
    ICALP (1) 2015: 494-505
  49. Deterministic Truncation of Linear Matroids.
    Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh.
    ICALP (1) 2015: 922-934
  50. Quick but Odd Growth of Cacti.
    Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh.
    IPEC 2015: 258-269
  51. B-Chromatic Number: Beyond NP-Hardness.
    Fahad Panolan, Geevarghese Philip, Saket Saurabh.
    IPEC 2015: 389-401
  52. Reconfiguration on Sparse Graphs.
    Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, M. S. Ramanujan, Saket Saurabh.
    WADS 2015: 506-517
  53. On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids.
    Fahad Panolan, M. S. Ramanujan, Saket Saurabh.
    WADS 2015: 566-577
  54. On the Kernelization Complexity of String Problems.
    Manu Basavaraju, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan, Saket Saurabh.
    COCOON 2014: 141-153
  55. Representative Sets of Product Families.
    Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh.
    ESA 2014: 443-454
  56. Faster Deterministic Algorithms for r-Dimensional Matching Using Representative Sets.
    Prachi Goyal, Neeldhara Misra, Fahad Panolan.
    FSTTCS 2013: 237-248
  57. Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule?
    Neeldhara Misra, Fahad Panolan, Saket Saurabh.
    MFCS 2013: 679-690
  58. Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs.
    Neeldhara Misra, Fahad Panolan, Ashutosh Rai, Venkatesh Raman, Saket Saurabh.
    WG 2013: 370-381
  59. On the Kernelization Complexity of Problems on Graphs without Long Odd Cycles.
    Fahad Panolan, Ashutosh Rai.
    COCOON 2012: 445-457
  60. Faster Parameterized Algorithms for Deletion to Split Graphs.
    Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan.
    SWAT 2012: 107-118

Surveys

  1. Matroids in Parameterized Complexity and Exact Algorithms.
    Fahad Panolan, Saket Saurabh.
    Encyclopedia of Algorithms 2016: 1203-1206

Theses

  1. Dynamic Programming using Representative Families.
    1. Doctoral Thesis. The Institute of Mathematical Sciences, HBNI, Chennai, India. Dec 2015
    2. Advisor: Prof. Saket Saurabh
    3. [pdf]
  2. Randomization Techniques in FPT and k-Path Problem.
    1. Masters Thesis. The Institute of Mathematical Sciences, HBNI, Chennai, India. May 2012
    2. Advisor: Prof. Saket Saurabh
    3. [pdf]