Stable Manipulation in Voting. - Aditya Anand 001; Palash Dey (CoRR, 2019)

Split: Inferring Unobserved Event Probabilities for Disentangling Brand-Customer Interactions. - Ayush Chauhan; Aditya Anand 001; Shaddy Garg; Sunny Dhamnani; Shiv Kumar Saini (CoRR, 2020)

A Polynomial Kernel for Deletion to Ptolemaic Graphs. - Akanksha Agrawal 001; Aditya Anand 001; Saket Saurabh 001 (IPEC, 2021)

Distance restricted manipulation in voting. - Aditya Anand 001; Palash Dey (Theor. Comput. Sci., 2021)

Separating k -sc Median from the Supplier Version. - Aditya Anand 001; Euiwoong Lee (IPCO, 2024)

Approximating Small Sparse Cuts. - Aditya Anand 001; Euiwoong Lee; Jason Li 006; Thatchaphol Saranurak (STOC, 2024)

Separating k-Median from the Supplier Version. - Aditya Anand 001; Euiwoong Lee (CoRR, 2024)

All-Subsets Important Separators with Applications to Sample Sets, Balanced Separators and Vertex Sparsifiers in Directed Graphs. - Aditya Anand 001; Euiwoong Lee; Jason Li 006; Thatchaphol Saranurak (ICALP, 2025)

Unbreakable Decomposition in Close-to-Linear Time. - Aditya Anand 001; Euiwoong Lee; Jason Li 006; Yaowei Long; Thatchaphol Saranurak (SODA, 2025)

Min-CSPs on Complete Instances. - Aditya Anand 001; Euiwoong Lee; Amatya Sharma (SODA, 2025)

Deterministic Edge Connectivity and Max Flow using Subquadratic Cut Queries. - Aditya Anand 001; Thatchaphol Saranurak; Yunfan Wang (SODA, 2025)

Min-CSPs on Complete Instances II: Polylogarithmic Approximation for Min-NAE-3-SAT. - Aditya Anand 001; Euiwoong Lee; Davide Mazzali; Amatya Sharma (CoRR, 2025)