Leen Stougie

Eindhoven University of Technology, Centrum Wiskunde & Informatica

Papers

Total Citations

202

H-Index

About

Leen Stougie is a distinguished computer scientist whose research sits at the intersection of combinatorial optimization, algorithm design, and online computation. Best known for foundational contributions to online algorithms, Stougie has made a lasting mark through rigorous theoretical analysis of problems with real-world relevance in logistics and robotics. His most celebrated work addresses the Online Travelling Salesman Problem (OLTSP), which tackles the challenge of efficiently serving dynamically arriving requests distributed across a metric space — a problem with direct applications in delivery routing and autonomous systems. This line of research, developed across multiple publications including a landmark 2001 paper that has accumulated 167 citations, established competitive analysis frameworks that remain influential in the field. Stougie also made notable contributions to bin coloring, an elegant combinatorial problem explored in both a 2001 paper and a refined 2008 follow-up, demonstrating a sustained commitment to understanding resource allocation under online constraints. Collectively, his work bridges abstract algorithmic theory with practical optimization challenges, making him a valued voice in the theoretical computer science community and a reliable reference point for researchers studying online and approximation algorithms.