| 2026 | SODA | Weighted k-Server Admits an Exponentially Competitive Algorithm. | Adithya Bijoy, Ankit Mondal, Ashish Chiplunkar |
| 2023 | SODA | Online Min-Max Paging. | Ashish Chiplunkar, Monika Henzinger, Sagar Sudhir Kale, Maximilian Vtsch |
| 2022 | FOCS | Factorial Lower Bounds for (Almost) Random Order Streams. | Ashish Chiplunkar, John Kallaugher, Michael Kapralov, Eric Price |
| 2021 | ESA | The Randomized Competitive Ratio of Weighted k-Server Is at Least Exponential. | Nikhil Ayyadevara, Ashish Chiplunkar |
| 2020 | ESA | Set Cover with Delay - Clairvoyance Is Not Required. | Yossi Azar, Ashish Chiplunkar, Shay Kutten, Noam Touitou |
| 2020 | ICML | How to Solve Fair k-Center in Massive Data Models. | Ashish Chiplunkar, Sagar Sudhir Kale, Sivaramakrishnan Natarajan Ramamoorthy |
| 2018 | FOCS | Testing Graph Clusterability: Algorithms and Lower Bounds. | Ashish Chiplunkar, Michael Kapralov, Sanjeev Khanna, Aida Mousavifar, Yuval Peres |
| 2017 | SODA | Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays. | Yossi Azar, Ashish Chiplunkar, Haim Kaplan |
| 2015 | COMSNETS | Approximating deployment costs for (wireless) multi-hop networks. | Vijay Gabale, Ashish Chiplunkar |
| 2015 | ESA | On Randomized Algorithms for Matching in the Online Preemptive Model. | Ashish Chiplunkar, Sumedh Tirodkar, Sundar Vishwanathan |
| 2013 | COCOON | Metrical Service Systems with Multiple Servers. | Ashish Chiplunkar, Sundar Vishwanathan |
| 2013 | FOCS | On Randomized Memoryless Algorithms for the Weighted K-Server Problem. | Ashish Chiplunkar, Sundar Vishwanathan |
| 2012 | ICDCIT | Nash Equilibrium in Weighted Concurrent Timed Games with Reachability Objectives. | Shankara Narayanan Krishna, Lakshmi Manasa, Ashish Chiplunkar |
| 2011 | COMSNETS | DelayCheck: Scheduling voice over multi-hop multi-channel wireless mesh networks. | Vijay Gabale, Ashish Chiplunkar, Bhaskaran Raman, Partha Dutta |