Marek M. Karpinski

Marek M. Karpinski is a Chair Professor of Computer Science at the University of Bonn and a founding member of the Hausdorff Center for Mathematics. He has held visiting or professorial positions at institutions such as Princeton University, Carnegie-Mellon University, and the University of Edinburgh. His affiliations also include the B-IT Research School on Applied Informatics and the Lab for Foundations of Computing.

His research spans efficient algorithms, combinatorial optimization, computational complexity, randomized approximation techniques, and applications in network design, quantum computation, and molecular biology. Recent work focuses on approximation hardness for NP-hard problems, graph algorithms, and algebraic computational complexity.

His scientific contributions include polynomial time approximation schemes for dense NP-hard problems and key publications in randomized algorithms, VC dimension, and network optimization. He has advised numerous researchers and received honors such as the Humboldt Research Award and the Max Planck Research Prize.