Fahad Panolan - Research Publications - IIT Hyderabad Research Profile

Publications (111)

Sort by Year (most recent)

Sort by Year (oldest first)

Sort by Most Cited

Sort by Recently Added

Sort (A-Z)

Sort (Z-A)

Conferences
On the parameterized complexity of reconfiguration of connected dominating sets
D. Lokshtanov, A.E. Mouawad,
Fahad Panolan
and S. Siebertz
2020 | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Conferences
Hitting topological minors is FPT
F.V. Fomin, D. Lokshtanov,
Fahad Panolan
, ..., M. Zehavi (5 authors)
2020 | Association for Computing Machinery
Articles
Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms
D. Lokshtanov,
Fahad Panolan
, ..., M. Zehavi (5 authors)
2020
Articles
Parameterized Complexity of Geometric Covering Problems Having Conflicts
A. Banik,
Fahad Panolan
, ..., S. Saurabh (5 authors)
2020 | Springer
Conferences
Going far from degeneracy
F.V. Fomin, P.A. Golovach, ...,
Fahad Panolan
, ..., M. Zehavi (6 authors)
2019 | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Articles
Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs
F.V. Fomin, D. Lokshtanov,
Fahad Panolan
, ..., M. Zehavi (5 authors)
2019 | Springer New York LLC
PDFPublisher Copy
Articles
Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs
N. Misra,
Fahad Panolan
, ..., S. Saurabh (5 authors)
2019 | Springer New York LLC
Conferences
On the complexity of mixed dominating SET
J. Madathil,
Fahad Panolan
, ..., S. Saurabh (4 authors)
2019 | Springer Verlag
Conferences
Parameterized Computational Geometry via Decomposition Theorems
Fahad Panolan
, S. Saurabh and M. Zehavi
2019 | Springer Verlag
Conferences
Complexity of the steiner network problem with respect to the number of terminals
E. Eiben, D. Knop,
Fahad Panolan
and O. Suchý
2019 | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Conferences
Refined complexity of PCA with outliers
F. Fomin, P. Golovach,
Fahad Panolan
and K. Simonov
2019 | International Machine Learning Society (IMLS)
Articles
Approximation schemes for low-rank binary matrix approximation problems
F.V. Fomin, P.A. Golovach, ...,
Fahad Panolan
and S. Saurabh (5 authors)
2019 | Association for Computing Machinery
Articles
Lossy kernels for connected dominating set on sparse graphs
E. Eiben, M. Kumar, ...,
Fahad Panolan
and S. Siebertz (5 authors)
2019 | Society for Industrial and Applied Mathematics Publications
PDFPublisher Copy
Articles
Editing to connected F-degree graph
F.V. Fomin, P. Golovach,
Fahad Panolan
and S. Saurabh
2019 | Society for Industrial and Applied Mathematics Publications
PDFPublisher Copy
Articles
Rank vertex cover as a natural problem for algebraic compression
S.M. Meesum,
Fahad Panolan
, ..., M. Zehavi (4 authors)
2019 | Society for Industrial and Applied Mathematics Publications
Articles
Parameterized Algorithms for List K-Cycle
Fahad Panolan
, S. Saurabh and M. Zehavi
2019 | Springer New York LLC
PDFPublisher Copy
Conferences
On the parameterized complexity of edge-linked paths
N. Misra,
Fahad Panolan
and S. Saurabh
2019 | Springer Verlag
Articles
Stability in barter exchange markets
S. Gupta,
Fahad Panolan
, ..., M. Zehavi (4 authors)
2019 | Springer New York LLC
Conferences
Decomposition of map graphs with applications
F.V. Fomin, D. Lokshtanov,
Fahad Panolan
, ..., M. Zehavi (5 authors)
2019 | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Articles
Communication complexity and graph families
S. Kolay,
Fahad Panolan
and S. Saurabh
2019 | Association for Computing Machinery

Showing 41-60 of 111 results