Publications

You can also find my articles on my Google Scholar profile.

NP-Hardness and a PTAS for the Pinwheel Problem

Robert Kleinberg, Ahan Mishra

Published in IEEE Symposium on Foundations of Computer Science (FOCS), 2026

This paper proves NP-hardness of pinwheel scheduling (a 37 year old open problem) using new techniques and establishes a PTAS approximation algorithm, improving on the previous best which was a constant-factor approximation.

An Optimal Density Bound for Discretized Point Patrolling

Ahan Mishra

Published in ACM-SIAM Symposium on Discrete Algorithms (SODA), 2026

This paper proves an optimal theoretical bound for discretized point patrolling (a 10 year old open problem) as well as an improved algorithm for bamboo garden trimming, with extensible techniques in both cases.