معرفی
Prof. Dr. T. Andreae is a faculty member at the University of Hamburg's Faculty of Mathematics, specializing in Discrete Mathematics. His research focuses on graph theory, combinatorics, and their applications in theoretical computer science and optimization. He has contributed significantly to areas such as infinite graph reconstruction, immersion theory, and algorithmic game theory.
His academic background includes a Doctoral Dissertation on infinite graph systems (1978) and extensive work on graph embeddings, TSP approximations, and clique transversals. Key contributions include studies on ubiquitous graphs, self-immersions in infinite graphs, and optimization under relaxed triangle inequalities.
Prof. Andreae is affiliated with the Discrete Mathematics group and the Mathematical Seminar at the University of Hamburg. He has authored over 50 publications, with recent work emphasizing structural properties of infinite graphs and algorithmic solutions for discrete problems.
His teaching includes courses such as 'Mathematics for Computer Science Students' (ALA and DM tracks), for which he provides detailed lecture scripts. No scientific awards are explicitly mentioned in his profile.
