Follow
Fahad Panolan
Title
Cited by
Cited by
Year
Efficient computation of representative families with applications in parameterized and exact algorithms
FV Fomin, D Lokshtanov, F Panolan, S Saurabh
Journal of the ACM (JACM) 63 (4), 1-60, 2016
1352016
Lossy kernelization
D Lokshtanov, F Panolan, MS Ramanujan, S Saurabh
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
732017
Faster parameterized algorithms for deletion to split graphs
E Ghosh, S Kolay, M Kumar, P Misra, F Panolan, A Rai, MS Ramanujan
Algorithmica 71 (4), 989-1006, 2015
612015
Representative families of product families
FV Fomin, D Lokshtanov, F Panolan, S Saurabh
ACM Transactions on Algorithms (TALG) 13 (3), 1-29, 2017
57*2017
Deterministic truncation of linear matroids
D Lokshtanov, P Misra, F Panolan, S Saurabh
ACM Transactions on Algorithms (TALG) 14 (2), 1-20, 2018
442018
Reconfiguration on sparse graphs
D Lokshtanov, AE Mouawad, F Panolan, MS Ramanujan, S Saurabh
Journal of Computer and System Sciences 95, 122-131, 2018
402018
Lossy kernels for connected dominating set on sparse graphs
E Eiben, M Kumar, AE Mouawad, F Panolan, S Siebertz
SIAM Journal on Discrete Mathematics 33 (3), 1743-1771, 2019
252019
Deterministic algorithms for matching and packing problems based on representative sets
P Goyal, N Misra, F Panolan, M Zehavi
SIAM Journal on Discrete Mathematics 29 (4), 1815-1836, 2015
21*2015
Finding, hitting and packing cycles in subexponential time on unit disk graphs
FV Fomin, D Lokshtanov, F Panolan, S Saurabh, M Zehavi
Discrete & Computational Geometry 62 (4), 879-911, 2019
202019
Approximation schemes for low-rank binary matrix approximation problems
FV Fomin, PA Golovach, D Lokshtanov, F Panolan, S Saurabh
ACM Transactions on Algorithms (TALG) 16 (1), 1-39, 2019
192019
Parameterized low-rank binary matrix approximation
FV Fomin, PA Golovach, F Panolan
Data Mining and Knowledge Discovery 34 (2), 478-532, 2020
182020
Parameterized single-exponential time polynomial space algorithm for Steiner tree
FV Fomin, P Kaski, D Lokshtanov, F Panolan, S Saurabh
SIAM Journal on Discrete Mathematics 33 (1), 327-345, 2019
18*2019
Parameterized Algorithms for Deletion to (r, l)-Graphs
S Kolay, F Panolan
arXiv preprint arXiv:1504.08120, 2015
152015
On the optimality of pseudo-polynomial algorithms for integer programming
FV Fomin, F Panolan, MS Ramanujan, S Saurabh
Mathematical Programming, 1-33, 2022
13*2022
Long directed (s, t)-path: FPT algorithm
FV Fomin, D Lokshtanov, F Panolan, S Saurabh, M Zehavi
Information Processing Letters 140, 8-12, 2018
132018
Hitting topological minors is FPT
FV Fomin, D Lokshtanov, F Panolan, S Saurabh, M Zehavi
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
122020
Refined complexity of PCA with outliers
K Simonov, F Fomin, P Golovach, F Panolan
International Conference on Machine Learning, 5818-5826, 2019
122019
Editing to connected f-degree graph
FV Fomin, P Golovach, F Panolan, S Saurabh
SIAM Journal on Discrete Mathematics 33 (2), 795-836, 2019
122019
An FPT algorithm for elimination distance to bounded degree graphs
A Agrawal, L Kanesh, F Panolan, MS Ramanujan, S Saurabh
38th International Symposium on Theoretical Aspects of Computer Science …, 2021
112021
Finding even subgraphs even faster
P Goyal, P Misra, F Panolan, G Philip, S Saurabh
Journal of Computer and System Sciences 97, 1-13, 2018
112018
The system can't perform the operation now. Try again later.
Articles 1–20