Saket Saurabh

Citée par

	Toutes	Depuis 2018
Citations	11436	6751
indice h	51	33
indice i10	177	138

1700

850

425

1275

2007200820092010201120122013201420152016201720182019202020212022202331 63 153 272 341 425 556 506 542 722 889 1017 1053 1418 1355 1616 263

Accès public

Tout afficher

150 articles

22 articles

disponibles

non disponibles

Sur la base des exigences liées au financement

Coauteurs

Daniel LokshtanovProfessor of 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
Meirav ZehaviBen-Gurion University of the NegevAdresse e-mail validée de bgu.ac.il
Fahad PanolanIndian Institute of Technology HyderabadAdresse e-mail validée de iith.ac.in
Dániel MarxCISPA Helmholtz Center for Information SecurityAdresse e-mail validée de cispa.saarland
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
Marcin PilipczukInstytut Informatyki, Uniwersytet WarszawskiAdresse e-mail validée de mimuw.edu.pl
Pranabendu MisraAssistant Professor at Chennai Mathematical InstituteAdresse e-mail validée de cmi.ac.in
Petr GolovachUniversity of BergenAdresse e-mail validée de ii.uib.no
Akanksha AgrawalIndian Institute of Technology MadrasAdresse e-mail validée de cse.iitm.ac.in
Geevarghese PhilipFaculty Member at Chennai Mathematical InstituteAdresse e-mail validée de cmi.ac.in
Serge GaspersProfessor, UNSW Sydney, AustraliaAdresse e-mail validée de cse.unsw.edu.au
Michael FellowsProfessor of Informatics, University of BergenAdresse e-mail validée de uib.no
Sushmita GuptaThe Institute of Mathematical Sciences (IMSc)Adresse e-mail validée de imsc.res.in
Dimitrios M. ThilikosDepartment of Mathematics, National and Kapodistrian University of AthensAdresse e-mail validée de thilikos.info
Frances rosamondUniversity of Bergen, NorwayAdresse e-mail validée de uib.no
Sudeshna KolayIIT KharagpurAdresse e-mail validée de cse.iitkgp.ac.in

Suivre

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	2262	2015
Lower bounds based on the exponential time hypothesis D Lokshtanov, D Marx, S Saurabh Bulletin of EATCS 3 (105), 2013	352	2013
Kernelization lower bounds through colors and IDs M Dom, D Lokshtanov, S Saurabh ACM Transactions on Algorithms (TALG) 11 (2), 1-20, 2014	295*	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	248*	2016
Kernelization: theory of parameterized preprocessing FV Fomin, D Lokshtanov, S Saurabh, M Zehavi Cambridge University Press, 2019	230	2019
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	217	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	211*	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	206	2012
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
Faster parameterized algorithms using linear programming D Lokshtanov, NS Narayanaswamy, V Raman, MS Ramanujan, ... ACM Transactions on Algorithms (TALG) 11 (2), 15, 2014	192*	2014
(Meta) Kernelization HL Bodlaender, FV Fomin, D Lokshtanov, E Penninkx, S Saurabh, ... Journal of the ACM (JACM) 63 (5), 44, 2016	165	2016
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	155*	2011
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	155	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	143*	2012
Slightly superexponential parameterized problems D Lokshtanov, D Marx, S Saurabh SIAM Journal on Computing 47 (3), 675-702, 2018	140*	2018
Intractability of clique-width parameterizations FV Fomin, PA Golovach, D Lokshtanov, S Saurabh SIAM Journal on Computing 39 (5), 1941-1956, 2010	135*	2010
On two techniques of combining branching and treewidth FV Fomin, S Gaspers, S Saurabh, AA Stepanov Algorithmica 54, 181-207, 2009	125*	2009
Fast FAST N Alon, D Lokshtanov, S Saurabh Automata, Languages and Programming: 36th International Colloquium, ICALP …, 2009	121	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
Parameterized algorithms for feedback set problems and their duals in tournaments V Raman, S Saurabh Theoretical Computer Science 351 (3), 446-458, 2006	113*	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

Citée par

Coauteurs