Convex Polygon Containment: Improving Quadratic to Near Linear Time. - Timothy M. Chan; Isaac M. Hair (SoCG, 2024)

The Case For Data Centre Hyperloops. - Guillem López-Paradís; Isaac M. Hair; Sid Kannan; Roman Rabbat; Parker Murray; Alex Lopes; Rory Zahedi; Winston Zuo; Jonathan Balkind (ISCA, 2024)

A Linear Time Algorithm for the Maximum Overlap of Two Convex Polygons Under Translation. - Timothy M. Chan; Isaac M. Hair (SoCG, 2025)

Using the Planted Clique Conjecture for Cryptography: Public-Key Encryption from Planted Clique and Noisy k-LIN over Expanders. - Riddhi Ghosal; Isaac M. Hair; Aayush Jain; Amit Sahai (STOC, 2025)