Daniel Lokshtanov

Citée par

	Toutes	Depuis 2018
Citations	11635	7555
indice h	52	38
indice i10	149	122

1500

750

375

1125

20092010201120122013201420152016201720182019202020212022202392 166 266 330 460 465 522 684 897 952 1002 1387 1245 1466 1481

Accès public

Tout afficher

103 articles

2 articles

disponibles

non disponibles

Sur la base des exigences liées au financement

Coauteurs

Saket SaurabhProfessor at Institute of Mathematical SciencesAdresse e-mail validée de imsc.res.in
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
Michał PilipczukUniversity of WarsawAdresse e-mail validée de mimuw.edu.pl
Fahad PanolanSchool of Computing, University of LeedsAdresse e-mail validée de leeds.ac.uk
Marcin PilipczukInstytut Informatyki, Uniwersytet WarszawskiAdresse e-mail validée de mimuw.edu.pl
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
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
Petr GolovachUniversity of BergenAdresse e-mail validée de ii.uib.no
Pranabendu MisraAssistant Professor at Chennai Mathematical InstituteAdresse e-mail validée de cmi.ac.in
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
Venkatesh RamanProfessor, IMSc ChennaiAdresse e-mail validée de imsc.res.in
Akanksha AgrawalIndian Institute of Technology MadrasAdresse e-mail validée de cse.iitm.ac.in
Pinar HeggernesProfessor of computer science, University of BergenAdresse e-mail validée de ii.uib.no
Dimitrios M. ThilikosDepartment of Mathematics, National and Kapodistrian University of AthensAdresse e-mail validée de thilikos.info
Yngve VillangerUniversity of BergenAdresse e-mail validée de uib.no
Lukasz KowalikUniversity of WarsawAdresse e-mail validée de mimuw.edu.pl

Suivre

Daniel Lokshtanov

Professor of Computer Science, UCSB

Adresse e-mail validée de ucsb.edu - Page d'accueil

Algorithms Computational Complexity Graph Theory


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 4 (8), 2015	2605	2015
Lower bounds based on the Exponential Time Hypothesis. D Lokshtanov, D Marx, S Saurabh Bulletin of the EATCS no 105, 41-71, 2011	370	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	351	2016
Kernelization lower bounds through colors and IDs M Dom, D Lokshtanov, S Saurabh ACM Transactions on Algorithms (TALG) 11 (2), 1-20, 2014	316*	2014
Kernelization: theory of parameterized preprocessing FV Fomin, D Lokshtanov, S Saurabh, M Zehavi Cambridge University Press, 2019	301	2019
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	279*	2016
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	231	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	227*	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	220	2012
Bidimensionality and kernels FV Fomin, D Lokshtanov, S Saurabh, DM Thilikos Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete …, 2010	219*	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	187	2014
(Meta) kernelization HL Bodlaender, FV Fomin, D Lokshtanov, E Penninkx, S Saurabh, ... Journal of the ACM (JACM) 63 (5), 1-69, 2016	175	2016
Treewidth governs the complexity of target set selection O Ben-Zwi, D Hermelin, D Lokshtanov, I Newman Discrete Optimization 8 (1), 87-96, 2011	169*	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	166	2008
On the complexity of some colorful problems parameterized by treewidth MR Fellows, FV Fomin, D Lokshtanov, F Rosamond, S Saurabh, ... Information and Computation, 2010	160	2010
Slightly superexponential parameterized problems D Lokshtanov, D Marx, S Saurabh SIAM Journal on Computing 47 (3), 675-702, 2018	154*	2018
Intractability of clique-width parameterizations FV Fomin, PA Golovach, D Lokshtanov, S Saurabh SIAM Journal on Computing 39 (5), 1941-1956, 2010	150*	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	146*	2012
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	141	2014
Fast FAST N Alon, D Lokshtanov, S Saurabh International colloquium on automata, languages, and programming, 49-58, 2009	125	2009

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