Gruia Calinescu

Gruia Calinescu is an Associate Professor of Computer Science at Illinois Institute of Technology (IIT), affiliated with the College of Computing's Computer Science Department. He joined IIT in 2000 and has held visiting positions at the University of Bonn and the University of Wisconsin-Milwaukee. His research focuses on approximation algorithms, combinatorial optimization, and theoretical computer science, with contributions to graph theory, network design, and algorithmic problems in wireless networks.

Education includes a PhD from Georgia Tech's Algorithms, Combinatorics, and Optimization program (1998) under Howard Karloff. He also holds a diploma from the University of Bucharest in scheduling theory.

Key research interests include algorithms for Steiner trees, network connectivity, scheduling, and power optimization. He has published extensively on topics like minimum power covering, relay placement, and LP rounding techniques. His work often bridges theoretical foundations with practical applications in wireless networks and distributed systems.

Recent work includes advancements in combination algorithms for Steiner tree variants (2022), energy-aware scheduling (2016), and improved approximation algorithms for relay placement (2014). He is also involved in teaching, such as CS 530 - Theory of Computation.