| Andreas Brandstädt | |
| Birth Place: | Arnstadt, East Germany |
| Fields: | Mathematician |
| Workplaces: | University of Jena, University of Duisburg, University of Rostock |
| Alma Mater: | University of Jena |
| Doctoral Advisor: | Gerd Wechsung |
| Known For: | Graph Theory |
Andreas Brandstädt (born 17 January 1949 in Arnstadt, East Germany) is a German mathematician and computer scientist.
He graduated from the Friedrich Schiller University of Jena, Germany, with a Ph.D. (Dr. rer. nat.) in stochastics in 1976 and a habilitation (Dr. sc. nat.) 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,[1] at the University of Duisburg, Germany,and from 1994 to 2014 he was the professor for Theoretical Computer Science[2] at the University of Rostock, Germany.
He was a visiting professor at the universities of Metz, Amiens, and Clermont-Ferrand (France) and at the University of Primorska in Koper(Slovenia). 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 four times was a co-organizer of thisconference) and is member of the Editorial Board of Discrete Applied Mathematics.[3]