Full Description
They deal with algorithm, complexity, problem, reduction, NP-complete, graph, approximation, linear programming, local search, integer programming, semidefinite programming, parameterized algorithm, fixed parameter, tractability, randomness, computational geometry.



