Daniel Lokshtanov

Citata da

	Tutte	Dal 2016
Citazioni	7916	5444
Indice H	45	34
i10-index	116	98

1600

800

400

1200

2009201020112012201320142015201620172018201920202021104 176 280 334 455 471 522 673 905 1004 1051 1565 230

Coautori

Saket SaurabhProfessor at Institute of Mathematical SciencesEmail verificata su imsc.res.in
Fedor V. FominProfessor of Computer Science, University of BergenEmail verificata su uib.no
Michał PilipczukUniversity of WarsawEmail verificata su mimuw.edu.pl
Meirav ZehaviBen-Gurion University of the NegevEmail verificata su bgu.ac.il
Dániel MarxCISPA Helmholtz Center for Information SecurityEmail verificata su cispa.saarland
Marcin PilipczukInstytut Informatyki, Uniwersytet WarszawskiEmail verificata su mimuw.edu.pl
Ramanujan M. S.University of Warwick, UKEmail verificata su warwick.ac.uk
Fahad PanolanIndian Institute of Technology HyderabadEmail verificata su iith.ac.in
Marek CyganUniversity of WarsawEmail verificata su mimuw.edu.pl
Neeldhara MisraIndian Institute of Technology, GandhinagarEmail verificata su iitgn.ac.in
Petr GolovachUniversity of BergenEmail verificata su ii.uib.no
Pinar HeggernesProfessor of computer science, University of BergenEmail verificata su ii.uib.no
Michael FellowsProfessor of Informatics, University of BergenEmail verificata su uib.no
Dimitrios M. ThilikosDepartment of Mathematics, National and Kapodistrian University of Athens, AthensEmail verificata su math.uoa.gr
Frances rosamondUniversity of Bergen, NorwayEmail verificata su uib.no
Pranabendu MisraMax Planck Institute for Informatics, GermanyEmail verificata su mpi-inf.mpg.de
Yngve VillangerUniversity of BergenEmail verificata su uib.no
Jesper NederlofUtrecht UniversityEmail verificata su uu.nl
Lukasz KowalikUniversity of WarsawEmail verificata su mimuw.edu.pl
Geevarghese PhilipAssistant Professor, Chennai Mathematical InstituteEmail verificata su cmi.ac.in

Daniel Lokshtanov

Associate Professor in Computer Science, UCSB

Email verificata su ucsb.edu - Home page

Algorithms Computational Complexity Graph Theory


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
Parameterized algorithms M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx, M Pilipczuk, ... Springer 5 (4), 16, 2015	1502	2015
Lower bounds based on the Exponential Time Hypothesis. D Lokshtanov, D Marx, S Saurabh Bulletin of the EATCS no 105, 41-71, 2011	299	2011
Kernelization lower bounds through colors and IDs M Dom, D Lokshtanov, S Saurabh ACM Transactions on Algorithms (TALG) 11 (2), 1-20, 2014	259*	2014
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	240	2016
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	203*	2016
Bidimensionality and kernels FV Fomin, D Lokshtanov, S Saurabh, DM Thilikos Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete …, 2010	202	2010
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	175	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	169	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	162*	2018
(Meta) kernelization HL Bodlaender, FV Fomin, D Lokshtanov, E Penninkx, S Saurabh, ... Journal of the ACM (JACM) 63 (5), 1-69, 2016	154	2016
Faster parameterized algorithms using linear programming D Lokshtanov, NS Narayanaswamy, V Raman, MS Ramanujan, ... ACM Transactions on Algorithms (TALG) 11 (2), 1-31, 2014	135	2014
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	133*	2012
Treewidth governs the complexity of target set selection O Ben-Zwi, D Hermelin, D Lokshtanov, I Newman Discrete Optimization 8 (1), 87-96, 2011	132*	2011
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	129	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	126	2010
Intractability of clique-width parameterizations FV Fomin, PA Golovach, D Lokshtanov, S Saurabh SIAM Journal on Computing 39 (5), 1941-1956, 2010	119*	2010
Slightly superexponential parameterized problems D Lokshtanov, D Marx, S Saurabh SIAM Journal on Computing 47 (3), 675-702, 2018	113*	2018
Fast fast N Alon, D Lokshtanov, S Saurabh International Colloquium on Automata, Languages, and Programming, 49-58, 2009	107	2009
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	106	2014
Kernelization: theory of parameterized preprocessing FV Fomin, D Lokshtanov, S Saurabh, M Zehavi Cambridge University Press, 2019	103	2019

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Carica PDF

Segui questo autore

Citata da

Coautori