معرفی
Prof. Michael Kaufmann is a Professor in the Department of Computer Science at Eberhard Karls University of Tübingen, within the Faculty of Mathematics and Natural Sciences. He is affiliated with the Wilhelm-Schickard Institute of Computer Science and leads the Algorithmics team. His research focuses on algorithms, complexity, computational geometry, graph drawing, and network visualization. He holds a prominent role in advancing theoretical computer science and combinatorial optimization.
His research interests span algorithms and complexity, approximations, combinatorial optimization, computational geometry, graph drawing applications, and parallelism. His work bridges theoretical foundations with practical applications in network visualization and algorithmic design.
Prof. Kaufmann has published extensively in leading venues, including Graph Drawing (GD), International Symposium on Theoretical Aspects of Computer Science (STACS), and International Workshop on Graph-Theoretic Concepts in Computer Science (WG). His publications address challenges in graph visualization, algorithmic techniques, and computational geometry.
He advises students through the Algorithmics team and maintains an office at Room B112, reachable via email or phone. His work contributes to both academic and applied domains within computer science.
