Decomposing Semi-complete Multigraphs and Directed Graphs into Paths of Length Two. - Ajit A. Diwan; Sai Sandeep (CALDAM, 2017)

On Petri Nets with Hierarchical Special Arcs. - S. Akshay 001; Supratik Chakraborty; Ankush Das; Vishal Jagannath; Sai Sandeep (CONCUR, 2017)

Constant approximation for k-median and k-means with outliers via iterative rounding. - Ravishankar Krishnaswamy; Shi Li 001; Sai Sandeep (STOC, 2018)

Minmax-Regret k-Sink Location on a Dynamic Tree Network with Uniform Capacities. - Mordecai J. Golin; Sai Sandeep (CoRR, 2018)

Minmax Regret for sink location on paths with general capacities. - Mordecai J. Golin; Sai Sandeep (CoRR, 2019)

Revisiting Alphabet Reduction in Dinur's PCP. - Venkatesan Guruswami; Jakub Oprsal; Sai Sandeep (Electron. Colloquium Comput. Complex., 2019)

Rainbow coloring hardness via low sensitivity polymorphisms. - Venkatesan Guruswami; Sai Sandeep (Electron. Colloquium Comput. Complex., 2019)

$d$-to-$1$ Hardness of Coloring $4$-colorable Graphs with $O(1)$ colors. - Venkatesan Guruswami; Sai Sandeep (Electron. Colloquium Comput. Complex., 2019)

Permutation Strikes Back: The Power of Recourse in Online Metric Matching. - Varun Gupta 004; Ravishankar Krishnaswamy; Sai Sandeep (APPROX-RANDOM, 2020)

d-To-1 Hardness of Coloring 3-Colorable Graphs with O(1) Colors. - Venkatesan Guruswami; Sai Sandeep (ICALP, 2020)

An Algorithmic Study of the Hypergraph Turán Problem. - Venkatesan Guruswami; Sai Sandeep (CoRR, 2020)

Approximate Hypergraph Vertex Cover and generalized Tuza's conjecture. - Venkatesan Guruswami; Sai Sandeep (Electron. Colloquium Comput. Complex., 2020)

Conditional Dichotomy of Boolean Ordered Promise CSPs. - Joshua Brakensiek; Venkatesan Guruswami; Sai Sandeep (Electron. Colloquium Comput. Complex., 2021)

Almost Optimal Inapproximability of Multidimensional Packing Problems. - Sai Sandeep (Electron. Colloquium Comput. Complex., 2021)

On the Hardness of Scheduling With Non-Uniform Communication Delays. - Sami Davies; Janardhan Kulkarni; Thomas Rothvoss; Sai Sandeep; Jakub Tarnawski; Yihao Zhang (SODA, 2022)

Minmax regret for sink location on dynamic flow paths with general capacities. - Mordecai J. Golin; Sai Sandeep (Discret. Appl. Math., 2022)

Look Before, Before You Leap: Online Vector Load Balancing with Few Reassignments. - Varun Gupta 004; Ravishankar Krishnaswamy; Sai Sandeep; Janani Sundaresan (ITCS, 2023)

Baby PIH: Parameterized Inapproximability of Min CSP. - Venkatesan Guruswami; Xuandi Ren; Sai Sandeep (Electron. Colloquium Comput. Complex., 2023)

New Directions in Inapproximability: Promise Constraint Satisfaction Problems and Beyond - Sai Sandeep (2023)

SDPs and Robust Satisfiability of Promise CSP. - Joshua Brakensiek; Venkatesan Guruswami; Sai Sandeep (Electron. Colloquium Comput. Complex., 2025)

Improved hardness of approximation for Geometric Bin Packing. - Arka Ray; Sai Sandeep (Inf. Process. Lett., 2025)