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
1842016
Lossy kernelization
D Lokshtanov, F Panolan, MS Ramanujan, S Saurabh
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing†…, 2017
1002017
Representative families of product families
FV Fomin, D Lokshtanov, F Panolan, S Saurabh
ACM Transactions on Algorithms (TALG) 13 (3), 1-29, 2017
68*2017
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
652015
Deterministic truncation of linear matroids
D Lokshtanov, P Misra, F Panolan, S Saurabh
ACM Transactions on Algorithms (TALG) 14 (2), 1-20, 2018
632018
Reconfiguration on sparse graphs
D Lokshtanov, AE Mouawad, F Panolan, MS Ramanujan, S Saurabh
Journal of Computer and System Sciences 95, 122-131, 2018
502018
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
342019
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
312019
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, 879-911, 2019
302019
Parameterized low-rank binary matrix approximation
FV Fomin, PA Golovach, F Panolan
Data Mining and Knowledge Discovery 34, 478-532, 2020
292020
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
25*2015
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
242020
Subexponential algorithms for rectilinear Steiner tree and arborescence problems
FV Fomin, D Lokshtanov, S Kolay, F Panolan, S Saurabh
ACM Transactions on Algorithms (TALG) 16 (2), 1-37, 2020
212020
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
21*2019
Long directed (s, t)-path: FPT algorithm
FV Fomin, D Lokshtanov, F Panolan, S Saurabh, M Zehavi
Information Processing Letters 140, 8-12, 2018
212018
Covering small independent sets and separators with applications to parameterized algorithms
D Lokshtanov, F Panolan, S Saurabh, R Sharma, M Zehavi
ACM Transactions on Algorithms (TALG) 16 (3), 1-31, 2020
182020
A fixed-parameter tractable algorithm for elimination distance to bounded degree graphs
A Agrawal, L Kanesh, F Panolan, MS Ramanujan, S Saurabh
SIAM Journal on Discrete Mathematics 36 (2), 911-921, 2022
17*2022
On the optimality of pseudo-polynomial algorithms for integer programming
FV Fomin, F Panolan, MS Ramanujan, S Saurabh
arXiv preprint arXiv:1607.05342, 2016
17*2016
Diverse collections in matroids and graphs
FV Fomin, PA Golovach, F Panolan, G Philip, S Saurabh
Mathematical Programming, 1-33, 2023
162023
Subexponential algorithm for d-cluster edge deletion: exception or rule?
N Misra, F Panolan, S Saurabh
Journal of Computer and System Sciences 113, 150-162, 2020
16*2020
The system can't perform the operation now. Try again later.
Articles 1–20