Saket Saurabh

Citée par

	Toutes	Depuis 2016
Citations	9524	6428
indice h	48	34
indice i10	147	124

1600

800

400

1200

20072008200920102011201220132014201520162017201820192020202129 69 173 276 365 403 556 513 563 720 885 1063 1107 1516 1098

Accès public

Tout afficher

115 articles

20 articles

disponibles

non disponibles

Sur la base des exigences liées au financement

Coauteurs

Daniel LokshtanovAssociate Professor in Computer Science, UCSBAdresse e-mail validée de ucsb.edu
Fedor V. FominProfessor of Computer Science, University of BergenAdresse e-mail validée de uib.no
Dániel MarxCISPA Helmholtz Center for Information SecurityAdresse e-mail validée de cispa.saarland
Fahad PanolanIndian Institute of Technology HyderabadAdresse e-mail validée de iith.ac.in
Ramanujan M. S.University of Warwick, UKAdresse e-mail validée de warwick.ac.uk
Michał PilipczukUniversity of WarsawAdresse e-mail validée de mimuw.edu.pl
Marek CyganUniversity of WarsawAdresse e-mail validée de mimuw.edu.pl
Neeldhara MisraIndian Institute of Technology, GandhinagarAdresse e-mail validée de iitgn.ac.in
Geevarghese PhilipAssistant Professor, Chennai Mathematical InstituteAdresse e-mail validée de cmi.ac.in
Petr GolovachUniversity of BergenAdresse e-mail validée de ii.uib.no
Marcin PilipczukInstytut Informatyki, Uniwersytet WarszawskiAdresse e-mail validée de mimuw.edu.pl
Serge GaspersAssociate Professor, UNSW Sydney, AustraliaAdresse e-mail validée de cse.unsw.edu.au
Dimitrios M. ThilikosDepartment of Mathematics, National and Kapodistrian University of Athens, AthensAdresse e-mail validée de math.uoa.gr
Michael FellowsProfessor of Informatics, University of BergenAdresse e-mail validée de uib.no
Frances rosamondUniversity of Bergen, NorwayAdresse e-mail validée de uib.no
G. GutinProfessor of Computer Science, Royal Holloway, University of LondonAdresse e-mail validée de rhul.ac.uk
Yngve VillangerUniversity of BergenAdresse e-mail validée de uib.no
Lukasz KowalikUniversity of WarsawAdresse e-mail validée de mimuw.edu.pl
Henning FernauProfessor für Informatik, Universität TrierAdresse e-mail validée de uni-trier.de
Dieter Kratschprofesseur d'informatique, Universite de LorraineAdresse e-mail validée de univ-lorraine.fr

Saket Saurabh

Professor at Institute of Mathematical Sciences

Adresse e-mail validée de imsc.res.in

Parameteried Complexity Graph Algorithms


Titre Trier par citations Trier par année Trier par titre	Citée par Citée par	Année
Parameterized algorithms M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx, M Pilipczuk, ... Springer 5 (4), 16, 2015	1719	2015
Lower bounds based on the exponential time hypothesis D Lokshtanov, D Marx, S Saurabh Bulletin of EATCS 3 (105), 2013	313	2013
Kernelization lower bounds through colors and IDs M Dom, D Lokshtanov, S Saurabh ACM Transactions on Algorithms (TALG) 11 (2), 1-20, 2014	266*	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	222*	2016
Bidimensionality and kernels FV Fomin, D Lokshtanov, S Saurabh, DM Thilikos Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete …, 2010	206	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	188	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	180*	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	175	2012
Faster parameterized algorithms using linear programming D Lokshtanov, NS Narayanaswamy, V Raman, MS Ramanujan, ... ACM Transactions on Algorithms (TALG) 11 (2), 15, 2014	161*	2014
(Meta) Kernelization HL Bodlaender, FV Fomin, D Lokshtanov, E Penninkx, S Saurabh, ... Journal of the ACM (JACM) 63 (5), 44, 2016	154	2016
Kernelization: theory of parameterized preprocessing FV Fomin, D Lokshtanov, S Saurabh, M Zehavi Cambridge University Press, 2019	142	2019
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	137	2008
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	133*	2012
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	131*	2011
Intractability of clique-width parameterizations FV Fomin, PA Golovach, D Lokshtanov, S Saurabh SIAM Journal on Computing 39 (5), 1941-1956, 2010	125*	2010
On two techniques of combining branching and treewidth FV Fomin, S Gaspers, S Saurabh, AA Stepanov Algorithmica 54 (2), 181-207, 2009	122*	2009
Slightly superexponential parameterized problems D Lokshtanov, D Marx, S Saurabh SIAM Journal on Computing 47 (3), 675-702, 2018	121*	2018
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
Fast FAST N Alon, D Lokshtanov, S Saurabh International colloquium on automata, languages, and programming, 49-58, 2009	108	2009
Parameterized algorithms for feedback set problems and their duals in tournaments V Raman, S Saurabh Theoretical Computer Science 351 (3), 446-458, 2006	108*	2006

Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.

Articles 1–20

Nombre de citations par an

Citations en double

Citations fusionnées

Ajouter les coauteursCoauteurs

Suivre les mises à jour de cet auteur

Citée par

Coauteurs