Fahad Panolan - RankMe

192 papers A* 27A 14B 27Misc 8Journal 97Unranked 18

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Covering and partitioning of split, chain and cographs with isometric paths. Theor. Comput. Sci. Dibyayan Chakraborty, Haiko Müller, Sebastian Ordyniak, Fahad Panolan, Mateusz Rychlicki
2026	J	`jnl`	On the polynomial kernelizations of finding a shortest path with positive disjunctive constraints. Inf. Comput. Susobhan Bandopadhyay, Suman Banerjee, Diptapriyo Majumdar, Fahad Panolan
2026	J	`jnl`	Packing Short Cycles. ACM Trans. Algorithms Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, William Lochet, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Kirill Simonov
2026	J	`jnl`	Parameterized Approximation Schemes for Biclique-Free Max ACM Trans. Algorithms Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana
2025	A*	`conf`	Crossing Number in Slightly Superexponential Time (Extended Abstract). SODA Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Jie Xue, Meirav Zehavi
2025	A*	`conf`	Efficiently Finding and Counting Patterns with Distance Constraints in Sparse Graphs. STOC Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2025	—	`conf`	Fast FPT Algorithms for Grundy Number on Dense Graphs. CALDAM Sina Ghasemi Nezhad, Maryam Moghaddas, Fahad Panolan
2025	J	`jnl`	Max-SAT with cardinality constraint parameterized by the number of clauses. Theor. Comput. Sci. Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana
2025	J	`jnl`	On MAX-SAT with cardinality constraint. Theor. Comput. Sci. Fahad Panolan, Hannane Yaghoubizade
2025	A*	`conf`	Packing Short Cycles. SODA Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, William Lochet, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Kirill Simonov
2025	—	`conf`	Parameterized Complexity of Generalizations of Edge Dominating Set. SOFSEM (1) Shubhada Aute, Fahad Panolan, Souvik Saha, Saket Saurabh, Anannya Upasana
2025	A	`conf`	Parameterized Saga of First-Fit and Last-Fit Coloring. STACS Akanksha Agrawal, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Shaily Verma
2025	J	`jnl`	Parameterized algorithms for minimum sum vertex cover. Theor. Comput. Sci. Shubhada Aute, Fahad Panolan
2025	B	`conf`	Quasipolynomial-Time Deterministic Kernelization and (Gammoid) Representation. MFCS Rohit Gurjar, Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2025	B	`conf`	Streaming Algorithms for Conflict-Free Coloring. WADS Rogers Mathew, Fahad Panolan, Seshikanth
2025	A*	`conf`	Subexponential Parameterized Algorithms for Hitting Subgraphs. STOC Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2024	A*	`conf`	A 1.9999-Approximation Algorithm for Vertex Cover on String Graphs. SoCG Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2024	A	`conf`	Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3. APPROX/RANDOM Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2024	J	`jnl`	Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3. CoRR Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2024	J	`jnl`	Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity. ACM Trans. Algorithms Fahad Panolan, Saket Saurabh, Meirav Zehavi
2024	B	`conf`	Covering and Partitioning of Split, Chain and Cographs with Isometric Paths. MFCS Dibyayan Chakraborty, Haiko Müller, Sebastian Ordyniak, Fahad Panolan, Mateusz Rychlicki
2024	A	`conf`	Decremental Sensitivity Oracles for Covering and Packing Minors. STACS Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Peter Strulo
2024	J	`jnl`	Diverse collections in matroids and graphs. Math. Program. Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh
2024	J	`jnl`	Fast FPT Algorithms for Grundy Number on Dense Graphs. CoRR Sina Ghasemi Nezhad, Maryam Moghaddas, Fahad Panolan
2024	J	`jnl`	Improved FPT Algorithms for Deletion to Forest-Like Structures. Algorithmica Kishen N. Gowda, Aditya Lonkar, Fahad Panolan, Vraj Patel, Saket Saurabh
2024	—	`conf`	Max-SAT with Cardinality Constraint Parameterized by the Number of Clauses. LATIN (2) Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana
2024	A*	`conf`	Meta-theorems for Parameterized Streaming Algorithms‡. SODA Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
2024	B	`conf`	On MAX-SAT with Cardinality Constraint. WALCOM Fahad Panolan, Hannane Yaghoubizade
2024	J	`jnl`	Packing Short Cycles. CoRR Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, William Lochet, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Kirill Simonov
2024	—	`conf`	Parameterized Algorithms and Hardness for the Maximum Edge q-Coloring Problem. FSTTCS Rogers Mathew, Fahad Panolan, Seshikanth
2024	—	`conf`	Parameterized Algorithms for Minimum Sum Vertex Cover. LATIN (2) Shubhada Aute, Fahad Panolan
2024	J	`jnl`	Parameterized Algorithms for Minimum Sum Vertex Cover. CoRR Shubhada Aute, Fahad Panolan
2024	—	`conf`	Parameterized Complexity of Shortest Path with Positive Disjunctive Constraints. COCOA (2) Susobhan Bandopadhyay, Suman Banerjee, Diptapriyo Majumdar, Fahad Panolan
2024	J	`jnl`	Parameterized Saga of First-Fit and Last-Fit Coloring. CoRR Akanksha Agrawal, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Shaily Verma
2024	A*	`conf`	Solving Quantified Boolean Formulas with Few Existential Variables. IJCAI Leif Eriksson, Victor Lagerkvist, Sebastian Ordyniak, George Osipov, Fahad Panolan, Mateusz Rychlicki
2024	J	`jnl`	Solving Quantified Boolean Formulas with Few Existential Variables. CoRR Leif Eriksson, Victor Lagerkvist, George Osipov, Sebastian Ordyniak, Fahad Panolan, Mateusz Rychlicki
2024	J	`jnl`	Subexponential Parameterized Algorithms for Hitting Subgraphs. CoRR Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2024	—	`conf`	When Far Is Better: The Chamberlin-Courant Approach to Obnoxious Committee Selection. FSTTCS Sushmita Gupta, Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2024	J	`jnl`	When far is better: The Chamberlin-Courant approach to obnoxious committee selection. CoRR Sushmita Gupta, Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2023	A*	`conf`	A Framework for Approximation Schemes on Disk Graphs. SODA Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2023	B	`conf`	An ETH-Tight Algorithm for Bidirected Steiner Connectivity. WADS Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2023	J	`jnl`	Hitting Subgraphs in Sparse Graphs and Geometric Intersection Graphs. CoRR Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2023	J	`jnl`	Meta-theorems for Parameterized Streaming Algorithms. CoRR Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
2023	J	`jnl`	On the optimality of pseudo-polynomial algorithms for integer programming. Math. Program. Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2023	A*	`conf`	Parameterized Approximation Scheme for Biclique-free Max SODA Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana
2023	J	`jnl`	Shortest Path with Positive Disjunctive Constraints - a Parameterized Perspective. CoRR Susobhan Bandopadhyay, Suman Banerjee, Diptapriyo Majumdar, Fahad Panolan
2023	B	`conf`	Socially Fair Matching: Exact and Approximation Algorithms. WADS Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Fahad Panolan, Kirill Simonov
2022	J	`jnl`	A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs. SIAM J. Discret. Math. Akanksha Agrawal, Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2022	J	`jnl`	A Framework for Approximation Schemes on Disk Graphs. CoRR Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2022	A*	`conf`	Backdoor Sets on Nowhere Dense SAT. ICALP Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan
2022	B	`conf`	Boolean and $\mathbb{F}_{p}$-Matrix Factorization: From Theory to Practice. IJCNN Fedor V. Fomin, Fahad Panolan, Anurag Patil, Adil Tanveer
2022	J	`jnl`	Boolean and F CoRR Fedor V. Fomin, Fahad Panolan, Anurag Patil, Adil Tanveer
2022	A*	`conf`	Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent. SODA Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
2022	J	`jnl`	Fast Exact Algorithms for Survivable Network Design with Uniform Requirements. Algorithmica Akanksha Agrawal, Pranabendu Misra, Fahad Panolan, Saket Saurabh
2022	B	`conf`	List Homomorphism: Beyond the Known Boundaries. LATIN Sriram Bhyravarapu, Satyabrata Jana, Fahad Panolan, Saket Saurabh, Shaily Verma
2022	J	`jnl`	On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets. Algorithmica Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz
2022	Misc	`conf`	Parameterized Complexity of List Coloring and Max Coloring. CSR Bardiya Aryanfard, Fahad Panolan
2022	Misc	`conf`	Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs. CSR Petr A. Golovach, Fahad Panolan, Ashutosh Rai, Saket Saurabh
2022	Misc	`conf`	Partial Vertex Cover on Graphs of Bounded Degeneracy. CSR Fahad Panolan, Hannane Yaghoubizade
2022	J	`jnl`	Partial Vertex Cover on Graphs of Bounded Degeneracy. CoRR Fahad Panolan, Hannane Yaghoubizade
2022	J	`jnl`	Structural Parameterizations with Modulator Oblivion. Algorithmica Ashwin Jacob, Fahad Panolan, Venkatesh Raman, Vibha Sahlot
2022	A*	`conf`	Subexponential Parameterized Algorithms on Disk Graphs (Extended Abstract). SODA Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi
2022	J	`jnl`	Target Set Selection Parameterized by Vertex Cover and More. Theory Comput. Syst. Suman Banerjee, Rogers Mathew, Fahad Panolan
2021	J	`jnl`	2-Approximating Feedback Vertex Set in Tournaments. ACM Trans. Algorithms Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Fahad Panolan, Geevarghese Philip, Saket Saurabh
2021	A	`conf`	An FPT Algorithm for Elimination Distance to Bounded Degree Graphs. STACS Akanksha Agrawal, Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2021	A	`conf`	Diverse Collections in Matroids and Graphs. STACS Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh
2021	J	`jnl`	Diverse Collections in Matroids and Graphs. CoRR Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh
2021	A*	`conf`	EPTAS for SODA Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov
2021	J	`jnl`	ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs. J. Comput. Geom. Meirav Zehavi, Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2021	J	`jnl`	Elimination Distance to Topological-minor-free Graphs is FPT. CoRR Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2021	A*	`conf`	Fixed-Parameter and Approximation Algorithms for PCA with Outliers. ICML Yogesh Dahiya, Fedor V. Fomin, Fahad Panolan, Kirill Simonov
2021	B	`conf`	Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms. SAGT Sushmita Gupta, Pallavi Jain, Fahad Panolan, Sanjukta Roy, Saket Saurabh
2021	J	`jnl`	Gerrymandering on graphs: Computational complexity and parameterized algorithms. CoRR Sushmita Gupta, Pallavi Jain, Fahad Panolan, Sanjukta Roy, Saket Saurabh
2021	J	`jnl`	Multiplicative Parameterization Above a Guarantee. ACM Trans. Comput. Theory Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2021	J	`jnl`	Simultaneous Feedback Edge Set: A Parameterized Perspective. Algorithmica Akanksha Agrawal, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2020	A*	`conf`	2-Approximating Feedback Vertex Set in Tournaments. SODA Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Fahad Panolan, Geevarghese Philip, Saket Saurabh
2020	A*	`conf`	A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion. ICALP Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh
2020	J	`jnl`	Approximation Schemes for Low-rank Binary Matrix Approximation Problems. ACM Trans. Algorithms Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2020	J	`jnl`	Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. ACM Trans. Algorithms Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2020	J	`jnl`	EPTAS for k-means Clustering of Affine Subspaces. CoRR Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov
2020	A*	`conf`	ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs. SoCG Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2020	J	`jnl`	ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs. CoRR Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2020	J	`jnl`	Going Far from Degeneracy. SIAM J. Discret. Math. Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2020	A*	`conf`	Hitting topological minors is FPT. STOC Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2020	B	`conf`	Improved FPT Algorithms for Deletion to Forest-Like Structures. ISAAC Kishen N. Gowda, Aditya Lonkar, Fahad Panolan, Vraj Patel, Saket Saurabh
2020	J	`jnl`	Improved FPT Algorithms for Deletion to Forest-like Structures. CoRR Kishen N. Gowda, Aditya Lonkar, Fahad Panolan, Vraj Patel, Saket Saurabh
2020	J	`jnl`	Linear representation of transversal matroids and gammoids parameterized by rank. Theor. Comput. Sci. Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2020	—	`conf`	Low-Rank Binary Matrix Approximation in Column-Sum Norm. APPROX-RANDOM Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Kirill Simonov
2020	A*	`conf`	Manipulating Districts to Win Elections: Fine-Grained Complexity. AAAI Eduard Eiben, Fedor V. Fomin, Fahad Panolan, Kirill Simonov
2020	J	`jnl`	Manipulating Districts to Win Elections: Fine-Grained Complexity. CoRR Eduard Eiben, Fedor V. Fomin, Fahad Panolan, Kirill Simonov
2020	B	`conf`	On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets. IPEC Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz
2020	J	`jnl`	On the parameterized complexity of [1, Theor. Comput. Sci. Mohsen Alambardar Meybodi, Fedor V. Fomin, Amer E. Mouawad, Fahad Panolan
2020	A	`conf`	Parameterization Above a Multiplicative Guarantee. ITCS Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2020	—	`conf`	Parameterized Complexity of Feedback Vertex Sets on Hypergraphs. FSTTCS Pratibha Choudhary, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2020	J	`jnl`	Parameterized Complexity of Geometric Covering Problems Having Conflicts. Algorithmica Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot, Saket Saurabh
2020	J	`jnl`	Parameterized low-rank binary matrix approximation. Data Min. Knowl. Discov. Fedor V. Fomin, Petr A. Golovach, Fahad Panolan
2020	B	`conf`	Quick Separation in Chordal and Split Graphs. MFCS Pranabendu Misra, Fahad Panolan, Ashutosh Rai, Saket Saurabh, Roohani Sharma
2020	B	`conf`	Structural Parameterizations with Modulator Oblivion. IPEC Ashwin Jacob, Fahad Panolan, Venkatesh Raman, Vibha Sahlot
2020	J	`jnl`	Structural Parameterizations with Modulator Oblivion. CoRR Ashwin Jacob, Fahad Panolan, Venkatesh Raman, Vibha Sahlot
2020	J	`jnl`	Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems. ACM Trans. Algorithms Fedor V. Fomin, Daniel Lokshtanov, Sudeshna Kolay, Fahad Panolan, Saket Saurabh
2020	J	`jnl`	Subexponential algorithm for J. Comput. Syst. Sci. Neeldhara Misra, Fahad Panolan, Saket Saurabh
2019	J	`jnl`	Communication Complexity and Graph Families. ACM Trans. Comput. Theory Sudeshna Kolay, Fahad Panolan, Saket Saurabh
2019	A	`conf`	Complexity of the Steiner Network Problem with Respect to the Number of Terminals. STACS Eduard Eiben, Dusan Knop, Fahad Panolan, Ondrej Suchý
2019	A*	`conf`	Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity. SODA Fahad Panolan, Saket Saurabh, Meirav Zehavi
2019	A*	`conf`	Decomposition of Map Graphs with Applications. ICALP Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Decomposition of Map Graphs with Applications. CoRR Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Editing to Connected F-Degree Graph. SIAM J. Discret. Math. Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Saket Saurabh
2019	J	`jnl`	Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. Discret. Comput. Geom. Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2019	A	`conf`	Going Far From Degeneracy. ESA Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Going Far From Degeneracy. CoRR Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Harmonious coloring: Parameterized algorithms and upper bounds. Theor. Comput. Sci. Sudeshna Kolay, Ragukumar Pandurangan, Fahad Panolan, Venkatesh Raman, Prafullkumar Tale
2019	J	`jnl`	Lossy Kernels for Connected Dominating Set on Sparse Graphs. SIAM J. Discret. Math. Eduard Eiben, Mithilesh Kumar, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz
2019	J	`jnl`	Low-rank binary matrix approximation in column-sum norm. CoRR Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Kirill Simonov
2019	Misc	`conf`	On the Complexity of Mixed Dominating Set. CSR Jayakrishnan Madathil, Fahad Panolan, Abhishek Sahu, Saket Saurabh
2019	Misc	`conf`	On the Parameterized Complexity of Edge-Linked Paths. CSR Neeldhara Misra, Fahad Panolan, Saket Saurabh
2019	J	`jnl`	On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets. CoRR Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz
2019	J	`jnl`	Parameterized Algorithms for List K-Cycle. Algorithmica Fahad Panolan, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs. Algorithmica Neeldhara Misra, Fahad Panolan, Ashutosh Rai, Venkatesh Raman, Saket Saurabh
2019	B	`conf`	Parameterized Computational Geometry via Decomposition Theorems. WALCOM Fahad Panolan, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree. SIAM J. Discret. Math. Fedor V. Fomin, Petteri Kaski, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2019	J	`jnl`	Rank Vertex Cover as a Natural Problem for Algebraic Compression. SIAM J. Discret. Math. Syed Mohammad Meesum, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2019	J	`jnl`	Reducing Topological Minor Containment to the Unique Linkage Theorem. CoRR Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2019	A*	`conf`	Refined Complexity of PCA with Outliers. ICML Kirill Simonov, Fedor V. Fomin, Petr A. Golovach, Fahad Panolan
2019	J	`jnl`	Refined Complexity of PCA with Outliers. CoRR Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Kirill Simonov
2019	J	`jnl`	Stability in barter exchange markets. Auton. Agents Multi Agent Syst. Sushmita Gupta, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2018	J	`jnl`	A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments. CoRR Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Geevarghese Philip, Fahad Panolan, Saket Saurabh
2018	J	`jnl`	Approximation Schemes for Low-Rank Binary Matrix Approximation Problems. CoRR Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2018	J	`jnl`	Complexity of the Steiner Network Problem with Respect to the Number of Terminals. CoRR Eduard Eiben, Dusan Knop, Fahad Panolan, Ondrej Suchý
2018	A*	`conf`	Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. SODA Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2018	J	`jnl`	Deterministic Truncation of Linear Matroids. ACM Trans. Algorithms Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh
2018	J	`jnl`	Finding even subgraphs even faster. J. Comput. Syst. Sci. Prachi Goyal, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh
2018	J	`jnl`	Fréchet Distance Between a Line and Avatar Point Set. Algorithmica Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot
2018	J	`jnl`	Long directed ( Inf. Process. Lett. Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2018	A	`conf`	Lossy Kernels for Connected Dominating Set on Sparse Graphs. STACS Eduard Eiben, Mithilesh Kumar, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz
2018	A	`conf`	On the Optimality of Pseudo-polynomial Algorithms for Integer Programming. ESA Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2018	—	`conf`	On the Parameterized Complexity of [1, j]-Domination Problems. FSTTCS Mohsen Alambardar Meybodi, Fedor V. Fomin, Amer E. Mouawad, Fahad Panolan
2018	J	`jnl`	On the kernelization complexity of string problems. Theor. Comput. Sci. Manu Basavaraju, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan, Saket Saurabh
2018	A*	`conf`	Parameterized Low-Rank Binary Matrix Approximation. ICALP Fedor V. Fomin, Petr A. Golovach, Fahad Panolan
2018	J	`jnl`	Parameterized Low-Rank Binary Matrix Approximation. CoRR Fedor V. Fomin, Petr A. Golovach, Fahad Panolan
2018	A	`conf`	Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity. ITCS Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2018	J	`jnl`	Reconfiguration on sparse graphs. J. Comput. Syst. Sci. Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2018	A	`conf`	Stability in Barter Exchange Markets. AAMAS Sushmita Gupta, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2018	J	`jnl`	Target Set Selection parameterized by vertex cover and more. CoRR Suman Banerjee, Rogers Mathew, Fahad Panolan
2017	B	`conf`	Communication Complexity of Pairs of Graph Families with Applications. MFCS Sudeshna Kolay, Fahad Panolan, Saket Saurabh
2017	J	`jnl`	Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. CoRR Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Meirav Zehavi
2017	B	`conf`	Fast Exact Algorithms for Survivable Network Design with Uniform Requirements. WADS Akanksha Agrawal, Pranabendu Misra, Fahad Panolan, Saket Saurabh
2017	A*	`conf`	Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. ICALP Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2017	J	`jnl`	Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. CoRR Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2017	Misc	`conf`	Linear Representation of Transversal Matroids and Gammoids Parameterized by Rank. COCOON Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2017	J	`jnl`	Lossy Kernels for Connected Dominating Set on Sparse Graphs. CoRR Eduard Eiben, Mithilesh Kumar, Amer E. Mouawad, Fahad Panolan
2017	A*	`conf`	Lossy kernelization. STOC Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2017	B	`conf`	Mixed Dominating Set: A Parameterized Perspective. WG Pallavi Jain, Jayakrishnan Madathil, Fahad Panolan, Abhishek Sahu
2017	J	`jnl`	On the parameterized complexity of b-chromatic number. J. Comput. Syst. Sci. Fahad Panolan, Geevarghese Philip, Saket Saurabh
2017	B	`conf`	Parameterized Complexity of Geometric Covering Problems Having Conflicts. WADS Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot, Saket Saurabh
2017	J	`jnl`	Quick but Odd Growth of Cacti. Algorithmica Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2017	J	`jnl`	Rank Vertex Cover as a Natural Problem for Algebraic Compression. CoRR Syed Mohammad Meesum, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2017	J	`jnl`	Representative Families of Product Families. ACM Trans. Algorithms Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2016	A	`conf`	Editing to Connected f-Degree Graph. STACS Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Saket Saurabh
2016	J	`jnl`	Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms. J. ACM Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2016	J	`jnl`	Fine-grained complexity of integer programming: The case of bounded branch-width and rank. CoRR Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2016	—	`conf`	Fréchet Distance Between a Line and Avatar Point Set. FSTTCS Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot
2016	B	`conf`	Harmonious Coloring: Parameterized Algorithms and Upper Bounds. WG Sudeshna Kolay, Ragukumar Pandurangan, Fahad Panolan, Venkatesh Raman, Prafullkumar Tale
2016	J	`jnl`	Lossy Kernelization. CoRR Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2016	—	`ch.`	Matroids in Parameterized Complexity and Exact Algorithms. Encyclopedia of Algorithms Fahad Panolan, Saket Saurabh
2016	—	`conf`	Parameterized Algorithms for List K-Cycle. FSTTCS Fahad Panolan, Meirav Zehavi
2016	B	`conf`	Parameterized Algorithms on Perfect Graphs for Deletion to (r, l)-Graphs. MFCS Sudeshna Kolay, Fahad Panolan, Venkatesh Raman, Saket Saurabh
2016	B	`conf`	Simultaneous Feedback Edge Set: A Parameterized Perspective. ISAAC Akanksha Agrawal, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2016	J	`jnl`	Simultaneous Feedback Edge Set: A Parameterized Perspective. CoRR Akanksha Agrawal, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2016	A*	`conf`	Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems. SoCG Fedor V. Fomin, Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2015	B	`conf`	B-Chromatic Number: Beyond NP-Hardness. IPEC Fahad Panolan, Geevarghese Philip, Saket Saurabh
2015	J	`jnl`	Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets. SIAM J. Discret. Math. Prachi Goyal, Neeldhara Misra, Fahad Panolan, Meirav Zehavi
2015	—	`conf`	Deterministic Truncation of Linear Matroids. ICALP (1) Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh
2015	J	`jnl`	Faster Parameterized Algorithms for Deletion to Split Graphs. Algorithmica Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan
2015	—	`conf`	Finding Even Subgraphs Even Faster. FSTTCS Prachi Goyal, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh
2015	B	`conf`	On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids. WADS Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2015	—	`conf`	Parameterized Algorithms for Deletion to (r, ell)-Graphs. FSTTCS Sudeshna Kolay, Fahad Panolan
2015	J	`jnl`	Parameterized Algorithms for Deletion to (r, l)-graphs. CoRR Sudeshna Kolay, Fahad Panolan
2015	J	`jnl`	Parameterized Algorithms on Perfect Graphs for deletion to (r, ℓ)-graphs. CoRR Sudeshna Kolay, Fahad Panolan, Venkatesh Raman, Saket Saurabh
2015	—	`conf`	Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree. ICALP (1) Fedor V. Fomin, Petteri Kaski, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2015	B	`conf`	Quick but Odd Growth of Cacti. IPEC Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2015	B	`conf`	Reconfiguration on Sparse Graphs. WADS Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2015	J	`jnl`	Reconfiguration on sparse graphs. CoRR Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, M. S. Ramanujan, Saket Saurabh
2014	J	`jnl`	Deterministic Truncation of Linear Matroids. CoRR Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh
2014	J	`jnl`	Finding Even Subgraphs Even Faster. CoRR Prachi Goyal, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh
2014	Misc	`conf`	On the Kernelization Complexity of String Problems. COCOON Manu Basavaraju, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan, Saket Saurabh
2014	A	`conf`	Representative Sets of Product Families. ESA Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2014	J	`jnl`	Representative Sets of Product Families. CoRR Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2013	—	`conf`	Faster Deterministic Algorithms for r-Dimensional Matching Using Representative Sets. FSTTCS Prachi Goyal, Neeldhara Misra, Fahad Panolan
2013	B	`conf`	Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs. WG Neeldhara Misra, Fahad Panolan, Ashutosh Rai, Venkatesh Raman, Saket Saurabh
2013	B	`conf`	Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule? MFCS Neeldhara Misra, Fahad Panolan, Saket Saurabh
2012	—	`conf`	Faster Parameterized Algorithms for Deletion to Split Graphs. SWAT Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan
2012	Misc	`conf`	On the Kernelization Complexity of Problems on Graphs without Long Odd Cycles. COCOON Fahad Panolan, Ashutosh Rai