Sai Sandeep

According to our database, Sai Sandeep authored at least 21 papers between 2017 and 2025.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2025

Improved hardness of approximation for Geometric Bin Packing.

Arka Ray, Sai Sandeep

Inf. Process. Lett., 2025

2024

Baby PIH: Parameterized Inapproximability of Min CSP.

Venkatesan Guruswami, Xuandi Ren, Sai Sandeep

Proceedings of the 39th Computational Complexity Conference, 2024

2023

New Directions in Inapproximability: Promise Constraint Satisfaction Problems and Beyond

Sai Sandeep

PhD thesis, 2023

SDPs and Robust Satisfiability of Promise CSP.

Joshua Brakensiek, Venkatesan Guruswami, Sai Sandeep

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Look Before, Before You Leap: Online Vector Load Balancing with Few Reassignments.

Varun Gupta, Ravishankar Krishnaswamy, Sai Sandeep, Janani Sundaresan

Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

2022

Minmax regret for sink location on dynamic flow paths with general capacities.

Mordecai J. Golin, Sai Sandeep

Discret. Appl. Math., 2022

Approximate Hypergraph Vertex Cover and generalized Tuza's conjecture.

Venkatesan Guruswami, Sai Sandeep

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

On the Hardness of Scheduling With Non-Uniform Communication Delays.

Sami Davies, Janardhan Kulkarni, Thomas Rothvoss, Sai Sandeep, Jakub Tarnawski, Yihao Zhang

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021

Conditional Dichotomy of Boolean Ordered Promise CSPs.

Joshua Brakensiek, Venkatesan Guruswami, Sai Sandeep

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Almost Optimal Inapproximability of Multidimensional Packing Problems.

Sai Sandeep

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020

An Algorithmic Study of the Hypergraph Turán Problem.

Venkatesan Guruswami, Sai Sandeep

CoRR, 2020

d-To-1 Hardness of Coloring 3-Colorable Graphs with O(1) Colors.

Venkatesan Guruswami, Sai Sandeep

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Revisiting Alphabet Reduction in Dinur's PCP.

Venkatesan Guruswami, Jakub Oprsal, Sai Sandeep

Proceedings of the Approximation, 2020

Permutation Strikes Back: The Power of Recourse in Online Metric Matching.

Varun Gupta, Ravishankar Krishnaswamy, Sai Sandeep

Proceedings of the Approximation, 2020

2019

$d$-to-$1$ Hardness of Coloring $4$-colorable Graphs with $O(1)$ colors.

Venkatesan Guruswami, Sai Sandeep

Electron. Colloquium Comput. Complex., 2019

Minmax Regret for sink location on paths with general capacities.

Mordecai J. Golin, Sai Sandeep

CoRR, 2019

Rainbow Coloring Hardness via Low Sensitivity Polymorphisms.

Venkatesan Guruswami, Sai Sandeep

Proceedings of the Approximation, 2019

2018

Minmax-Regret k-Sink Location on a Dynamic Tree Network with Uniform Capacities.

Mordecai J. Golin, Sai Sandeep

CoRR, 2018

Constant approximation for k-median and k-means with outliers via iterative rounding.

Ravishankar Krishnaswamy, Shi Li, Sai Sandeep

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

2017

On Petri Nets with Hierarchical Special Arcs.

S. Akshay, Supratik Chakraborty, Ankush Das, Vishal Jagannath, Sai Sandeep

Proceedings of the 28th International Conference on Concurrency Theory, 2017

Decomposing Semi-complete Multigraphs and Directed Graphs into Paths of Length Two.

Ajit A. Diwan, Sai Sandeep

Proceedings of the Algorithms and Discrete Applied Mathematics, 2017