Saket Saurabh

Cited by

	All	Since 2018
Citations	12670	7949
h-index	52	36
i10-index	200	157

1600

800

400

1200

200820092010201120122013201420152016201720182019202020212022202363 152 258 351 407 560 515 544 734 906 1024 1054 1449 1273 1549 1570

Public access

View all

154 articles

23 articles

available

not available

Based on funding mandates

Co-authors

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
Fahad PanolanSchool of Computing, University of LeedsVerified email at leeds.ac.uk
Dániel MarxCISPA Helmholtz Center for Information SecurityVerified email at cispa.saarland
Ramanujan M. S.University of Warwick, UKVerified email at warwick.ac.uk
Michał PilipczukUniversity of WarsawVerified email at mimuw.edu.pl
Marek CyganUniversity of WarsawVerified email at mimuw.edu.pl
Neeldhara MisraIndian Institute of Technology, GandhinagarVerified email at iitgn.ac.in
Pranabendu MisraAssistant Professor at Chennai Mathematical InstituteVerified email at cmi.ac.in
Marcin PilipczukInstytut Informatyki, Uniwersytet WarszawskiVerified email at mimuw.edu.pl
Akanksha AgrawalIndian Institute of Technology MadrasVerified email at cse.iitm.ac.in
Petr GolovachUniversity of BergenVerified email at ii.uib.no
Geevarghese PhilipFaculty Member at Chennai Mathematical InstituteVerified email at cmi.ac.in
Sushmita GuptaThe Institute of Mathematical Sciences (IMSc)Verified email at imsc.res.in
Serge GaspersProfessor, UNSW Sydney, AustraliaVerified email at cse.unsw.edu.au
Michael FellowsProfessor of Informatics, University of BergenVerified email at uib.no
Frances rosamondUniversity of Bergen, NorwayVerified email at uib.no
Dimitrios M. ThilikosDepartment of Mathematics, National and Kapodistrian University of AthensVerified email at thilikos.info
Sudeshna KolayIIT KharagpurVerified email at cse.iitkgp.ac.in

Saket Saurabh

Professor at Institute of Mathematical Sciences

Verified email at imsc.res.in

Parameteried Complexity Graph Algorithms


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Parameterized algorithms M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx, M Pilipczuk, ... Springer 4 (8), 2015	2606	2015
Lower bounds based on the exponential time hypothesis D Lokshtanov, D Marx, S Saurabh Bulletin of EATCS 3 (105), 2013	370	2013
Kernelization lower bounds through colors and IDs M Dom, D Lokshtanov, S Saurabh ACM Transactions on Algorithms (TALG) 11 (2), 1-20, 2014	316*	2014
Kernelization: theory of parameterized preprocessing FV Fomin, D Lokshtanov, S Saurabh, M Zehavi Cambridge University Press, 2019	301	2019
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	279*	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	231	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	227*	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	220	2012
Bidimensionality and kernels FV Fomin, D Lokshtanov, S Saurabh, DM Thilikos Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete …, 2010	219*	2010
Faster parameterized algorithms using linear programming D Lokshtanov, NS Narayanaswamy, V Raman, MS Ramanujan, ... ACM Transactions on Algorithms (TALG) 11 (2), 15, 2014	207*	2014
(Meta) Kernelization HL Bodlaender, FV Fomin, D Lokshtanov, E Penninkx, S Saurabh, ... Journal of the ACM (JACM) 63 (5), 44, 2016	175	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	166	2008
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	160*	2011
Slightly superexponential parameterized problems D Lokshtanov, D Marx, S Saurabh SIAM Journal on Computing 47 (3), 675-702, 2018	154*	2018
Intractability of clique-width parameterizations FV Fomin, PA Golovach, D Lokshtanov, S Saurabh SIAM Journal on Computing 39 (5), 1941-1956, 2010	150*	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	146*	2012
On two techniques of combining branching and treewidth FV Fomin, S Gaspers, S Saurabh, AA Stepanov Algorithmica 54, 181-207, 2009	130*	2009
Fast FAST N Alon, D Lokshtanov, S Saurabh International colloquium on automata, languages, and programming, 49-58, 2009	125	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	118*	2006
Almost optimal lower bounds for problems parameterized by clique-width FV Fomin, PA Golovach, D Lokshtanov, S Saurabh SIAM Journal on Computing 43 (5), 1541-1563, 2014	112*	2014

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