Sven O. Krumke

Zuse Institute Berlin, University of Kaiserslautern

Papers

Total Citations

H-Index

About

Sven O. Krumke has made influential contributions to combinatorial optimization and online algorithms, with a particular focus on bin coloring and scheduling problems. His most-cited work, "Online Bin Coloring" (2001, 22 citations), introduced foundational models for assigning colors to items in bins under online constraints, addressing resource allocation challenges in cloud computing and logistics. This work, along with his subsequent paper "Bincoloring" (2008, 10 citations), advanced the theoretical understanding of how to minimize conflicts in dynamic environments where decisions must be made without full knowledge of future inputs. Krumke’s research bridges discrete mathematics and practical algorithm design, offering insights into competitive analysis and approximation techniques. His contributions have been recognized in the operations research and theoretical computer science communities, where his papers serve as key references for researchers tackling online decision-making problems. Through his clear, rigorous approach, Krumke has shaped how we think about optimizing resource usage under uncertainty, making his work essential reading for students and scholars exploring the intersection of graph theory, scheduling, and online algorithms.