Fahad Panolan

Navedeno

	Vse	Od leta 2018
Navedbe	1061	889
indeks h	16	14
indeks i10	31	25

200

100

150

201320142015201620172018201920202021202220238 13 34 34 55 85 120 166 198 181 129

Javni dostop

Prikaži vse

48 člankov

7 člankov

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

Saket SaurabhProfessor at Institute of Mathematical SciencesPreverjeni e-poštni naslov na imsc.res.in
Daniel LokshtanovProfessor of Computer Science, UCSBPreverjeni e-poštni naslov na ucsb.edu
Fedor V. FominProfessor of Computer Science, University of BergenPreverjeni e-poštni naslov na uib.no
Meirav ZehaviBen-Gurion University of the NegevPreverjeni e-poštni naslov na bgu.ac.il
Pranabendu MisraAssistant Professor at Chennai Mathematical InstitutePreverjeni e-poštni naslov na cmi.ac.in
Petr GolovachUniversity of BergenPreverjeni e-poštni naslov na ii.uib.no
Sudeshna KolayIIT KharagpurPreverjeni e-poštni naslov na cse.iitkgp.ac.in
Ashutosh RaiDepartment of Mathematics, IIT DelhiPreverjeni e-poštni naslov na maths.iitd.ac.in
Geevarghese PhilipFaculty Member at Chennai Mathematical InstitutePreverjeni e-poštni naslov na cmi.ac.in
Akanksha AgrawalIndian Institute of Technology MadrasPreverjeni e-poštni naslov na cse.iitm.ac.in
Neeldhara MisraIndian Institute of Technology, GandhinagarPreverjeni e-poštni naslov na iitgn.ac.in
Amer MouawadAmerican University of BeirutPreverjeni e-poštni naslov na aub.edu.lb
Lawqueen KaneshIndian Institute of Technology Jodhpur, IndiaPreverjeni e-poštni naslov na iitj.ac.in
Kirill SimonovPostdoc, TU WienPreverjeni e-poštni naslov na ac.tuwien.ac.at
Eduard EibenLecturer in Computer Science, Royal Holloway, Univeristy of LondonPreverjeni e-poštni naslov na rhul.ac.uk
Prachi GoyalMicrosoftPreverjeni e-poštni naslov na microsoft.com
Esha GhoshMicrosoft ResearchPreverjeni e-poštni naslov na microsoft.com
Sebastian SiebertzUniversität Bremen, AG Theoretische InformatikPreverjeni e-poštni naslov na uni-bremen.de
Pallavi JainIndian Institute of Technology Jodhpur, IndiaPreverjeni e-poštni naslov na iitj.ac.in
Vibha SahlotInstitute of Mathematical Sciences, ChennaiPreverjeni e-poštni naslov na iitj.ac.in

Spremljaj

Fahad Panolan

Indian Institute of Technology Hyderabad

Preverjeni e-poštni naslov na iith.ac.in - Domača stran

Parameterised algorithms Approximation algorithms Graph theory and graph algorithms


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
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	154	2016
Lossy kernelization D Lokshtanov, F Panolan, MS Ramanujan, S Saurabh Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017	83	2017
Representative families of product families FV Fomin, D Lokshtanov, F Panolan, S Saurabh ACM Transactions on Algorithms (TALG) 13 (3), 1-29, 2017	63*	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	63	2015
Deterministic truncation of linear matroids D Lokshtanov, P Misra, F Panolan, S Saurabh ACM Transactions on Algorithms (TALG) 14 (2), 1-20, 2018	52	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	47	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	31	2019
Parameterized low-rank binary matrix approximation FV Fomin, PA Golovach, F Panolan Data Mining and Knowledge Discovery 34, 478-532, 2020	25	2020
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	24	2019
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	23	2019
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	21	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	21*	2015
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
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	20*	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	18	2018
Parameterized Algorithms for Deletion to (r, l)-Graphs S Kolay, F Panolan arXiv preprint arXiv:1504.08120, 2015	18	2015
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	16*	2022
On the optimality of pseudo-polynomial algorithms for integer programming FV Fomin, F Panolan, MS Ramanujan, S Saurabh Mathematical Programming, 1-33, 2022	15*	2022
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	14*	2020
Refined complexity of PCA with outliers K Simonov, F Fomin, P Golovach, F Panolan International Conference on Machine Learning, 5818-5826, 2019	14	2019

Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.

Članki 1–20

Št. navedb na leto

Podvojene navedbe

Združene navedbe

Dodajanje soavtorjevSoavtorji

Spremljaj

Navedeno

Soavtorji