Fahad Panolan

Cited by

	All	Since 2019
Citations	1330	1056
h-index	19	18
i10-index	38	33

280

140

210

2013201420152016201720182019202020212022202320249 12 32 32 60 90 131 156 176 161 261 166

Public access

View all

50 articles

8 articles

available

not available

Based on funding mandates

Co-authors

Saket SaurabhProfessor at Institute of Mathematical SciencesVerified email at imsc.res.in
Daniel LokshtanovProfessor of Computer Science, UCSBVerified email at ucsb.edu
Fedor V. FominProfessor of Computer Science, University of BergenVerified email at uib.no
Meirav ZehaviBen-Gurion University of the NegevVerified email at bgu.ac.il
Pranabendu MisraAssistant Professor at Chennai Mathematical InstituteVerified email at cmi.ac.in
Petr GolovachUniversity of BergenVerified email at ii.uib.no
Sudeshna KolayIIT KharagpurVerified email at cse.iitkgp.ac.in
Ashutosh RaiDepartment of Mathematics, IIT DelhiVerified email at maths.iitd.ac.in
Akanksha AgrawalIndian Institute of Technology MadrasVerified email at cse.iitm.ac.in
Geevarghese PhilipFaculty Member at Chennai Mathematical InstituteVerified email at cmi.ac.in
Lawqueen KaneshIndian Institute of Technology Jodhpur, IndiaVerified email at iitj.ac.in
Neeldhara MisraIndian Institute of Technology, GandhinagarVerified email at iitgn.ac.in
Kirill SimonovPostdoc, TU WienVerified email at ac.tuwien.ac.at
Amer MouawadAmerican University of BeirutVerified email at aub.edu.lb
Eduard EibenLecturer in Computer Science, Royal Holloway, Univeristy of LondonVerified email at rhul.ac.uk
Pallavi JainIndian Institute of Technology Jodhpur, IndiaVerified email at iitj.ac.in
Jie XueNew York University ShanghaiVerified email at nyu.edu
Prachi GoyalMicrosoftVerified email at microsoft.com
Esha GhoshMicrosoft ResearchVerified email at microsoft.com
Vibha SahlotInstitute of Mathematical Sciences, ChennaiVerified email at iitj.ac.in

Fahad Panolan

School of Computing, University of Leeds

Verified email at leeds.ac.uk - Homepage

Parameterised algorithms Approximation algorithms Graph theory and graph algorithms


Title Sort by citations Sort by year Sort by 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	198	2016
Lossy kernelization D Lokshtanov, F Panolan, MS Ramanujan, S Saurabh Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017	105	2017
Representative families of product families FV Fomin, D Lokshtanov, F Panolan, S Saurabh ACM Transactions on Algorithms (TALG) 13 (3), 1-29, 2017	72*	2017
Deterministic truncation of linear matroids D Lokshtanov, P Misra, F Panolan, S Saurabh ACM Transactions on Algorithms (TALG) 14 (2), 1-20, 2018	67	2018
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	66	2015
Reconfiguration on sparse graphs D Lokshtanov, AE Mouawad, F Panolan, MS Ramanujan, S Saurabh Journal of Computer and System Sciences 95, 122-131, 2018	46	2018
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	34	2019
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	34	2019
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	31	2019
Parameterized low-rank binary matrix approximation FV Fomin, PA Golovach, F Panolan Data Mining and Knowledge Discovery 34, 478-532, 2020	29	2020
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	28	2020
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
2-approximating feedback vertex set in tournaments D Lokshtanov, P Misra, J Mukherjee, F Panolan, G Philip, S Saurabh ACM Transactions on Algorithms (TALG) 17 (2), 1-14, 2021	24*	2021
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
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	20*	2022
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	20	2020
Long directed (s, t)-path: FPT algorithm FV Fomin, D Lokshtanov, F Panolan, S Saurabh, M Zehavi Information Processing Letters 140, 8-12, 2018	20	2018
Parameterized algorithms for deletion to (r, l)-graphs S Kolay, F Panolan arXiv preprint arXiv:1504.08120, 2015	20	2015
Diverse collections in matroids and graphs FV Fomin, PA Golovach, F Panolan, G Philip, S Saurabh Mathematical Programming 204 (1), 415-447, 2024	19	2024
Refined complexity of PCA with outliers K Simonov, F Fomin, P Golovach, F Panolan International Conference on Machine Learning, 5818-5826, 2019	19*	2019

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors