Smaller Low-Depth Circuits for Kronecker Powers. - Josh Alman; Yunfeng Guan 002; Ashwin Padaki (SODA, 2023)

Inapproximability of Maximum Diameter Clustering for Few Clusters. - Henry L. Fleischmann; Kyrylo Karlov; Karthik C. S. 001; Ashwin Padaki; Stepan Zharkov (SODA, 2025)

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness. - Sanjeev Khanna; Ashwin Padaki; Erik Waingarten (CoRR, 2025)