Karl Bringmann

Karl Bringmann is a Full Professor in the Department of Computer Science at ETH Zurich. His research focuses on algorithms, fine-grained complexity theory, combinatorial optimization, computational geometry, and graph algorithms. He is affiliated with ETH Zurich and contributes to the academic community through his work in these areas. His profile page provides further details about his research and academic activities.

Karl Bringmann is a Professor in Computer Science at Saarland University, specializing in Algorithms and Complexity. His research focuses on the design and analysis of efficient algorithms for computational problems, particularly in the areas of string algorithms, geometric problems, and optimization. He investigates the complexity of problems such as dynamic time warping, Frechet distance, and subset sum, often using conditional lower bounds based on the Strong Exponential Time Hypothesis (SETH). Bringmann's work also explores approximation algorithms, hypervolume indicators, and multivariate complexity analysis. His contributions span theoretical computer science, with an emphasis on both algorithmic techniques and complexity theory.