Marek Karpinski's research interests are in the design of efficient algorithms, especially randomized and approximate algorithms, computational molecular biology, theory of parallel and distributed systems, and the most fundamental issues of computational complexity and the circuit theory. Karpinski is also interested in efficient approximation methods for the geometric and combinatorial optimization problems which appear to be intractable in exact computation settings. He is a Professor at the Bonn International Graduate School in Mathematics and a founding member of the Hausdorff Center for Mathematics. Karpinski is also a member of the Universities B-IT Research School in Informatics.
- Counting Complexity and Phase Transitions, Spring 2016. Visiting Scientist.