Fahad Panolan

Cited by

	All	Since 2016
Citations	665	594
h-index	13	11
i10-index	16	15

180

135

2013201420152016201720182019202020217 13 39 35 59 94 113 176 107

Public access

View all

25 articles

4 articles

available

not available

Based on funding mandates

Co-authors

Saket SaurabhProfessor at Institute of Mathematical SciencesVerified email at imsc.res.in
Daniel LokshtanovAssociate Professor in Computer Science, UCSBVerified email at ucsb.edu
Fedor V. FominProfessor of Computer Science, University of BergenVerified email at uib.no
Pranabendu MisraMax Planck Institute for Informatics, GermanyVerified email at mpi-inf.mpg.de
Sudeshna KolayIIT KharagpurVerified email at cse.iitkgp.ac.in
Petr GolovachUniversity of BergenVerified email at ii.uib.no
Ashutosh RaiCharles University, PragueVerified email at kam.mff.cuni.cz
Neeldhara MisraIndian Institute of Technology, GandhinagarVerified email at iitgn.ac.in
Geevarghese PhilipAssistant Professor, Chennai Mathematical InstituteVerified email at cmi.ac.in
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
Esha GhoshMicrosoft ResearchVerified email at microsoft.com
Akanksha AgrawalBen-Gurion University of the NegevVerified email at post.bgu.ac.il
Sebastian SiebertzUniversität Bremen, AG Theoretische InformatikVerified email at uni-bremen.de
Petteri KaskiAssistant Professor of Computer Science, Aalto UniversityVerified email at aalto.fi
Pallavi JainIndian Institute of Technology Jodhpur, IndiaVerified email at iitj.ac.in
Dusan KnopCzech Technical University in PragueVerified email at fit.cvut.cz
Ondra SuchýAssistant Professor of Theoretical Computer Science, Czech Technical UniversityVerified email at fit.cvut.cz

Fahad Panolan

Indian Institute of Technology Hyderabad

Verified email at iith.ac.in - 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	114	2016
Lossy kernelization D Lokshtanov, F Panolan, MS Ramanujan, S Saurabh Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017	59	2017
Representative families of product families FV Fomin, D Lokshtanov, F Panolan, S Saurabh ACM Transactions on Algorithms (TALG) 13 (3), 1-29, 2017	53*	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	52	2015
Deterministic truncation of linear matroids D Lokshtanov, P Misra, F Panolan, S Saurabh ACM Transactions on Algorithms (TALG) 14 (2), 1-20, 2018	41	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	28	2018
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
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	20	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	18	2019
Parameterized low-rank binary matrix approximation FV Fomin, PA Golovach, F Panolan Data Mining and Knowledge Discovery 34 (2), 478-532, 2020	17	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 (4), 879-911, 2019	14	2019
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	13*	2019
Editing to connected f-degree graph FV Fomin, P Golovach, F Panolan, S Saurabh SIAM Journal on Discrete Mathematics 33 (2), 795-836, 2019	13	2019
Parameterized Algorithms for Deletion to (r, l)-Graphs S Kolay, F Panolan arXiv preprint arXiv:1504.08120, 2015	12	2015
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	11	2018
On the optimality of pseudo-polynomial algorithms for integer programming FV Fomin, F Panolan, MS Ramanujan, S Saurabh arXiv preprint arXiv:1607.05342, 2016	10*	2016
Long directed (s, t)-path: FPT algorithm FV Fomin, D Lokshtanov, F Panolan, S Saurabh, M Zehavi Information Processing Letters 140, 8-12, 2018	9	2018
On the parameterized complexity of b-chromatic number F Panolan, G Philip, S Saurabh Journal of Computer and System Sciences 84, 120-131, 2017	9*	2017
Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs N Misra, F Panolan, A Rai, V Raman, S Saurabh International Workshop on Graph-Theoretic Concepts in Computer Science, 370-381, 2013	9	2013
Refined complexity of PCA with outliers K Simonov, F Fomin, P Golovach, F Panolan International Conference on Machine Learning, 5818-5826, 2019	8*	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

Upload PDF

Follow this author

Cited by

Co-authors