Fahad Panolan
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
73
Venues
21
Active years
2012–2026
Best venue rank
A*
Where they publish
Papers
73 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | KR | Clausal Deletion Backdoors for QBF: a Parameterized Complexity Approach. | Leif Eriksson, Victor Lagerkvist, Sebastian Ordyniak, George Osipov, Fahad Panolan, Mateusz Rychlicki |
| 2026 | STOC | Fine-Grained Bounds for Courcelle's Theorem. | Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi |
| 2025 | MFCS | Quasipolynomial-Time Deterministic Kernelization and (Gammoid) Representation. | Rohit Gurjar, Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2025 | SODA | Packing Short Cycles. | Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, William Lochet, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Kirill Simonov |
| 2025 | SODA | Crossing Number in Slightly Superexponential Time (Extended Abstract). | Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Jie Xue, Meirav Zehavi |
| 2025 | STOC | Efficiently Finding and Counting Patterns with Distance Constraints in Sparse Graphs. | Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi |
| 2025 | STOC | Subexponential Parameterized Algorithms for Hitting Subgraphs. | Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi |
| 2025 | STACS | Parameterized Saga of First-Fit and Last-Fit Coloring. | Akanksha Agrawal, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Shaily Verma |
| 2025 | SOFSEM | Parameterized Complexity of Generalizations of Edge Dominating Set. | Shubhada Aute, Fahad Panolan, Souvik Saha, Saket Saurabh, Anannya Upasana |
| 2025 | WADS | Streaming Algorithms for Conflict-Free Coloring. | Rogers Mathew, Fahad Panolan, Seshikanth |
| 2024 | COCOA | Parameterized Complexity of Shortest Path with Positive Disjunctive Constraints. | Susobhan Bandopadhyay, Suman Banerjee, Diptapriyo Majumdar, Fahad Panolan |
| 2024 | IJCAI | Solving Quantified Boolean Formulas with Few Existential Variables. | Leif Eriksson, Victor Lagerkvist, Sebastian Ordyniak, George Osipov, Fahad Panolan, Mateusz Rychlicki |
| 2024 | LATIN | Parameterized Algorithms for Minimum Sum Vertex Cover. | Shubhada Aute, Fahad Panolan |
| 2024 | LATIN | Max-SAT with Cardinality Constraint Parameterized by the Number of Clauses. | Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana |
| 2024 | MFCS | Covering and Partitioning of Split, Chain and Cographs with Isometric Paths. | Dibyayan Chakraborty, Haiko Mller, Sebastian Ordyniak, Fahad Panolan, Mateusz Rychlicki |
| 2024 | SODA | Meta-theorems for Parameterized Streaming Algorithms‡. | Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi |
| 2024 | STACS | Decremental Sensitivity Oracles for Covering and Packing Minors. | Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Peter Strulo |
| 2024 | WALCOM | On MAX-SAT with Cardinality Constraint. | Fahad Panolan, Hannane Yaghoubizade |
| 2023 | SODA | Parameterized Approximation Scheme for Biclique-free Max | Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana |
| 2023 | SODA | A Framework for Approximation Schemes on Disk Graphs. | Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi |
| 2023 | WADS | Socially Fair Matching: Exact and Approximation Algorithms. | Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Fahad Panolan, Kirill Simonov |
| 2023 | WADS | An ETH-Tight Algorithm for Bidirected Steiner Connectivity. | Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2022 | CSR | Parameterized Complexity of List Coloring and Max Coloring. | Bardiya Aryanfard, Fahad Panolan |
| 2022 | CSR | Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs. | Petr A. Golovach, Fahad Panolan, Ashutosh Rai, Saket Saurabh |
| 2022 | CSR | Partial Vertex Cover on Graphs of Bounded Degeneracy. | Fahad Panolan, Hannane Yaghoubizade |
| 2022 | ICALP | Backdoor Sets on Nowhere Dense SAT. | Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan |
| 2022 | IJCNN | Boolean and $\mathbb{F}_{p}$-Matrix Factorization: From Theory to Practice. | Fedor V. Fomin, Fahad Panolan, Anurag Patil, Adil Tanveer |
| 2022 | LATIN | List Homomorphism: Beyond the Known Boundaries. | Sriram Bhyravarapu, Satyabrata Jana, Fahad Panolan, Saket Saurabh, Shaily Verma |
| 2022 | SODA | Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent. | Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi |
| 2022 | SODA | Subexponential Parameterized Algorithms on Disk Graphs (Extended Abstract). | Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi |
| 2021 | ICML | Fixed-Parameter and Approximation Algorithms for PCA with Outliers. | Yogesh Dahiya, Fedor V. Fomin, Fahad Panolan, Kirill Simonov |
| 2021 | SODA | EPTAS for | Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov |
| 2021 | STACS | An FPT Algorithm for Elimination Distance to Bounded Degree Graphs. | Akanksha Agrawal, Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Saket Saurabh |
| 2021 | STACS | Diverse Collections in Matroids and Graphs. | Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh |
| 2021 | SAGT | Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms. | Sushmita Gupta, Pallavi Jain, Fahad Panolan, Sanjukta Roy, Saket Saurabh |
| 2020 | AAAI | Manipulating Districts to Win Elections: Fine-Grained Complexity. | Eduard Eiben, Fedor V. Fomin, Fahad Panolan, Kirill Simonov |
| 2020 | ICALP | A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion. | Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh |
| 2020 | ISAAC | Improved FPT Algorithms for Deletion to Forest-Like Structures. | Kishen N. Gowda, Aditya Lonkar, Fahad Panolan, Vraj Patel, Saket Saurabh |
| 2020 | MFCS | Quick Separation in Chordal and Split Graphs. | Pranabendu Misra, Fahad Panolan, Ashutosh Rai, Saket Saurabh, Roohani Sharma |
| 2020 | SODA | 2-Approximating Feedback Vertex Set in Tournaments. | Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Fahad Panolan, Geevarghese Philip, Saket Saurabh |
| 2020 | STOC | Hitting topological minors is FPT. | Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2019 | CSR | On the Complexity of Mixed Dominating Set. | Jayakrishnan Madathil, Fahad Panolan, Abhishek Sahu, Saket Saurabh |
| 2019 | CSR | On the Parameterized Complexity of Edge-Linked Paths. | Neeldhara Misra, Fahad Panolan, Saket Saurabh |
| 2019 | ESA | Going Far From Degeneracy. | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2019 | ICALP | Decomposition of Map Graphs with Applications. | Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2019 | ICML | Refined Complexity of PCA with Outliers. | Kirill Simonov, Fedor V. Fomin, Petr A. Golovach, Fahad Panolan |
| 2019 | SODA | Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity. | Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2019 | STACS | Complexity of the Steiner Network Problem with Respect to the Number of Terminals. | Eduard Eiben, Dusan Knop, Fahad Panolan, Ondrej Such |
| 2019 | WALCOM | Parameterized Computational Geometry via Decomposition Theorems. | Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2018 | ESA | On the Optimality of Pseudo-polynomial Algorithms for Integer Programming. | Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan, Saket Saurabh |
| 2018 | ICALP | Parameterized Low-Rank Binary Matrix Approximation. | Fedor V. Fomin, Petr A. Golovach, Fahad Panolan |
| 2018 | SODA | Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. | Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Meirav Zehavi |
| 2018 | STACS | Lossy Kernels for Connected Dominating Set on Sparse Graphs. | Eduard Eiben, Mithilesh Kumar, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz |
| 2017 | COCOON | Linear Representation of Transversal Matroids and Gammoids Parameterized by Rank. | Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh |
| 2017 | ICALP | Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. | Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2017 | MFCS | Communication Complexity of Pairs of Graph Families with Applications. | Sudeshna Kolay, Fahad Panolan, Saket Saurabh |
| 2017 | STOC | Lossy kernelization. | Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh |
| 2017 | WADS | Fast Exact Algorithms for Survivable Network Design with Uniform Requirements. | Akanksha Agrawal, Pranabendu Misra, Fahad Panolan, Saket Saurabh |
| 2017 | WADS | Parameterized Complexity of Geometric Covering Problems Having Conflicts. | Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot, Saket Saurabh |
| 2017 | WG | Mixed Dominating Set: A Parameterized Perspective. | Pallavi Jain, Jayakrishnan Madathil, Fahad Panolan, Abhishek Sahu |
| 2016 | ISAAC | Simultaneous Feedback Edge Set: A Parameterized Perspective. | Akanksha Agrawal, Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2016 | MFCS | Parameterized Algorithms on Perfect Graphs for Deletion to (r, l)-Graphs. | Sudeshna Kolay, Fahad Panolan, Venkatesh Raman, Saket Saurabh |
| 2016 | STACS | Editing to Connected f-Degree Graph. | Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Saket Saurabh |
| 2016 | WG | Harmonious Coloring: Parameterized Algorithms and Upper Bounds. | Sudeshna Kolay, Ragukumar Pandurangan, Fahad Panolan, Venkatesh Raman, Prafullkumar Tale |
| 2015 | ICALP | Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree. | Fedor V. Fomin, Petteri Kaski, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh |
| 2015 | ICALP | Deterministic Truncation of Linear Matroids. | Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh |
| 2015 | WADS | Reconfiguration on Sparse Graphs. | Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, M. S. Ramanujan, Saket Saurabh |
| 2015 | WADS | On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids. | Fahad Panolan, M. S. Ramanujan, Saket Saurabh |
| 2014 | COCOON | On the Kernelization Complexity of String Problems. | Manu Basavaraju, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan, Saket Saurabh |
| 2014 | ESA | Representative Sets of Product Families. | Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh |
| 2013 | MFCS | Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule? | Neeldhara Misra, Fahad Panolan, Saket Saurabh |
| 2013 | WG | Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs. | Neeldhara Misra, Fahad Panolan, Ashutosh Rai, Venkatesh Raman, Saket Saurabh |
| 2012 | COCOON | On the Kernelization Complexity of Problems on Graphs without Long Odd Cycles. | Fahad Panolan, Ashutosh Rai |