Projects / Research interests
To develop efficient methods for solving discrete optimization problems,
knowledge on the structure of the underlying graphs and associated polyhedra
is required. My research focuses on
-
discrete structures
(graphs, hypergraphs, set systems, orders)
-
algorithmic graph theory
(stable set problem, several coloring problems)
-
polyhedral combinatorics
(stable set polytope and its relaxations, chromatic scheduling polytopes)
and applications in
-
systems biology
(reconstruction of regulatory networks, analysis of metabolic networks)
-
telecommunication
(assignment problems in point-to-multipoint radio access systems)