Saket Saurabh

Navedeno

	Vse	Od leta 2019
Navedbe	13972	8136
indeks h	54	34
indeks i10	209	152

1600

800

400

1200

2008200920102011201220132014201520162017201820192020202120222023202465 158 264 359 406 539 507 553 720 908 1073 1111 1390 1219 1458 1578 1364

Javni dostop

Prikaži vse

163 člankov

25 člankov

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

Daniel LokshtanovProfessor of Computer Science, UCSBPreverjeni e-poštni naslov na ucsb.edu
Fedor V. FominProfessor of Computer Science, University of BergenPreverjeni e-poštni naslov na uib.no
Meirav ZehaviBen-Gurion University of the NegevPreverjeni e-poštni naslov na bgu.ac.il
Fahad PanolanSchool of Computing, University of LeedsPreverjeni e-poštni naslov na leeds.ac.uk
Michał PilipczukUniversity of WarsawPreverjeni e-poštni naslov na mimuw.edu.pl
Ramanujan M. S.University of Warwick, UKPreverjeni e-poštni naslov na warwick.ac.uk
Dániel MarxCISPA Helmholtz Center for Information SecurityPreverjeni e-poštni naslov na cispa.saarland
Marek CyganUniversity of WarsawPreverjeni e-poštni naslov na mimuw.edu.pl
Neeldhara MisraIndian Institute of Technology, GandhinagarPreverjeni e-poštni naslov na iitgn.ac.in
Pranabendu MisraAssistant Professor at Chennai Mathematical InstitutePreverjeni e-poštni naslov na cmi.ac.in
Akanksha AgrawalIndian Institute of Technology MadrasPreverjeni e-poštni naslov na cse.iitm.ac.in
Marcin PilipczukInstytut Informatyki, Uniwersytet WarszawskiPreverjeni e-poštni naslov na mimuw.edu.pl
Petr GolovachUniversity of BergenPreverjeni e-poštni naslov na ii.uib.no
Geevarghese PhilipFaculty Member at Chennai Mathematical InstitutePreverjeni e-poštni naslov na cmi.ac.in
Sushmita GuptaThe Institute of Mathematical Sciences (IMSc)Preverjeni e-poštni naslov na imsc.res.in
Serge GaspersProfessor, UNSW Sydney, AustraliaPreverjeni e-poštni naslov na cse.unsw.edu.au
Dimitrios M. ThilikosPreverjeni e-poštni naslov na thilikos.info
Frances RosamondLebanese American University, Beirut and Western Sydney University, AustraliaPreverjeni e-poštni naslov na lau.edu.lb
Lawqueen KaneshIndian Institute of Technology Jodhpur, IndiaPreverjeni e-poštni naslov na iitj.ac.in
Sudeshna KolayIIT KharagpurPreverjeni e-poštni naslov na cse.iitkgp.ac.in

Spremljaj

Saket Saurabh

Professor at Institute of Mathematical Sciences

Preverjeni e-poštni naslov na imsc.res.in

Parameteried Complexity Graph Algorithms


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
Parameterized algorithms M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx, M Pilipczuk, ... Springer 5 (4), 16, 2015	2984	2015
Lower bounds based on the exponential-time hypothesis M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx, M Pilipczuk, ... Parameterized Algorithms, 467-521, 2015	402	2015
Kernelization: theory of parameterized preprocessing FV Fomin, D Lokshtanov, S Saurabh, M Zehavi Cambridge University Press, 2019	345	2019
Kernelization lower bounds through colors and IDs M Dom, D Lokshtanov, S Saurabh ACM Transactions on Algorithms (TALG) 11 (2), 1-20, 2014	325*	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	303*	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	254*	2018
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	252	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	231	2012
Bidimensionality and kernels FV Fomin, D Lokshtanov, S Saurabh, DM Thilikos Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete …, 2010	231	2010
Faster parameterized algorithms using linear programming D Lokshtanov, NS Narayanaswamy, V Raman, MS Ramanujan, ... ACM Transactions on Algorithms (TALG) 11 (2), 15, 2014	221*	2014
(Meta) Kernelization HL Bodlaender, FV Fomin, D Lokshtanov, E Penninkx, S Saurabh, ... Journal of the ACM (JACM) 63 (5), 44, 2016	178	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	172	2008
Slightly superexponential parameterized problems D Lokshtanov, D Marx, S Saurabh SIAM Journal on Computing 47 (3), 675-702, 2018	167*	2018
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	166*	2011
Intractability of clique-width parameterizations FV Fomin, PA Golovach, D Lokshtanov, S Saurabh SIAM Journal on Computing 39 (5), 1941-1956, 2010	155*	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	153*	2012
On two techniques of combining branching and treewidth FV Fomin, S Gaspers, S Saurabh, AA Stepanov Algorithmica 54, 181-207, 2009	139*	2009
Fast FAST N Alon, D Lokshtanov, S Saurabh International colloquium on automata, languages, and programming, 49-58, 2009	129	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	121*	2006
Parameterized algorithms for feedback set problems and their duals in tournaments V Raman, S Saurabh Theoretical Computer Science 351 (3), 446-458, 2006	117*	2006

Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.

Članki 1–20

Št. navedb na leto

Podvojene navedbe

Združene navedbe

Dodajanje soavtorjevSoavtorji

Spremljaj

Navedeno

Soavtorji