Daniel Lokshtanov - Google Scholar Citations

Cited by

	All	Since 2014
Citations	6010	4540
h-index	38	33
i10-index	102	89

1100

550

275

825

20082009201020112012201320142015201620172018201917 98 180 280 334 454 492 510 686 931 1071 836

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
Dániel MarxInstitute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI)Verified email at cs.bme.hu
Michał PilipczukUniversity of WarsawVerified email at mimuw.edu.pl
Marcin PilipczukInstytut Informatyki, Uniwersytet WarszawskiVerified email at mimuw.edu.pl
Ramanujan M. S.University of Warwick, UKVerified email at warwick.ac.uk
Neeldhara MisraIndian Institute of Technology, GandhinagarVerified email at iitgn.ac.in
Marek CyganUniversity of WarsawVerified email at mimuw.edu.pl
Fahad PanolanIndian Institute of Technology HyderabadVerified email at iith.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, NKUA, 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
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
Lukasz KowalikUniversity of WarsawVerified email at mimuw.edu.pl
Pranabendu MisraMax Planck Institute for Informatics, GermanyVerified email at mpi-inf.mpg.de
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	Cited by	Year
Parameterized algorithms M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx, M Pilipczuk, ... Springer 4 (8), 2015	946	2015
Lower bounds based on the Exponential Time Hypothesis. D Lokshtanov, D Marx, S Saurabh Bulletin of the EATCS no 105, 41-71, 2011	248	2011
Kernelization lower bounds through colors and IDs M Dom, D Lokshtanov, S Saurabh ACM Transactions on Algorithms (TALG) 11 (2), 13, 2014	238*	2014
Bidimensionality and kernels FV Fomin, D Lokshtanov, S Saurabh, DM Thilikos Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete …, 2010	182	2010
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	164	2016
(Meta) kernelization HL Bodlaender, FV Fomin, D Lokshtanov, E Penninkx, S Saurabh, ... Journal of the ACM (JACM) 63 (5), 44, 2016	163*	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), 29, 2016	151*	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	142	2012
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), 41, 2016	139	2016
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	131	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), 38, 2012	127*	2012
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	116	2008
Faster parameterized algorithms using linear programming D Lokshtanov, NS Narayanaswamy, V Raman, MS Ramanujan, ... ACM Transactions on Algorithms (TALG) 11 (2), 15, 2014	115	2014
On the complexity of some colorful problems parameterized by treewidth MR Fellows, FV Fomin, D Lokshtanov, F Rosamond, S Saurabh, ... Information and Computation, 2010	112	2010
Treewidth governs the complexity of target set selection O Ben-Zwi, D Hermelin, D Lokshtanov, I Newman Discrete Optimization 8 (1), 87-96, 2011	108*	2011
Intractability of clique-width parameterizations FV Fomin, PA Golovach, D Lokshtanov, S Saurabh SIAM Journal on Computing 39 (5), 1941-1956, 2010	98*	2010
Fast fast N Alon, D Lokshtanov, S Saurabh International Colloquium on Automata, Languages, and Programming, 49-58, 2009	98	2009
Slightly superexponential parameterized problems D Lokshtanov, D Marx, S Saurabh Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011	83	2011
Bidimensionality and EPTAS FV Fomin, D Lokshtanov, V Raman, S Saurabh Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011	79	2011
Saving space by algebraization D Lokshtanov, J Nederlof Proceedings of the forty-second ACM symposium on Theory of computing, 321-330, 2010	79	2010

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