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
Multiplicative Parameterization above a Guarantee
F.V. Fomin, P.A. Golovach, ...,
Fahad Panolan
, ..., M. Zehavi (6 authors)
2021 | Association for Computing Machinery
Conferences
Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms
S. Gupta, P. Jain,
Fahad Panolan
, ..., S. Saurabh (5 authors)
2021 | Springer Science and Business Media Deutschland GmbH
Conferences
Fixed-Parameter and Approximation Algorithms for PCA with Outliers
Y. Dahiya, F. Fomin,
Fahad Panolan
and K. Simonov
2021 | ML Research Press
Articles
2-Approximating Feedback Vertex Set in Tournaments
D. Lokshtanov, P. Misra, ...,
Fahad Panolan
, ..., S. Saurabh (6 authors)
2021 | Association for Computing Machinery
Conferences
Improved FPT algorithms for deletion to forest-like structures
K.N. Gowda, A. Lonkar,
Fahad Panolan
, ..., S. Saurabh (5 authors)
2020 | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Conferences
Structural parameterizations with modulator oblivion
A. Jacob,
Fahad Panolan
, ..., V. Sahlot (4 authors)
2020 | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Conferences
Low-rank binary matrix approximation in column-sum norm
F.V. Fomin, P.A. Golovach,
Fahad Panolan
and K. Simonov
2020 | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Conferences
A (2 + ε)-factor approximation algorithm for split vertex deletion
D. Lokshtanov, P. Misra,
Fahad Panolan
, ..., S. Saurabh (5 authors)
2020 | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Conferences
2-approximating feedback vertex set in tournaments
D. Lokshtanov, P. Misra, ...,
Fahad Panolan
, ..., S. Saurabh (6 authors)
2020 | Association for Computing Machinery
Articles
Parameterized low-rank binary matrix approximation
F.V. Fomin, P.A. Golovach and
Fahad Panolan
2020 | Springer
PDFPublisher Copy
Articles
Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems
F.V. Fomin, D. Lokshtanov, ...,
Fahad Panolan
and S. Saurabh (5 authors)
2020 | Association for Computing Machinery
Articles
On the parameterized complexity of [1,j]-domination problems
M. Alambardar Meybodi, F.V. Fomin, ...,
Fahad Panolan
(4 authors)
2020 | Elsevier B.V.
PDFPublisher Copy
Conferences
Quick separation in chordal and split graphs
P. Misra,
Fahad Panolan
, ..., R. Sharma (5 authors)
2020 | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Conferences
Parameterized complexity of feedback vertex sets on hypergraphs
P. Choudhary, L. Kanesh, ...,
Fahad Panolan
and S. Saurabh (5 authors)
2020 | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Articles
Going far from degeneracy
F.V. Fomin, P.A. Golovach, ...,
Fahad Panolan
, ..., M. Zehavi (6 authors)
2020 | Society for Industrial and Applied Mathematics Publications
Conferences
Manipulating districts to win elections: Fine-grained complexity
E. Eiben, F.V. Fomin,
Fahad Panolan
and K. Simonov
2020 | AAAI press
Conferences
Parameterization above a multiplicative guarantee
F.V. Fomin, P.A. Golovach, ...,
Fahad Panolan
, ..., M. Zehavi (6 authors)
2020 | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Articles
Linear representation of transversal matroids and gammoids parameterized by rank
P. Misra,
Fahad Panolan
, ..., S. Saurabh (4 authors)
2020 | Elsevier B.V.
Articles
Subexponential algorithm for d-cluster edge deletion: Exception or rule?
N. Misra,
Fahad Panolan
and S. Saurabh
2020 | Academic Press Inc.
Conferences
Eth-tight algorithms for long path and cycle on unit disk graphs
F.V. Fomin, D. Lokshtanov,
Fahad Panolan
, ..., M. Zehavi (5 authors)
2020 | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

Showing 21-40 of 111 results