Daniel Lokshtanov - Google Scholar

Cited by

	All	Since 2015
Citations	7201	5268
h-index	43	35
i10-index	110	94

1100

550

275

825

200920102011201220132014201520162017201820192020105 178 279 334 456 471 518 650 923 1008 1081 1059

Co-authors

Saket SaurabhProfessor at Institute of Mathematical SciencesVerified email at imsc.res.in
Fedor V. FominProfessor of Computer Science, University of BergenVerified email at uib.no
Michał PilipczukUniversity of WarsawVerified email at mimuw.edu.pl
Dániel MarxInstitute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI)Verified email at cs.bme.hu
Meirav ZehaviBen-Gurion University of the NegevVerified email at bgu.ac.il
Marcin PilipczukInstytut Informatyki, Uniwersytet WarszawskiVerified email at mimuw.edu.pl
Ramanujan M. S.University of Warwick, UKVerified email at warwick.ac.uk
Fahad PanolanIndian Institute of Technology HyderabadVerified email at iith.ac.in
Marek CyganUniversity of WarsawVerified email at mimuw.edu.pl
Neeldhara MisraIndian Institute of Technology, GandhinagarVerified email at iitgn.ac.in
Petr GolovachUniversity of BergenVerified email at ii.uib.no
Pinar HeggernesProfessor of computer science, University of BergenVerified email at ii.uib.no
Dimitrios M. ThilikosDepartment of Mathematics, National and Kapodistrian University of Athens, AthensVerified email at math.uoa.gr
Michael FellowsProfessor of Informatics, University of BergenVerified email at uib.no
Frances rosamondUniversity of Bergen, NorwayVerified email at uib.no
Pranabendu MisraMax Planck Institute for Informatics, GermanyVerified email at mpi-inf.mpg.de
Yngve VillangerUniversity of BergenVerified email at uib.no
Hans L. BodlaenderProfessor Computer Science, Utrecht University and Technical University EindhovenVerified email at uu.nl
Jesper NederlofTechnische Universiteit EindhovenVerified email at tue.nl
Geevarghese PhilipAssistant Professor, Chennai Mathematical InstituteVerified email at cmi.ac.in

Daniel Lokshtanov

Associate Professor in Computer Science, UCSB

Verified email at ucsb.edu - Homepage

Algorithms Computational Complexity Graph Theory


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Parameterized algorithms M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx, M Pilipczuk, ... Springer 4 (8), 2015	1289	2015
Lower bounds based on the Exponential Time Hypothesis. D Lokshtanov, D Marx, S Saurabh Bulletin of the EATCS no 105, 41-71, 2011	274	2011
Kernelization lower bounds through colors and IDs M Dom, D Lokshtanov, S Saurabh ACM Transactions on Algorithms (TALG) 11 (2), 1-20, 2014	251*	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	219	2016
Bidimensionality and kernels FV Fomin, D Lokshtanov, S Saurabh, DM Thilikos Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete …, 2010	195	2010
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	194*	2016
(Meta) kernelization HL Bodlaender, FV Fomin, D Lokshtanov, E Penninkx, S Saurabh, ... Journal of the ACM (JACM) 63 (5), 1-69, 2016	175*	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	163	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	158	2012
Known algorithms on graphs of bounded treewidth are probably optimal D Lokshtanov, D Marx, S Saurabh Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete …, 2010	139	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	133*	2012
Faster parameterized algorithms using linear programming D Lokshtanov, NS Narayanaswamy, V Raman, MS Ramanujan, ... ACM Transactions on Algorithms (TALG) 11 (2), 1-31, 2014	130	2014
Treewidth governs the complexity of target set selection O Ben-Zwi, D Hermelin, D Lokshtanov, I Newman Discrete Optimization 8 (1), 87-96, 2011	122*	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	118	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	117	2010
Intractability of clique-width parameterizations FV Fomin, PA Golovach, D Lokshtanov, S Saurabh SIAM Journal on Computing 39 (5), 1941-1956, 2010	106*	2010
Fast fast N Alon, D Lokshtanov, S Saurabh International Colloquium on Automata, Languages, and Programming, 49-58, 2009	103	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	99	2014
Slightly superexponential parameterized problems D Lokshtanov, D Marx, S Saurabh Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011	90	2011
Bidimensionality and EPTAS FV Fomin, D Lokshtanov, V Raman, S Saurabh Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011	85	2011

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Upload PDF

Follow this author

Cited by

Co-authors