Max Willert

Dr. Max Willert is affiliated with the Theoretical Computer Science Group at the Institut für Informatik, part of the Fachbereich Mathematik und Informatik at Freie Universität Berlin. His research focuses on computational geometry, algorithm design, and theoretical computer science, with a particular emphasis on problems involving polygonal domains, geometric algorithms, and combinatorial optimization. He has contributed to routing schemes, conflict-free chromatic guarding, and geometric covering problems.

Education includes a Bachelor's thesis (2014) on orthogonal variants of the chromatic art gallery problem and a Master's thesis (2016) on routing schemes for disk graphs and polygons. His work bridges theoretical foundations with practical algorithmic solutions in geometric computing.

Teaching spans from 2011 to 2020, covering courses like Informatik A/B, ProInformatik I, randomized algorithms, and programming. He has also led exercise sessions and seminars in topics such as logic, discrete mathematics, and object-oriented programming.

His publications, including contributions to Computational Geometry: Theory and Applications and ISAAC, reflect expertise in geometric algorithms and discrete mathematics. Collaborations include work on routing in polygonal domains, chromatic guarding, and stabbing intersecting disks.