Fahad Panolan

ORCID

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 142

Top Venues

CoRR

Algorithmica

SODA

SIAM J. Discret. Math.

Publications

Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh
Diverse collections in matroids and graphs. Math. Program. 204 (1) (2024)
Sushmita Gupta, Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
When far is better: The Chamberlin-Courant approach to obnoxious committee selection. CoRR (2024)
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3. CoRR (2024)
Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Peter Strulo
Decremental Sensitivity Oracles for Covering and Packing Minors. STACS (2024)
Kishen N. Gowda, Aditya Lonkar, Fahad Panolan, Vraj Patel, Saket Saurabh
Improved FPT Algorithms for Deletion to Forest-Like Structures. Algorithmica 86 (5) (2024)
Fahad Panolan, Hannane Yaghoubizade
On MAX-SAT with Cardinality Constraint. WALCOM (2024)
Shubhada Aute, Fahad Panolan
Parameterized Algorithms for Minimum Sum Vertex Cover. CoRR (2024)
Dibyayan Chakraborty, Haiko Müller, Sebastian Ordyniak, Fahad Panolan, Mateusz Rychlicki
Covering and Partitioning of Split, Chain and Cographs with Isometric Paths. MFCS (2024)
Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana
Max-SAT with Cardinality Constraint Parameterized by the Number of Clauses. LATIN (2) (2024)
Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
Meta-theorems for Parameterized Streaming Algorithms‡. SODA (2024)
Leif Eriksson, Victor Lagerkvist, George Osipov, Sebastian Ordyniak, Fahad Panolan, Mateusz Rychlicki
Solving Quantified Boolean Formulas with Few Existential Variables. CoRR (2024)
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
A 1.9999-Approximation Algorithm for Vertex Cover on String Graphs. SoCG (2024)
Shubhada Aute, Fahad Panolan
Parameterized Algorithms for Minimum Sum Vertex Cover. LATIN (2) (2024)
Fahad Panolan, Saket Saurabh, Meirav Zehavi
Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity. ACM Trans. Algorithms 20 (2) (2024)
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
A Framework for Approximation Schemes on Disk Graphs. SODA (2023)
Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi
An ETH-Tight Algorithm for Bidirected Steiner Connectivity. WADS (2023)
Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
On the optimality of pseudo-polynomial algorithms for integer programming. Math. Program. 198 (1) (2023)
Susobhan Bandopadhyay, Suman Banerjee, Diptapriyo Majumdar, Fahad Panolan
Shortest Path with Positive Disjunctive Constraints - a Parameterized Perspective. CoRR (2023)
Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Fahad Panolan, Kirill Simonov
Socially Fair Matching: Exact and Approximation Algorithms. WADS (2023)
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
Hitting Subgraphs in Sparse Graphs and Geometric Intersection Graphs. CoRR (2023)
Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
Meta-theorems for Parameterized Streaming Algorithms. CoRR (2023)
Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana
-Weight SAT and Max Coverage. SODA (2023)
Petr A. Golovach, Fahad Panolan, Ashutosh Rai, Saket Saurabh
Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs. CSR (2022)
Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan
Backdoor Sets on Nowhere Dense SAT. ICALP (2022)
Fedor V. Fomin, Fahad Panolan, Anurag Patil, Adil Tanveer
-Matrix Factorization: From Theory to Practice. CoRR (2022)
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
A Framework for Approximation Schemes on Disk Graphs. CoRR (2022)
Akanksha Agrawal, Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs. SIAM J. Discret. Math. 36 (2) (2022)
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
Subexponential Parameterized Algorithms on Disk Graphs (Extended Abstract). SODA (2022)
Akanksha Agrawal, Pranabendu Misra, Fahad Panolan, Saket Saurabh
Fast Exact Algorithms for Survivable Network Design with Uniform Requirements. Algorithmica 84 (9) (2022)
Fahad Panolan, Hannane Yaghoubizade
Partial Vertex Cover on Graphs of Bounded Degeneracy. CSR (2022)
Bardiya Aryanfard, Fahad Panolan
Parameterized Complexity of List Coloring and Max Coloring. CSR (2022)
Ashwin Jacob, Fahad Panolan, Venkatesh Raman, Vibha Sahlot
Structural Parameterizations with Modulator Oblivion. Algorithmica 84 (8) (2022)
Fedor V. Fomin, Fahad Panolan, Anurag Patil, Adil Tanveer
Boolean and $\mathbb{F}_{p}$-Matrix Factorization: From Theory to Practice. IJCNN (2022)
Sriram Bhyravarapu, Satyabrata Jana, Fahad Panolan, Saket Saurabh, Shaily Verma
List Homomorphism: Beyond the Known Boundaries. LATIN (2022)
Fahad Panolan, Hannane Yaghoubizade
Partial Vertex Cover on Graphs of Bounded Degeneracy. CoRR (2022)
Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz
On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets. Algorithmica 84 (2) (2022)
Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent. SODA (2022)
Suman Banerjee, Rogers Mathew, Fahad Panolan
Target Set Selection Parameterized by Vertex Cover and More. Theory Comput. Syst. 66 (5) (2022)
Sushmita Gupta, Pallavi Jain, Fahad Panolan, Sanjukta Roy, Saket Saurabh
Gerrymandering on graphs: Computational complexity and parameterized algorithms. CoRR (2021)
Akanksha Agrawal, Fahad Panolan, Saket Saurabh, Meirav Zehavi
Simultaneous Feedback Edge Set: A Parameterized Perspective. Algorithmica 83 (2) (2021)
Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh
Diverse Collections in Matroids and Graphs. STACS (2021)
Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
Elimination Distance to Topological-minor-free Graphs is FPT. CoRR (2021)
Sushmita Gupta, Pallavi Jain, Fahad Panolan, Sanjukta Roy, Saket Saurabh
Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms. SAGT (2021)
Meirav Zehavi, Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs. J. Comput. Geom. 12 (2) (2021)
Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh
Diverse Collections in Matroids and Graphs. CoRR (2021)
Akanksha Agrawal, Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
An FPT Algorithm for Elimination Distance to Bounded Degree Graphs. STACS (2021)
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
Multiplicative Parameterization Above a Guarantee. ACM Trans. Comput. Theory 13 (3) (2021)
Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov
-means Clustering of Affine Subspaces. SODA (2021)
Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Fahad Panolan, Geevarghese Philip, Saket Saurabh
2-Approximating Feedback Vertex Set in Tournaments. ACM Trans. Algorithms 17 (2) (2021)
Yogesh Dahiya, Fedor V. Fomin, Fahad Panolan, Kirill Simonov
Fixed-Parameter and Approximation Algorithms for PCA with Outliers. ICML (2021)
Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Fahad Panolan, Geevarghese Philip, Saket Saurabh
2-Approximating Feedback Vertex Set in Tournaments. SODA (2020)
Ashwin Jacob, Fahad Panolan, Venkatesh Raman, Vibha Sahlot
Structural Parameterizations with Modulator Oblivion. IPEC (2020)
Ashwin Jacob, Fahad Panolan, Venkatesh Raman, Vibha Sahlot
Structural Parameterizations with Modulator Oblivion. CoRR (2020)
Eduard Eiben, Fedor V. Fomin, Fahad Panolan, Kirill Simonov
Manipulating Districts to Win Elections: Fine-Grained Complexity. AAAI (2020)
Fedor V. Fomin, Daniel Lokshtanov, Sudeshna Kolay, Fahad Panolan, Saket Saurabh
Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems. ACM Trans. Algorithms 16 (2) (2020)
Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs. CoRR (2020)
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
Parameterization Above a Multiplicative Guarantee. ITCS (2020)
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Meirav Zehavi
Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. ACM Trans. Algorithms 16 (3) (2020)
Mohsen Alambardar Meybodi, Fedor V. Fomin, Amer E. Mouawad, Fahad Panolan
]-domination problems. Theor. Comput. Sci. 804 (2020)
Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz
On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets. IPEC (2020)
Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
Hitting topological minors is FPT. STOC (2020)
Eduard Eiben, Fedor V. Fomin, Fahad Panolan, Kirill Simonov
Manipulating Districts to Win Elections: Fine-Grained Complexity. CoRR (2020)
Fedor V. Fomin, Petr A. Golovach, Fahad Panolan
Parameterized low-rank binary matrix approximation. Data Min. Knowl. Discov. 34 (2) (2020)
Kishen N. Gowda, Aditya Lonkar, Fahad Panolan, Vraj Patel, Saket Saurabh
Improved FPT Algorithms for Deletion to Forest-like Structures. CoRR (2020)
Pratibha Choudhary, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
Parameterized Complexity of Feedback Vertex Sets on Hypergraphs. FSTTCS (2020)
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
Going Far from Degeneracy. SIAM J. Discret. Math. 34 (3) (2020)
Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs. SoCG (2020)
Pranabendu Misra, Fahad Panolan, Ashutosh Rai, Saket Saurabh, Roohani Sharma
Quick Separation in Chordal and Split Graphs. MFCS (2020)
Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Kirill Simonov
Low-Rank Binary Matrix Approximation in Column-Sum Norm. APPROX-RANDOM (2020)
Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh
A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion. ICALP (2020)
Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov
EPTAS for k-means Clustering of Affine Subspaces. CoRR (2020)
Kishen N. Gowda, Aditya Lonkar, Fahad Panolan, Vraj Patel, Saket Saurabh
Improved FPT Algorithms for Deletion to Forest-Like Structures. ISAAC (2020)
Neeldhara Misra, Fahad Panolan, Saket Saurabh
-cluster edge deletion: Exception or rule? J. Comput. Syst. Sci. 113 (2020)
Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot, Saket Saurabh
Parameterized Complexity of Geometric Covering Problems Having Conflicts. Algorithmica 82 (1) (2020)
Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
Linear representation of transversal matroids and gammoids parameterized by rank. Theor. Comput. Sci. 818 (2020)
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
Approximation Schemes for Low-rank Binary Matrix Approximation Problems. ACM Trans. Algorithms 16 (1) (2020)
Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz
On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets. CoRR (2019)
Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. Discret. Comput. Geom. 62 (4) (2019)
Kirill Simonov, Fedor V. Fomin, Petr A. Golovach, Fahad Panolan
Refined Complexity of PCA with Outliers. ICML (2019)
Fahad Panolan, Saket Saurabh, Meirav Zehavi
Parameterized Computational Geometry via Decomposition Theorems. WALCOM (2019)
Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Saket Saurabh
Editing to Connected F-Degree Graph. SIAM J. Discret. Math. 33 (2) (2019)
Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
Reducing Topological Minor Containment to the Unique Linkage Theorem. CoRR (2019)
Sushmita Gupta, Fahad Panolan, Saket Saurabh, Meirav Zehavi
Stability in barter exchange markets. Auton. Agents Multi Agent Syst. 33 (5) (2019)
Neeldhara Misra, Fahad Panolan, Saket Saurabh
On the Parameterized Complexity of Edge-Linked Paths. CSR (2019)
Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Kirill Simonov
Refined Complexity of PCA with Outliers. CoRR (2019)
Sudeshna Kolay, Ragukumar Pandurangan, Fahad Panolan, Venkatesh Raman, Prafullkumar Tale
Harmonious coloring: Parameterized algorithms and upper bounds. Theor. Comput. Sci. 772 (2019)
Fedor V. Fomin, Petteri Kaski, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree. SIAM J. Discret. Math. 33 (1) (2019)
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
Going Far From Degeneracy. CoRR (2019)
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
Going Far From Degeneracy. ESA (2019)
Fahad Panolan, Saket Saurabh, Meirav Zehavi
Parameterized Algorithms for List K-Cycle. Algorithmica 81 (3) (2019)
Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
Decomposition of Map Graphs with Applications. ICALP (2019)
Neeldhara Misra, Fahad Panolan, Ashutosh Rai, Venkatesh Raman, Saket Saurabh
Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs. Algorithmica 81 (1) (2019)
Fahad Panolan, Saket Saurabh, Meirav Zehavi
Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity. SODA (2019)
Sudeshna Kolay, Fahad Panolan, Saket Saurabh
Communication Complexity and Graph Families. ACM Trans. Comput. Theory 11 (2) (2019)
Eduard Eiben, Dusan Knop, Fahad Panolan, Ondrej Suchý
Complexity of the Steiner Network Problem with Respect to the Number of Terminals. STACS (2019)
Syed Mohammad Meesum, Fahad Panolan, Saket Saurabh, Meirav Zehavi
Rank Vertex Cover as a Natural Problem for Algebraic Compression. SIAM J. Discret. Math. 33 (3) (2019)
Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Kirill Simonov
Low-rank binary matrix approximation in column-sum norm. CoRR (2019)
Jayakrishnan Madathil, Fahad Panolan, Abhishek Sahu, Saket Saurabh
On the Complexity of Mixed Dominating Set. CSR (2019)
Eduard Eiben, Mithilesh Kumar, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz
Lossy Kernels for Connected Dominating Set on Sparse Graphs. SIAM J. Discret. Math. 33 (3) (2019)
Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
Decomposition of Map Graphs with Applications. CoRR (2019)

Fahad Panolan.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Fahad Panolan