Andreas Brandstädt
Andreas Brandstädt (born January 17, 1949 in Arnstadt , Thuringia ) is a German mathematician and computer scientist.
life and work
Brandstädt studied mathematics at the Friedrich Schiller University Jena and graduated with a doctorate in stochastics in 1976. He completed his habilitation in 1983 in the field of complexity theory. Since 1974 he worked there in the group of his academic teacher Gerd Wechsung .
From 1991 to 1994 he was Professor of Computer Science at the Faculty of Mathematics at the University of Duisburg , and from 1994 to 2014 he was Professor of Theoretical Computer Science at the University of Rostock .
He was visiting professor at the Universities of Metz , Amiens and Clermont-Ferrand ( France ) and the University of Primorska in Koper ( Slovenia ). He has been invited to speak at various conferences in Argentina, Austria, Belarus, Brazil, Canada, China, France, Greece, India, Israel, Norway, Poland, Slovenia and Switzerland.
Brandstädt is an active researcher in the fields of graph algorithms, discrete mathematics , combinatorial optimization and graph theory . He frequently uses the tree structure of graphs and hypergraphs in his research to study hyper-trees, strongly chordal graphs, and chordal graphs . He was a member of the program committee of the conference series Workshop on Graph-Theoretic Concepts in Computer Science many times (and was three times co-organizer of this conference). He is also a member of the editorial board of the journal Discrete Applied Mathematics .
Fonts (selection)
- Graphs and algorithms , Teubner-Verlag, Stuttgart, 1994, ISBN 3-519-02131-5
- with Van Bang Le and Jeremy P. Spinrad: Graph Classes: A Survey , SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, PA, 1999, 2nd edition 2004 , ISBN 0-89871-432-X
- with Jeremy P. Spinrad and Lorna K. Stewart: Bipartite permutation graphs, Discrete Applied Math. 18, 1987, pp. 279-292
- with Feodor Dragan, Victor Chepoi and Vitaly Voloshin: Dually chordal graphs, In: SIAM J. Discrete Math. 11, 1998, pp. 437-455
- with Feodor Dragan, and Ekkehard Köhler: Linear time algorithms for Hamiltonian problems on (claw, net) -free graphs, SIAM J. Comput. Vol 30 No. 5, pp. 1662-1677, 2000
- with Van Bang Le, and R. Sritharan: Structure and linear-time recognition of 4-leaf powers, ACM Transactions on Algorithms Vol. 5, Issue 1, Article No. 11, 2008
- with Raffaele Mosca: Dominating Induced Matchings for P7-Free Graphs in Linear Time, Algorithmica Vol 68, pp. 998-1018, 2014
Web links
- Andreas Brandstädt's entry in the Mathematics Genealogy Project
- Andreas Brandstädts Home Page
- Entry about Andreas Brandstädt in the DBLP computer science bibliography
- Andreas Brandstädt at Google Scolar
- Entry on Andreas Brandstädt in the Catalogus Professorum Rostochiensium
Individual evidence
| personal data | |
|---|---|
| SURNAME | Brandstädt, Andreas |
| BRIEF DESCRIPTION | German mathematician and computer scientist |
| DATE OF BIRTH | January 17, 1949 |
| PLACE OF BIRTH | Arnstadt , Germany |