Michael Hoffmann

Michael Hoffmann is a Professor in the Department of Computer Science at ETH Zürich. His research focuses on computational geometry, graph theory, and algorithm design. He has authored numerous publications in top-tier conferences and journals.

Education: Details not explicitly provided in the text, but his extensive list of publications and supervisory roles suggest advanced academic training in computer science and mathematics.

Research Interests: Hoffmann's work spans geometric graph theory, graph drawing, and algorithmic problems in discrete and computational geometry. He explores topics such as crossing numbers, planar graphs, geometric realizations of ordinal graphs, and obstacle numbers. His research bridges theoretical foundations with practical applications in visualization and algorithm design.

Recent Articles Trends: His recent work emphasizes maximal planar graphs, monotone interleavings visualization, and geometric realizations of ordinal graphs. These studies highlight advancements in understanding graph structures and their geometric representations.

• Scientific Awards: None explicitly mentioned in the provided text.
• Grants/Advising: Supervised over 20 graduate and undergraduate students, including PhD candidates Meghana M. Reddy and Alexandra Weinberger. His students have contributed to projects on bipartite graphs, maximal planar graphs, and geometric algorithms.

Labs/Teams: Active in ETH Zürich's computational geometry research group, contributing to collaborative projects like the Arrangements and Drawings initiative (2018–2022).