Andreas Brandstädt


Andreas Brandstädt is a German mathematician and computer scientist.

Life and work

He graduated from the Friedrich Schiller University of Jena, Germany, with a Ph.D. in stochastics in 1976 and a habilitation in complexity theory in 1983.
Since 1974 he worked there in the group of his academic teacher Gerd Wechsung.
From 1991 to 1994, he was the professor for Computer Science in the Department of Mathematics,
at the University of Duisburg, Germany,
and from 1994 to 2014 he was the professor for Theoretical Computer Science at the University of Rostock, Germany.
He was a visiting professor at the universities of Metz, Amiens, and Clermont-Ferrand and at the University of Primorska in Koper
. He was Invited Speaker at various conferences in Argentina, Austria, Belarus, Brasil, Canada, China, France,
Greece, India, Israel, Norway, Poland, Slovenia, and Switzerland.
Brandstädt is an active researcher in graph algorithms, discrete mathematics, combinatorial optimization, and graph theory. A frequently used tool in his papers is tree structure of graphs and hypergraphs such as for hypertrees, strongly chordal graphs and chordal graphs.
He frequently took part in program committees such as Workshop on Graph-Theoretic Concepts in Computer Science and is member of the Editorial Board of Discrete Applied Mathematics.

Selected bibliography