Kolliopoulos Stavros is a Professor in the Department of Informatics and Telecommunications at the National and Kapodistrian University of Athens. His work focuses on theoretical computer science, algorithms, and combinatorial optimization. He has contributed to scheduling theory, network optimization, and approximation algorithms. His research addresses problems like resource allocation, disjoint paths in graphs, and facility location. Key research interests include the design and analysis of algorithms for NP-hard problems, with applications to scheduling, network flow, and operations research. He explores techniques such as linear programming relaxations and greedy algorithms to achieve approximation guarantees. His recent publications (2023–2025) emphasize time-sharing scheduling, linear-time graph algorithms, and IoT resource management. Earlier work (1997–2013) includes foundational contributions to unsplittable flow, facility location, and selfish routing in networks. His work bridges theoretical insights with practical algorithmic solutions. Notably, he has developed FPTAS algorithms for tardiness minimization and established tight bounds for Lovász-Schrijver rank in facility location problems. His research often combines graph theory with optimization principles to solve real-world network and scheduling challenges.








