Bernd Gärtner

Bernd Gärtner is an Adjunct Professor in the Department of Computer Science at ETH Zurich. His research focuses on algorithms, combinatorics, geometry, and optimization. He is affiliated with ETH Zurich and maintains a profile page at https://www.inf.ethz.ch/people/person-detail.gaertner.html. No existing biography is provided for him.

Bernd Gärtner is a Professor of Computer Science at ETH Zurich, specializing in theoretical computer science, combinatorial algorithms, and discrete optimization. His research focuses on the design and analysis of efficient algorithms for geometric and combinatorial problems, with an emphasis on linear programming, convex optimization, and computational geometry. He has contributed significantly to the development of algorithms for problems such as smallest enclosing balls, abstract optimization, and coreset construction. His work often combines theoretical insights with practical applications, aiming to improve the efficiency and robustness of computational methods in high-dimensional spaces.