Dr. André Nichterlein, Berlin
“Parameterized algorithms for combinatorial problems”
In this talk I will survey my work on parameterized algorithms for a variety of combinatorial problems with the main focus being on NP-hard and polynomial-time solvable graph problems. This includes problems motivated by applications such as influence maximization, data anonymization, and community detection in social networks as well as fundamental graph-theoretic problems such as maximum cardinality matching. I will highlight theoretical as well as practical results.
17.01.2018 | 09:15 - 11:15
Takustr.9, Raum SR 049