Daniel Lokshtanov

163 papers and 2.5k indexed citations i.

Daniel Lokshtanov has authored 163 papers that have received a total of 2.5k indexed citations. This includes 151 papers in Computational Theory and Mathematics, 62 papers in Computer Networks and Communications and 28 papers in Discrete Mathematics and Combinatorics. The topics of these papers are Advanced Graph Theory Research (145 papers), Combinatorial Optimization and Complexity Theory (112 papers) and Optimization and Search Problems (29 papers). Daniel Lokshtanov is often cited by papers focused on Advanced Graph Theory Research (145 papers), Combinatorial Optimization and Complexity Theory (112 papers) and Optimization and Search Problems (29 papers) and collaborates with scholars based in Norway, India and United States. Daniel Lokshtanov's co-authors include Saket Saurabh, Fedor V. Fomin, Michał Pilipczuk, Marcin Pilipczuk and Dániel Marx and has published in prestigious journals such as Bioinformatics, Journal of the ACM and SIAM Journal on Computing.