Saket Saurabh

Sitert av

	Alle	Siden 2017
Sitater	10890	7039
h-indeks	50	35
i10-indeks	168	140

1500

750

375

1125

200720082009201020112012201320142015201620172018201920202021202232 68 170 274 365 406 569 520 553 728 893 1047 1079 1468 1417 1106

Offentlig tilgang

Vis alle

158 artikler

22 artikler

tilgjengelige

ikke tilgjengelige

Basert på finansieringsmandater

Medforfattere

Daniel LokshtanovProfessor of Computer Science, UCSBVerifisert e-postadresse på ucsb.edu
Fedor V. FominProfessor of Computer Science, University of BergenVerifisert e-postadresse på uib.no
Meirav ZehaviBen-Gurion University of the NegevVerifisert e-postadresse på bgu.ac.il
Fahad PanolanIndian Institute of Technology HyderabadVerifisert e-postadresse på iith.ac.in
Dániel MarxCISPA Helmholtz Center for Information SecurityVerifisert e-postadresse på cispa.saarland
Ramanujan M. S.University of Warwick, UKVerifisert e-postadresse på warwick.ac.uk
Michał PilipczukUniversity of WarsawVerifisert e-postadresse på mimuw.edu.pl
Marek CyganUniversity of WarsawVerifisert e-postadresse på mimuw.edu.pl
Neeldhara MisraIndian Institute of Technology, GandhinagarVerifisert e-postadresse på iitgn.ac.in
Pranabendu MisraAssistant Professor at Chennai Mathematical InstituteVerifisert e-postadresse på cmi.ac.in
Marcin PilipczukInstytut Informatyki, Uniwersytet WarszawskiVerifisert e-postadresse på mimuw.edu.pl
Petr GolovachUniversity of BergenVerifisert e-postadresse på ii.uib.no
Geevarghese PhilipFaculty Member at Chennai Mathematical InstituteVerifisert e-postadresse på cmi.ac.in
Akanksha AgrawalIndian Institute of Technology MadrasVerifisert e-postadresse på cse.iitm.ac.in
Serge GaspersProfessor, UNSW Sydney, AustraliaVerifisert e-postadresse på cse.unsw.edu.au
Sushmita GuptaThe Institute of Mathematical Sciences (IMSc)Verifisert e-postadresse på imsc.res.in
Michael FellowsProfessor of Informatics, University of BergenVerifisert e-postadresse på uib.no
Dimitrios M. ThilikosDepartment of Mathematics, National and Kapodistrian University of AthensVerifisert e-postadresse på thilikos.info
Frances rosamondUniversity of Bergen, NorwayVerifisert e-postadresse på uib.no
Sudeshna KolayIIT KharagpurVerifisert e-postadresse på cse.iitkgp.ac.in

Følg

Saket Saurabh

Professor at Institute of Mathematical Sciences

Verifisert e-postadresse på imsc.res.in

Parameteried Complexity Graph Algorithms


Tittel Sortér etter sitater Sortér etter år Sortér etter tittel	Sitert av Sitert av	År
Parameterized algorithms M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx, M Pilipczuk, ... Springer 5 (4), 16, 2015	2099	2015
Lower bounds based on the exponential time hypothesis D Lokshtanov, D Marx, S Saurabh Bulletin of EATCS 3 (105), 2013	342	2013
Kernelization lower bounds through colors and IDs M Dom, D Lokshtanov, S Saurabh ACM Transactions on Algorithms (TALG) 11 (2), 1-20, 2014	289*	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	238*	2016
Bidimensionality and kernels FV Fomin, D Lokshtanov, S Saurabh, DM Thilikos Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete …, 2010	211	2010
Kernelization: theory of parameterized preprocessing FV Fomin, D Lokshtanov, S Saurabh, M Zehavi Cambridge University Press, 2019	210	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	206	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	198	2012
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	197*	2018
Faster parameterized algorithms using linear programming D Lokshtanov, NS Narayanaswamy, V Raman, MS Ramanujan, ... ACM Transactions on Algorithms (TALG) 11 (2), 15, 2014	185*	2014
(Meta) Kernelization HL Bodlaender, FV Fomin, D Lokshtanov, E Penninkx, S Saurabh, ... Journal of the ACM (JACM) 63 (5), 44, 2016	167	2016
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	150	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	149*	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	148*	2012
Slightly superexponential parameterized problems D Lokshtanov, D Marx, S Saurabh SIAM Journal on Computing 47 (3), 675-702, 2018	132*	2018
Intractability of clique-width parameterizations FV Fomin, PA Golovach, D Lokshtanov, S Saurabh SIAM Journal on Computing 39 (5), 1941-1956, 2010	132*	2010
On two techniques of combining branching and treewidth FV Fomin, S Gaspers, S Saurabh, AA Stepanov Algorithmica 54 (2), 181-207, 2009	126*	2009
Fast FAST N Alon, D Lokshtanov, S Saurabh International colloquium on automata, languages, and programming, 49-58, 2009	117	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	115*	2006
Parameterized algorithms for feedback set problems and their duals in tournaments V Raman, S Saurabh Theoretical Computer Science 351 (3), 446-458, 2006	110*	2006

Systemet kan ikke utføre handlingen. Prøv på nytt senere.

Artikler 1–20

Sitater per år

Duplikatsitater

Sammenslåtte sitater

Legg til medforfattereMedforfattere

Følg

Sitert av

Medforfattere