Saket Saurabh

Citata da

	Tutte	Dal 2019
Citazioni	14144	8285
Indice H	54	35
i10-index	211	153

1600

800

400

1200

2008200920102011201220132014201520162017201820192020202120222023202465 158 264 359 406 541 507 553 725 905 1074 1111 1390 1214 1450 1549 1549

Accesso pubblico

Visualizza tutto

163 articoli

26 articoli

Disponibili

Non disponibili

In base ai mandati di finanziamento

Coautori

Daniel LokshtanovProfessor of Computer Science, UCSBEmail verificata su ucsb.edu
Fedor V. FominProfessor of Computer Science, University of BergenEmail verificata su uib.no
Meirav ZehaviBen-Gurion University of the NegevEmail verificata su bgu.ac.il
Fahad PanolanSchool of Computing, University of LeedsEmail verificata su leeds.ac.uk
Michał PilipczukUniversity of WarsawEmail verificata su mimuw.edu.pl
Ramanujan M. S.University of Warwick, UKEmail verificata su warwick.ac.uk
Dániel MarxCISPA Helmholtz Center for Information SecurityEmail verificata su cispa.saarland
Marek CyganUniversity of WarsawEmail verificata su mimuw.edu.pl
Neeldhara MisraIndian Institute of Technology, GandhinagarEmail verificata su iitgn.ac.in
Pranabendu MisraAssistant Professor at Chennai Mathematical InstituteEmail verificata su cmi.ac.in
Akanksha AgrawalIndian Institute of Technology MadrasEmail verificata su cse.iitm.ac.in
Petr GolovachUniversity of BergenEmail verificata su ii.uib.no
Marcin PilipczukInstytut Informatyki, Uniwersytet WarszawskiEmail verificata su mimuw.edu.pl
Geevarghese PhilipFaculty Member at Chennai Mathematical InstituteEmail verificata su cmi.ac.in
Sushmita GuptaThe Institute of Mathematical Sciences (IMSc)Email verificata su imsc.res.in
Serge GaspersProfessor, UNSW Sydney, AustraliaEmail verificata su cse.unsw.edu.au
Dimitrios M. ThilikosEmail verificata su thilikos.info
Frances RosamondLebanese American University, Beirut and Western Sydney University, AustraliaEmail verificata su lau.edu.lb
Lawqueen KaneshIndian Institute of Technology Jodhpur, IndiaEmail verificata su iitj.ac.in
Sudeshna KolayIIT KharagpurEmail verificata su cse.iitkgp.ac.in

Segui

Saket Saurabh

Professor at Institute of Mathematical Sciences

Email verificata su imsc.res.in

Parameteried Complexity Graph Algorithms


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
Parameterized algorithms M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx, M Pilipczuk, ... Springer 5 (4), 16, 2015	3026	2015
Lower bounds based on the exponential-time hypothesis M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx, M Pilipczuk, ... Parameterized Algorithms, 467-521, 2015	404	2015
Kernelization: theory of parameterized preprocessing FV Fomin, D Lokshtanov, S Saurabh, M Zehavi Cambridge University Press, 2019	349	2019
Kernelization lower bounds through colors and IDs M Dom, D Lokshtanov, S Saurabh ACM Transactions on Algorithms (TALG) 11 (2), 1-20, 2014	326*	2014
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	306*	2016
Known algorithms on graphs of bounded treewidth are probably optimal D Lokshtanov, D Marx, S Saurabh ACM Transactions on Algorithms (TALG) 14 (2), 1-30, 2018	256*	2018
On problems as hard as CNF-SAT M Cygan, H Dell, D Lokshtanov, D Marx, J Nederlof, Y Okamoto, R Paturi, ... ACM Transactions on Algorithms (TALG) 12 (3), 1-24, 2016	254	2016
Planar F-deletion: Approximation, kernelization and optimal FPT algorithms FV Fomin, D Lokshtanov, N Misra, S Saurabh 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 470-479, 2012	234	2012
Bidimensionality and kernels FV Fomin, D Lokshtanov, S Saurabh, DM Thilikos Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete …, 2010	233	2010
Faster parameterized algorithms using linear programming D Lokshtanov, NS Narayanaswamy, V Raman, MS Ramanujan, ... ACM Transactions on Algorithms (TALG) 11 (2), 15, 2014	222*	2014
(Meta) Kernelization HL Bodlaender, FV Fomin, D Lokshtanov, E Penninkx, S Saurabh, ... Journal of the ACM (JACM) 63 (5), 44, 2016	179	2016
Graph layout problems parameterized by vertex cover MR Fellows, D Lokshtanov, N Misra, FA Rosamond, S Saurabh Algorithms and Computation: 19th International Symposium, ISAAC 2008, Gold …, 2008	173	2008
Slightly superexponential parameterized problems D Lokshtanov, D Marx, S Saurabh SIAM Journal on Computing 47 (3), 675-702, 2018	168*	2018
On the complexity of some colorful problems parameterized by treewidth MR Fellows, FV Fomin, D Lokshtanov, F Rosamond, S Saurabh, ... Information and Computation 209 (2), 143-153, 2011	166*	2011
Intractability of clique-width parameterizations FV Fomin, PA Golovach, D Lokshtanov, S Saurabh SIAM Journal on Computing 39 (5), 1941-1956, 2010	156*	2010
Kernel (s) for problems with no kernel: On out-trees with many leaves D Binkele-Raible, H Fernau, FV Fomin, D Lokshtanov, S Saurabh, ... ACM Transactions on Algorithms (TALG) 8 (4), 1-19, 2012	153*	2012
On two techniques of combining branching and treewidth FV Fomin, S Gaspers, S Saurabh, AA Stepanov Algorithmica 54, 181-207, 2009	140*	2009
Fast FAST N Alon, D Lokshtanov, S Saurabh International colloquium on automata, languages, and programming, 49-58, 2009	129	2009
Faster fixed parameter tractable algorithms for finding feedback vertex sets V Raman, S Saurabh, CR Subramanian ACM Transactions on Algorithms (TALG) 2 (3), 403-415, 2006	121*	2006
Parameterized algorithms for feedback set problems and their duals in tournaments V Raman, S Saurabh Theoretical Computer Science 351 (3), 446-458, 2006	118*	2006

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Segui

Citata da

Coautori