Saket Saurabh

Cited by

	All	Since 2016
Citations	8990	5896
h-index	46	33
i10-index	145	117

1600

800

400

1200

200620072008200920102011201220132014201520162017201820192020202123 27 71 170 287 362 412 550 509 562 721 895 1097 1072 1583 505

Public access

View all

75 articles

16 articles

available

not available

Based on funding mandates

Co-authors

Daniel LokshtanovAssociate Professor in Computer Science, UCSBVerified email at ucsb.edu
Fedor V. FominProfessor of Computer Science, University of BergenVerified email at uib.no
Dániel MarxCISPA Helmholtz Center for Information SecurityVerified email at cispa.saarland
Fahad PanolanIndian Institute of Technology HyderabadVerified email at iith.ac.in
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
Geevarghese PhilipAssistant Professor, Chennai Mathematical InstituteVerified email at cmi.ac.in
Petr GolovachUniversity of BergenVerified email at ii.uib.no
Marcin PilipczukInstytut Informatyki, Uniwersytet WarszawskiVerified email at mimuw.edu.pl
Serge GaspersAssociate Professor, UNSW Sydney, AustraliaVerified email at cse.unsw.edu.au
Dimitrios M. ThilikosDepartment of Mathematics, National and Kapodistrian University of Athens, AthensVerified email at math.uoa.gr
Michael FellowsProfessor of Informatics, University of BergenVerified email at uib.no
Frances rosamondUniversity of Bergen, NorwayVerified email at uib.no
G. GutinProfessor of Computer Science, Royal Holloway, University of LondonVerified email at rhul.ac.uk
Yngve VillangerUniversity of BergenVerified email at uib.no
Henning FernauProfessor für Informatik, Universität TrierVerified email at uni-trier.de
Lukasz KowalikUniversity of WarsawVerified email at mimuw.edu.pl
Dieter Kratschprofesseur d'informatique, Universite de LorraineVerified email at univ-lorraine.fr

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 5 (4), 16, 2015	1551	2015
Lower bounds based on the exponential time hypothesis D Lokshtanov, D Marx, S Saurabh Bulletin of EATCS 3 (105), 2013	301	2013
Kernelization lower bounds through colors and IDs M Dom, D Lokshtanov, S Saurabh ACM Transactions on Algorithms (TALG) 11 (2), 1-20, 2014	261*	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	207*	2016
Bidimensionality and kernels FV Fomin, D Lokshtanov, S Saurabh, DM Thilikos Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete …, 2010	202	2010
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	178	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	170	2012
Faster parameterized algorithms using linear programming D Lokshtanov, NS Narayanaswamy, V Raman, MS Ramanujan, ... ACM Transactions on Algorithms (TALG) 11 (2), 15, 2014	156*	2014
(Meta) Kernelization HL Bodlaender, FV Fomin, D Lokshtanov, E Penninkx, S Saurabh, ... Journal of the ACM (JACM) 63 (5), 44, 2016	155	2016
Known algorithms on graphs of bounded treewidth are probably optimal D Lokshtanov, D Marx, S Saurabh Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete …, 2011	142	2011
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	135*	2012
Graph layout problems parameterized by vertex cover MR Fellows, D Lokshtanov, N Misra, FA Rosamond, S Saurabh International Symposium on Algorithms and Computation, 294-305, 2008	130	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	127*	2011
Intractability of clique-width parameterizations FV Fomin, PA Golovach, D Lokshtanov, S Saurabh SIAM Journal on Computing 39 (5), 1941-1956, 2010	121*	2010
On two techniques of combining branching and treewidth FV Fomin, S Gaspers, S Saurabh, AA Stepanov Algorithmica 54 (2), 181-207, 2009	118*	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	114*	2006
Slightly superexponential parameterized problems D Lokshtanov, D Marx, S Saurabh SIAM Journal on Computing 47 (3), 675-702, 2018	113*	2018
Kernelization: theory of parameterized preprocessing FV Fomin, D Lokshtanov, S Saurabh, M Zehavi Cambridge University Press, 2019	112	2019
Parameterized algorithms for feedback set problems and their duals in tournaments V Raman, S Saurabh Theoretical Computer Science 351 (3), 446-458, 2006	109*	2006
Fast fast N Alon, D Lokshtanov, S Saurabh International Colloquium on Automata, Languages, and Programming, 49-58, 2009	108	2009

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