Fahad Panolan

Cited by

	All	Since 2018
Citations	1200	1024
h-index	17	16
i10-index	34	29

280

140

210

201320142015201620172018201920202021202220237 12 32 33 60 84 119 170 189 176 275

Public access

View all

50 articles

7 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
Geevarghese PhilipFaculty Member at Chennai Mathematical InstituteVerified email at cmi.ac.in
Akanksha AgrawalIndian Institute of Technology MadrasVerified email at cse.iitm.ac.in
Neeldhara MisraIndian Institute of Technology, GandhinagarVerified email at iitgn.ac.in
Amer MouawadAmerican University of BeirutVerified email at aub.edu.lb
Kirill SimonovPostdoc, TU WienVerified email at ac.tuwien.ac.at
Lawqueen KaneshIndian Institute of Technology Jodhpur, IndiaVerified email at iitj.ac.in
Eduard EibenLecturer in Computer Science, Royal Holloway, Univeristy of LondonVerified email at rhul.ac.uk
Prachi GoyalMicrosoftVerified email at microsoft.com
Sebastian SiebertzUniversität Bremen, AG Theoretische InformatikVerified email at uni-bremen.de
Esha GhoshMicrosoft ResearchVerified email at microsoft.com
Pallavi JainIndian Institute of Technology Jodhpur, IndiaVerified email at iitj.ac.in
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	176	2016
Lossy kernelization D Lokshtanov, F Panolan, MS Ramanujan, S Saurabh Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017	97	2017
Representative families of product families FV Fomin, D Lokshtanov, F Panolan, S Saurabh ACM Transactions on Algorithms (TALG) 13 (3), 1-29, 2017	66*	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	64	2015
Deterministic truncation of linear matroids D Lokshtanov, P Misra, F Panolan, S Saurabh ACM Transactions on Algorithms (TALG) 14 (2), 1-20, 2018	61	2018
Reconfiguration on sparse graphs D Lokshtanov, AE Mouawad, F Panolan, MS Ramanujan, S Saurabh Journal of Computer and System Sciences 95, 122-131, 2018	50	2018
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
Parameterized low-rank binary matrix approximation FV Fomin, PA Golovach, F Panolan Data Mining and Knowledge Discovery 34, 478-532, 2020	28	2020
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	28	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	28	2019
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	24*	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	22	2020
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	21	2018
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	19	2020
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	19	2020
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
Refined complexity of PCA with outliers K Simonov, F Fomin, P Golovach, F Panolan International Conference on Machine Learning, 5818-5826, 2019	17	2019
On the optimality of pseudo-polynomial algorithms for integer programming FV Fomin, F Panolan, MS Ramanujan, S Saurabh arXiv preprint arXiv:1607.05342, 2016	16*	2016
Parameterized algorithms for deletion to (r, l)-graphs S Kolay, F Panolan arXiv preprint arXiv:1504.08120, 2015	16	2015

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