Shayan Oveisgharan

Papers

Total Citations

H-Index

About

Shayan Oveisgharan is a leading researcher in approximation algorithms and combinatorial optimization, with a particular focus on movement and coordination problems. His most-cited work, "Minimizing movement" (2009, 75 citations), provides foundational approximation algorithms and inapproximability results for a broad class of movement problems—ranging from robot swarm coordination and firefighter team deployment to map labeling and network message routing. This work has become a key reference for researchers tackling large-scale, coordinated motion planning under resource constraints. Oveisgharan's contributions extend to network design, facility location, and scheduling, where he has developed novel algorithmic techniques that balance theoretical rigor with practical applicability. His research is characterized by elegant reductions and tight bounds, often bridging the gap between discrete optimization and real-world systems. With a citation impact that underscores the relevance of his work, Oveisgharan continues to shape the field of algorithms, inspiring students and researchers to explore the complexities of movement and coordination in computational settings.