Daniel Lokshtanov

Navedeno

	Vse	Od leta 2018
Navedbe	10605	6545
indeks h	50	36
indeks i10	140	115

1600

800

400

1200

20092010201120122013201420152016201720182019202020212022202394 174 261 342 464 460 511 680 883 950 1009 1359 1307 1517 388

Javni dostop

Prikaži vse

102 članka

1 članek

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

Saket SaurabhProfessor at Institute of Mathematical SciencesPreverjeni e-poštni naslov na imsc.res.in
Fedor V. FominProfessor of Computer Science, University of BergenPreverjeni e-poštni naslov na uib.no
Michał PilipczukUniversity of WarsawPreverjeni e-poštni naslov na mimuw.edu.pl
Meirav ZehaviBen-Gurion University of the NegevPreverjeni e-poštni naslov na bgu.ac.il
Marcin PilipczukInstytut Informatyki, Uniwersytet WarszawskiPreverjeni e-poštni naslov na mimuw.edu.pl
Fahad PanolanIndian Institute of Technology HyderabadPreverjeni e-poštni naslov na iith.ac.in
Dániel MarxCISPA Helmholtz Center for Information SecurityPreverjeni e-poštni naslov na cispa.saarland
Ramanujan M. S.University of Warwick, UKPreverjeni e-poštni naslov na warwick.ac.uk
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
Petr GolovachUniversity of BergenPreverjeni e-poštni naslov na ii.uib.no
Michael FellowsProfessor of Informatics, University of BergenPreverjeni e-poštni naslov na uib.no
Venkatesh RamanProfessor, IMSc ChennaiPreverjeni e-poštni naslov na imsc.res.in
Frances rosamondUniversity of Bergen, NorwayPreverjeni e-poštni naslov na uib.no
Pinar HeggernesProfessor of computer science, University of BergenPreverjeni e-poštni naslov na ii.uib.no
Dimitrios M. ThilikosDepartment of Mathematics, National and Kapodistrian University of AthensPreverjeni e-poštni naslov na thilikos.info
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
Yngve VillangerUniversity of BergenPreverjeni e-poštni naslov na uib.no
Lukasz KowalikUniversity of WarsawPreverjeni e-poštni naslov na mimuw.edu.pl

Spremljaj

Daniel Lokshtanov

Professor of Computer Science, UCSB

Preverjeni e-poštni naslov na ucsb.edu - Domača stran

Algorithms Computational Complexity Graph Theory


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	2303	2015
Lower bounds based on the Exponential Time Hypothesis. D Lokshtanov, D Marx, S Saurabh Bulletin of the EATCS no 105, 41-71, 2011	357	2011
A 5-Approximation Algorithm for Treewidth HL Bodlaender, PG Drange, MS Dregi, FV Fomin, D Lokshtanov, ... SIAM Journal on Computing 45 (2), 317-378, 2016	332	2016
Kernelization lower bounds through colors and IDs M Dom, D Lokshtanov, S Saurabh ACM Transactions on Algorithms (TALG) 11 (2), 1-20, 2014	298*	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	251*	2016
Kernelization: theory of parameterized preprocessing FV Fomin, D Lokshtanov, S Saurabh, M Zehavi Cambridge University Press, 2019	237	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	218	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	213*	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	207	2012
Bidimensionality and kernels FV Fomin, D Lokshtanov, S Saurabh, DM Thilikos Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete …, 2010	207	2010
Faster parameterized algorithms using linear programming D Lokshtanov, NS Narayanaswamy, V Raman, MS Ramanujan, ... ACM Transactions on Algorithms (TALG) 11 (2), 1-31, 2014	172	2014
(Meta) kernelization HL Bodlaender, FV Fomin, D Lokshtanov, E Penninkx, S Saurabh, ... Journal of the ACM (JACM) 63 (5), 1-69, 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, 2010	157	2010
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	156	2008
Treewidth governs the complexity of target set selection O Ben-Zwi, D Hermelin, D Lokshtanov, I Newman Discrete Optimization 8 (1), 87-96, 2011	154*	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	143*	2012
Slightly superexponential parameterized problems D Lokshtanov, D Marx, S Saurabh SIAM Journal on Computing 47 (3), 675-702, 2018	141*	2018
Intractability of clique-width parameterizations FV Fomin, PA Golovach, D Lokshtanov, S Saurabh SIAM Journal on Computing 39 (5), 1941-1956, 2010	136*	2010
Independent Set in P₅-Free Graphs in Polynomial Time D Lokshantov, M Vatshelle, Y Villanger Proceedings of the twenty-fifth annual ACM-SIAM symposium on discrete …, 2014	135	2014
Fast FAST N Alon, D Lokshtanov, S Saurabh Automata, Languages and Programming: 36th International Colloquium, ICALP …, 2009	121	2009

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