Saket Saurabh

Citada per

	Totes	Des de 2020
Citacions	14602	7593
Índex h	55	33
Índex i10	217	155

1700

850

425

1275

20082009201020112012201320142015201620172018201920202021202220232024202564 159 264 360 413 547 515 563 738 900 1061 1122 1420 1230 1465 1484 1623 368

Accés públic

Mostra-ho tot

169 articles

30 articles

disponibles

no disponibles

Es basa en els requisits de les agències que proporcionen el finançament

Coautors

Daniel LokshtanovProfessor of Computer Science, UCSBCorreu electrònic verificat a ucsb.edu
Fedor V. FominProfessor of Computer Science, University of BergenCorreu electrònic verificat a uib.no
Meirav ZehaviBen-Gurion University of the NegevCorreu electrònic verificat a bgu.ac.il
Fahad PanolanSchool of Computing, University of LeedsCorreu electrònic verificat a leeds.ac.uk
Ramanujan M. S.University of Warwick, UKCorreu electrònic verificat a warwick.ac.uk
Michał PilipczukUniversity of WarsawCorreu electrònic verificat a mimuw.edu.pl
Dániel MarxCISPA Helmholtz Center for Information SecurityCorreu electrònic verificat a cispa.saarland
Marek CyganUniversity of WarsawCorreu electrònic verificat a mimuw.edu.pl
Pranabendu MisraAssistant Professor at Chennai Mathematical InstituteCorreu electrònic verificat a cmi.ac.in
Neeldhara MisraIndian Institute of Technology, GandhinagarCorreu electrònic verificat a iitgn.ac.in
Petr GolovachUniversity of BergenCorreu electrònic verificat a ii.uib.no
Akanksha AgrawalIndian Institute of Technology MadrasCorreu electrònic verificat a cse.iitm.ac.in
Marcin PilipczukInstytut Informatyki, Uniwersytet WarszawskiCorreu electrònic verificat a mimuw.edu.pl
Geevarghese PhilipFaculty Member at Chennai Mathematical InstituteCorreu electrònic verificat a cmi.ac.in
Sushmita GuptaThe Institute of Mathematical Sciences (IMSc)Correu electrònic verificat a imsc.res.in
Serge GaspersProfessor, UNSW Sydney, AustraliaCorreu electrònic verificat a cse.unsw.edu.au
Dimitrios M. ThilikosCorreu electrònic verificat a thilikos.info
Roohani SharmaMax Planck Institute for InformaticsCorreu electrònic verificat a mpi-inf.mpg.de
Lawqueen KaneshIndian Institute of Technology Jodhpur, IndiaCorreu electrònic verificat a iitj.ac.in
Sudeshna KolayIIT KharagpurCorreu electrònic verificat a cse.iitkgp.ac.in

Segueix

Saket Saurabh

Professor at Institute of Mathematical Sciences

Correu electrònic verificat a imsc.res.in

Parameteried Complexity Graph Algorithms


Títol Ordena per cites Ordena per any Ordena per títol	Citada per Citada per	Any
Parameterized algorithms M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx, M Pilipczuk, ... Springer 5 (4), 16, 2015	3138	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	416	2015
Kernelization: theory of parameterized preprocessing FV Fomin, D Lokshtanov, S Saurabh, M Zehavi Cambridge University Press, 2019	363	2019
Kernelization lower bounds through colors and IDs M Dom, D Lokshtanov, S Saurabh ACM Transactions on Algorithms (TALG) 11 (2), 1-20, 2014	333*	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	315*	2016
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	261	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	258*	2018
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	240	2012
Bidimensionality and kernels FV Fomin, D Lokshtanov, S Saurabh, DM Thilikos Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete …, 2010	235	2010
Faster parameterized algorithms using linear programming D Lokshtanov, NS Narayanaswamy, V Raman, MS Ramanujan, ... ACM Transactions on Algorithms (TALG) 11 (2), 15, 2014	225*	2014
(Meta) Kernelization HL Bodlaender, FV Fomin, D Lokshtanov, E Penninkx, S Saurabh, ... Journal of the ACM (JACM) 63 (5), 44, 2016	185	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	178	2008
Slightly superexponential parameterized problems D Lokshtanov, D Marx, S Saurabh SIAM Journal on Computing 47 (3), 675-702, 2018	171	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	169*	2011
Intractability of clique-width parameterizations FV Fomin, PA Golovach, D Lokshtanov, S Saurabh SIAM Journal on Computing 39 (5), 1941-1956, 2010	158*	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	154*	2012
On two techniques of combining branching and treewidth FV Fomin, S Gaspers, S Saurabh, AA Stepanov Algorithmica 54, 181-207, 2009	146*	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	128*	2006
Parameterized algorithms for feedback set problems and their duals in tournaments V Raman, S Saurabh Theoretical Computer Science 351 (3), 446-458, 2006	119*	2006

En aquests moments el sistema no pot dur a terme l'operació. Torneu-ho a provar més tard.

Articles 1–20

Cites per any

Cites duplicades

Cites combinades

Addició de coautorsCoautors

Segueix

Citada per

Coautors