Daniel Lokshantov is an author at University of Bergen specializing in computational complexity, discrete mathematics, and combinatorial optimization.
Top concepts
EngineeringGraph TheoryDiscrete MathematicsComputational ComplexityCombinatorial OptimizationEducationNetwork Analysis
Publications per year
2013–2014
2
2
Rows per page
1–2 of 2