Fahad Panolan

According to our database, Fahad Panolan authored at least 112 papers between 2012 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

On MAX-SAT with cardinality constraint.

Fahad Panolan, Hannane Yaghoubizade

Theor. Comput. Sci., 2025

2024

Improved FPT Algorithms for Deletion to Forest-Like Structures.

Kishen N. Gowda, Aditya Lonkar, Fahad Panolan, Vraj Patel, Saket Saurabh

Algorithmica, May, 2024

Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity.

Fahad Panolan, Saket Saurabh, Meirav Zehavi

ACM Trans. Algorithms, April, 2024

Diverse collections in matroids and graphs.

Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh

Math. Program., March, 2024

Parameterized Saga of First-Fit and Last-Fit Coloring.

Akanksha Agrawal, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Shaily Verma

CoRR, 2024

Packing Short Cycles.

Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, William Lochet, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Kirill Simonov

CoRR, 2024

Subexponential Parameterized Algorithms for Hitting Subgraphs.

Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi

CoRR, 2024

Decremental Sensitivity Oracles for Covering and Packing Minors.

Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Peter Strulo

Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

Meta-theorems for Parameterized Streaming Algorithms‡.

Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Covering and Partitioning of Split, Chain and Cographs with Isometric Paths.

Dibyayan Chakraborty, Haiko Müller, Sebastian Ordyniak, Fahad Panolan, Mateusz Rychlicki

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

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

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

Parameterized Algorithms for Minimum Sum Vertex Cover.

Shubhada Aute, Fahad Panolan

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

Solving Quantified Boolean Formulas with Few Existential Variables.

Leif Eriksson, Victor Lagerkvist, Sebastian Ordyniak, George Osipov, Fahad Panolan, Mateusz Rychlicki

Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Parameterized Algorithms and Hardness for the Maximum Edge q-Coloring Problem.

Rogers Mathew, Fahad Panolan, Seshikanth

Proceedings of the 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2024

When Far Is Better: The Chamberlin-Courant Approach to Obnoxious Committee Selection.

Sushmita Gupta, Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh

Proceedings of the 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2024

A 1.9999-Approximation Algorithm for Vertex Cover on String Graphs.

Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi

Proceedings of the 40th International Symposium on Computational Geometry, 2024

Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3.

Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi

Proceedings of the Approximation, 2024

2023

On the optimality of pseudo-polynomial algorithms for integer programming.

Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan, Saket Saurabh

Math. Program., March, 2023

Shortest Path with Positive Disjunctive Constraints - a Parameterized Perspective.

Susobhan Bandopadhyay, Suman Banerjee, Diptapriyo Majumdar, Fahad Panolan

CoRR, 2023

Hitting Subgraphs in Sparse Graphs and Geometric Intersection Graphs.

Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi

CoRR, 2023

An ETH-Tight Algorithm for Bidirected Steiner Connectivity.

Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Socially Fair Matching: Exact and Approximation Algorithms.

Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Fahad Panolan, Kirill Simonov

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

A Framework for Approximation Schemes on Disk Graphs.

Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Parameterized Approximation Scheme for Biclique-free Max <i>k</i>-Weight SAT and Max Coverage.

Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, Anannya Upasana

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs.

Akanksha Agrawal, Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Saket Saurabh

SIAM J. Discret. Math., 2022

Target Set Selection Parameterized by Vertex Cover and More.

Suman Banerjee, Rogers Mathew, Fahad Panolan

Theory Comput. Syst., 2022

Boolean and F_p-Matrix Factorization: From Theory to Practice.

Fedor V. Fomin, Fahad Panolan, Anurag Patil, Adil Tanveer

CoRR, 2022

On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets.

Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz

Algorithmica, 2022

Structural Parameterizations with Modulator Oblivion.

Ashwin Jacob, Fahad Panolan, Venkatesh Raman, Vibha Sahlot

Algorithmica, 2022

Fast Exact Algorithms for Survivable Network Design with Uniform Requirements.

Akanksha Agrawal, Pranabendu Misra, Fahad Panolan, Saket Saurabh

Algorithmica, 2022

Subexponential Parameterized Algorithms on Disk Graphs (Extended Abstract).

Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

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

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

List Homomorphism: Beyond the Known Boundaries.

Sriram Bhyravarapu, Satyabrata Jana, Fahad Panolan, Saket Saurabh, Shaily Verma

Proceedings of the LATIN 2022: Theoretical Informatics, 2022

Boolean and $\mathbb{F}_{p}$-Matrix Factorization: From Theory to Practice.

Fedor V. Fomin, Fahad Panolan, Anurag Patil, Adil Tanveer

Proceedings of the International Joint Conference on Neural Networks, 2022

Backdoor Sets on Nowhere Dense SAT.

Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Partial Vertex Cover on Graphs of Bounded Degeneracy.

Fahad Panolan, Hannane Yaghoubizade

Proceedings of the Computer Science - Theory and Applications, 2022

Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs.

Petr A. Golovach, Fahad Panolan, Ashutosh Rai, Saket Saurabh

Proceedings of the Computer Science - Theory and Applications, 2022

Parameterized Complexity of List Coloring and Max Coloring.

Bardiya Aryanfard, Fahad Panolan

Proceedings of the Computer Science - Theory and Applications, 2022

2021

Multiplicative Parameterization Above a Guarantee.

Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi

ACM Trans. Comput. Theory, 2021

2-Approximating Feedback Vertex Set in Tournaments.

Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Fahad Panolan, Geevarghese Philip, Saket Saurabh

ACM Trans. Algorithms, 2021

ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs.

Meirav Zehavi, Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh

J. Comput. Geom., 2021

Elimination Distance to Topological-minor-free Graphs is FPT.

Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh

CoRR, 2021

Simultaneous Feedback Edge Set: A Parameterized Perspective.

Akanksha Agrawal, Fahad Panolan, Saket Saurabh, Meirav Zehavi

Algorithmica, 2021

An FPT Algorithm for Elimination Distance to Bounded Degree Graphs.

Akanksha Agrawal, Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Saket Saurabh

Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

EPTAS for <i>k</i>-means Clustering of Affine Subspaces.

Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms.

Sushmita Gupta, Pallavi Jain, Fahad Panolan, Sanjukta Roy, Saket Saurabh

Proceedings of the Algorithmic Game Theory - 14th International Symposium, 2021

Fixed-Parameter and Approximation Algorithms for PCA with Outliers.

Yogesh Dahiya, Fedor V. Fomin, Fahad Panolan, Kirill Simonov

Proceedings of the 38th International Conference on Machine Learning, 2021

2020

Linear representation of transversal matroids and gammoids parameterized by rank.

Pranabendu Misra, Fahad Panolan, M. S. Ramanujan, Saket Saurabh

Theor. Comput. Sci., 2020

On the parameterized complexity of [1, <i>j</i>]-domination problems.

Mohsen Alambardar Meybodi, Fedor V. Fomin, Amer E. Mouawad, Fahad Panolan

Theor. Comput. Sci., 2020

Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms.

Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Meirav Zehavi

ACM Trans. Algorithms, 2020

Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems.

Fedor V. Fomin, Daniel Lokshtanov, Sudeshna Kolay, Fahad Panolan, Saket Saurabh

ACM Trans. Algorithms, 2020

Approximation Schemes for Low-rank Binary Matrix Approximation Problems.

Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh

ACM Trans. Algorithms, 2020

Going Far from Degeneracy.

Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi

SIAM J. Discret. Math., 2020

Subexponential algorithm for <i>d</i>-cluster edge deletion: Exception or rule?

Neeldhara Misra, Fahad Panolan, Saket Saurabh

J. Comput. Syst. Sci., 2020

Parameterized low-rank binary matrix approximation.

Fedor V. Fomin, Petr A. Golovach, Fahad Panolan

Data Min. Knowl. Discov., 2020

EPTAS for k-means Clustering of Affine Subspaces.

Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov

CoRR, 2020

Parameterized Complexity of Geometric Covering Problems Having Conflicts.

Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot, Saket Saurabh

Algorithmica, 2020

Hitting topological minors is FPT.

Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Quick Separation in Chordal and Split Graphs.

Pranabendu Misra, Fahad Panolan, Ashutosh Rai, Saket Saurabh, Roohani Sharma

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Parameterization Above a Multiplicative Guarantee.

Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion.

Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Parameterized Complexity of Feedback Vertex Sets on Hypergraphs.

Pratibha Choudhary, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh

Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

Low-Rank Binary Matrix Approximation in Column-Sum Norm.

Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Kirill Simonov

Proceedings of the Approximation, 2020

Manipulating Districts to Win Elections: Fine-Grained Complexity.

Eduard Eiben, Fedor V. Fomin, Fahad Panolan, Kirill Simonov

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Communication Complexity and Graph Families.

Sudeshna Kolay, Fahad Panolan, Saket Saurabh

ACM Trans. Comput. Theory, 2019

Harmonious coloring: Parameterized algorithms and upper bounds.

Sudeshna Kolay, Ragukumar Pandurangan, Fahad Panolan, Venkatesh Raman, Prafullkumar Tale

Theor. Comput. Sci., 2019

Rank Vertex Cover as a Natural Problem for Algebraic Compression.

Syed Mohammad Meesum, Fahad Panolan, Saket Saurabh, Meirav Zehavi

SIAM J. Discret. Math., 2019

Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree.

Fedor V. Fomin, Petteri Kaski, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh

SIAM J. Discret. Math., 2019

Editing to Connected F-Degree Graph.

Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Saket Saurabh

SIAM J. Discret. Math., 2019

Lossy Kernels for Connected Dominating Set on Sparse Graphs.

Eduard Eiben, Mithilesh Kumar, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz

SIAM J. Discret. Math., 2019

Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs.

Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi

Discret. Comput. Geom., 2019

Reducing Topological Minor Containment to the Unique Linkage Theorem.

Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi

CoRR, 2019

Parameterized Algorithms for List K-Cycle.

Fahad Panolan, Saket Saurabh, Meirav Zehavi

Algorithmica, 2019

Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs.

Neeldhara Misra, Fahad Panolan, Ashutosh Rai, Venkatesh Raman, Saket Saurabh

Algorithmica, 2019

Stability in barter exchange markets.

Sushmita Gupta, Fahad Panolan, Saket Saurabh, Meirav Zehavi

Auton. Agents Multi Agent Syst., 2019

Parameterized Computational Geometry via Decomposition Theorems.

Fahad Panolan, Saket Saurabh, Meirav Zehavi

Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

Complexity of the Steiner Network Problem with Respect to the Number of Terminals.

Eduard Eiben, Dusan Knop, Fahad Panolan, Ondrej Suchý

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

Refined Complexity of PCA with Outliers.

Kirill Simonov, Fedor V. Fomin, Petr A. Golovach, Fahad Panolan

Proceedings of the 36th International Conference on Machine Learning, 2019

Decomposition of Map Graphs with Applications.

Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

On the Parameterized Complexity of Edge-Linked Paths.

Neeldhara Misra, Fahad Panolan, Saket Saurabh

Proceedings of the Computer Science - Theory and Applications, 2019

On the Complexity of Mixed Dominating Set.

Jayakrishnan Madathil, Fahad Panolan, Abhishek Sahu, Saket Saurabh

Proceedings of the Computer Science - Theory and Applications, 2019

2018

On the kernelization complexity of string problems.

Manu Basavaraju, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan, Saket Saurabh

Theor. Comput. Sci., 2018

Deterministic Truncation of Linear Matroids.

Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh

ACM Trans. Algorithms, 2018

Reconfiguration on sparse graphs.

Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, M. S. Ramanujan, Saket Saurabh

J. Comput. Syst. Sci., 2018

Finding even subgraphs even faster.

Prachi Goyal, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh

J. Comput. Syst. Sci., 2018

Long directed (<i>s</i>, <i>t</i>)-path: FPT algorithm.

Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi

Inf. Process. Lett., 2018

A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments.

Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Geevarghese Philip, Fahad Panolan, Saket Saurabh

CoRR, 2018

Fréchet Distance Between a Line and Avatar Point Set.

Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot

Algorithmica, 2018

Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity.

Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi

Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

On the Parameterized Complexity of [1, j]-Domination Problems.

Mohsen Alambardar Meybodi, Fedor V. Fomin, Amer E. Mouawad, Fahad Panolan

Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

2017

Representative Families of Product Families.

Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh

ACM Trans. Algorithms, 2017

On the parameterized complexity of b-chromatic number.

Fahad Panolan, Geevarghese Philip, Saket Saurabh

J. Comput. Syst. Sci., 2017

Lossy Kernels for Connected Dominating Set on Sparse Graphs.

Eduard Eiben, Mithilesh Kumar, Amer E. Mouawad, Fahad Panolan

CoRR, 2017

Quick but Odd Growth of Cacti.

Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh

Algorithmica, 2017

Mixed Dominating Set: A Parameterized Perspective.

Pallavi Jain, Jayakrishnan Madathil, Fahad Panolan, Abhishek Sahu

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

Lossy kernelization.

Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Communication Complexity of Pairs of Graph Families with Applications.

Sudeshna Kolay, Fahad Panolan, Saket Saurabh

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

2016

Matroids in Parameterized Complexity and Exact Algorithms.

Fahad Panolan, Saket Saurabh

Encyclopedia of Algorithms, 2016

Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms.

Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh

J. ACM, 2016

Fine-grained complexity of integer programming: The case of bounded branch-width and rank.

Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan, Saket Saurabh

CoRR, 2016

Parameterized Algorithms on Perfect Graphs for Deletion to (r, l)-Graphs.

Sudeshna Kolay, Fahad Panolan, Venkatesh Raman, Saket Saurabh

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Parameterized Algorithms for List K-Cycle.

Fahad Panolan, Meirav Zehavi

Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

2015

Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets.

Prachi Goyal, Neeldhara Misra, Fahad Panolan, Meirav Zehavi

SIAM J. Discret. Math., 2015

Parameterized Algorithms for Deletion to (r, l)-graphs.

Sudeshna Kolay, Fahad Panolan

CoRR, 2015

Faster Parameterized Algorithms for Deletion to Split Graphs.

Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan

Algorithmica, 2015

On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids.

Fahad Panolan, M. S. Ramanujan, Saket Saurabh

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

B-Chromatic Number: Beyond NP-Hardness.

Fahad Panolan, Geevarghese Philip, Saket Saurabh

Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015

Parameterized Algorithms for Deletion to (r, ell)-Graphs.

Sudeshna Kolay, Fahad Panolan

Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

2014

Representative Sets of Product Families.

Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh

Proceedings of the Algorithms - ESA 2014, 2014

2013

Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule?

Neeldhara Misra, Fahad Panolan, Saket Saurabh

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Faster Deterministic Algorithms for r-Dimensional Matching Using Representative Sets.

Prachi Goyal, Neeldhara Misra, Fahad Panolan

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

2012

On the Kernelization Complexity of Problems on Graphs without Long Odd Cycles.

Fahad Panolan, Ashutosh Rai

Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012