Orli Waarts

Papers

Total Citations

H-Index

About

Orli Waarts is a distinguished computer scientist whose research lies at the intersection of algorithms, data structures, and combinatorial optimization, with a particular focus on online and dynamic problems. Her most-cited work, "Competitive access time via dynamic storage rearrangement" (2002), introduces a powerful model for minimizing server traversal distance in warehouse storage systems—a problem with direct applications to industrial stacker crane management. By analyzing how items can be dynamically rearranged to reduce access costs, Waarts provides foundational insights into competitive analysis and online algorithms. Though her citation counts are modest, her contributions are highly specialized and influential within the algorithmic operations research community. Waarts’ work is notable for bridging theoretical computer science with practical logistics, offering elegant solutions to complex storage and retrieval problems. Her research continues to inform modern studies in dynamic data management and resource allocation, making her a respected figure in the field of algorithmic design.