Model Checking Logic WCTL with Multi Constrained Modalities on One Clock Priced Timed Automata. - Ashish Chiplunkar; Shankara Narayanan Krishna; Chinmay Jain (FORMATS, 2009)

DelayCheck: Scheduling voice over multi-hop multi-channel wireless mesh networks. - Vijay Gabale; Ashish Chiplunkar; Bhaskaran Raman; Partha Dutta (COMSNETS, 2011)

Nash Equilibrium in Weighted Concurrent Timed Games with Reachability Objectives. - Shankara Narayanan Krishna; Lakshmi Manasa; Ashish Chiplunkar (ICDCIT, 2012)

On Randomized Memoryless Algorithms for the Weighted K-Server Problem. - Ashish Chiplunkar; Sundar Vishwanathan (FOCS, 2013)

On the Competitiveness of Randomized Memoryless Algorithms for the Weighted $k$-server Problem - Ashish Chiplunkar; Sundar Vishwanathan (CoRR, 2013)

Approximating deployment costs for (wireless) multi-hop networks. - Vijay Gabale; Ashish Chiplunkar (COMSNETS, 2015)

On Randomized Algorithms for Matching in the Online Preemptive Model. - Ashish Chiplunkar; Sumedh Tirodkar; Sundar Vishwanathan (ESA, 2015)

Approximating the Regular Graphic TSP in Near Linear Time. - Ashish Chiplunkar; Sundar Vishwanathan (FSTTCS, 2015)

Metrical Service Systems with Multiple Servers. - Ashish Chiplunkar; Sundar Vishwanathan (Algorithmica, 2015)

Polylogarithmic Bounds on the Competitiveness of Min-cost (Bipartite) Perfect Matching with Delays. - Yossi Azar; Ashish Chiplunkar; Haim Kaplan (CoRR, 2016)

Min-Cost Bipartite Perfect Matching with Delays. - Itai Ashlagi; Yossi Azar; Moses Charikar; Ashish Chiplunkar; Ofir Geri; Haim Kaplan; Rahul Makhijani; Yuyi Wang 001; Roger Wattenhofer (APPROX-RANDOM, 2017)

Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays. - Yossi Azar; Ashish Chiplunkar; Haim Kaplan (SODA, 2017)

Testing Graph Clusterability: Algorithms and Lower Bounds. - Ashish Chiplunkar; Michael Kapralov; Sanjeev Khanna; Aida Mousavifar; Yuval Peres (FOCS, 2018)

Prophet Secretary: Surpassing the 1-1/e Barrier. - Yossi Azar; Ashish Chiplunkar; Haim Kaplan (EC, 2018)

Set Cover and Vertex Cover with Delay. - Yossi Azar; Ashish Chiplunkar; Shay Kutten; Noam Touitou (CoRR, 2018)

Set Cover with Delay - Clairvoyance Is Not Required. - Yossi Azar; Ashish Chiplunkar; Shay Kutten; Noam Touitou (ESA, 2020)

How to Solve Fair k-Center in Massive Data Models. - Ashish Chiplunkar; Sagar Sudhir Kale; Sivaramakrishnan Natarajan Ramamoorthy (ICML, 2020)

Randomized Memoryless Algorithms for the Weighted and the Generalized k-server Problems. - Ashish Chiplunkar; Sundar Vishwanathan (ACM Trans. Algorithms, 2020)

The Randomized Competitive Ratio of Weighted k-Server Is at Least Exponential. - Nikhil Ayyadevara; Ashish Chiplunkar (ESA, 2021)

Approximating Local Graph Structure in Almost Random Order Streams. - Ashish Chiplunkar; John Kallaugher; Michael Kapralov; Eric Price 001 (CoRR, 2021)

Factorial Lower Bounds for (Almost) Random Order Streams. - Ashish Chiplunkar; John Kallaugher; Michael Kapralov; Eric Price 001 (FOCS, 2022)

Prophet Inequality: Order selection beats random order. - Archit Bubna; Ashish Chiplunkar (EC, 2023)

Online Min-Max Paging. - Ashish Chiplunkar; Monika Henzinger; Sagar Sudhir Kale; Maximilian Vötsch (SODA, 2023)

A Decomposition Approach to the Weighted k-Server Problem. - Nikhil Ayyadevara; Ashish Chiplunkar; Amatya Sharma (FSTTCS, 2024)

A Decomposition Approach to the Weighted k-server Problem. - Nikhil Ayyadevara; Ashish Chiplunkar; Amatya Sharma (CoRR, 2024)

Trading Prophets: How to Trade Multiple Stocks Optimally. - Surbhi Rajput; Ashish Chiplunkar; Rohit Vaish (SOSA, 2025)

Weighted k-Server Admits an Exponentially Competitive Algorithm. - Adithya Bijoy; Ankit Mondal; Ashish Chiplunkar (CoRR, 2025)