Sai Sandeep

Publication Activity (10 Years)

Years Active: 2017-2024
Publications (10 Years): 37

Top Topics

Approximation Algorithms

Top Venues

Electron. Colloquium Comput. Complex.

Publications

Venkatesan Guruswami, Xuandi Ren, Sai Sandeep
Baby PIH: Parameterized Inapproximability of Min CSP. CCC (2024)
Venkatesan Guruswami, Xuandi Ren, Sai Sandeep
Baby PIH: Parameterized Inapproximability of Min CSP. Electron. Colloquium Comput. Complex. (2023)
Varun Gupta, Ravishankar Krishnaswamy, Sai Sandeep, Janani Sundaresan
Look Before, Before You Leap: Online Vector Load Balancing with Few Reassignments. ITCS (2023)
Joshua Brakensiek, Venkatesan Guruswami, Sai Sandeep
SDPs and Robust Satisfiability of Promise CSP. STOC (2023)
Arka Ray, Sai Sandeep
Improved Hardness of Approximation for Geometric Bin Packing. CoRR (2023)
Joshua Brakensiek, Venkatesan Guruswami, Sai Sandeep
Conditional Dichotomy of Boolean Ordered Promise CSPs. TheoretiCS 2 (2023)
Venkatesan Guruswami, Xuandi Ren, Sai Sandeep
Baby PIH: Parameterized Inapproximability of Min CSP. CoRR (2023)
Mordecai J. Golin, Sai Sandeep
Minmax regret for sink location on dynamic flow paths with general capacities. Discret. Appl. Math. 315 (2022)
Venkatesan Guruswami, Sai Sandeep
Approximate Hypergraph Vertex Cover and generalized Tuza's conjecture. SODA (2022)
Sami Davies, Janardhan Kulkarni, Thomas Rothvoss, Sai Sandeep, Jakub Tarnawski, Yihao Zhang
On the Hardness of Scheduling With Non-Uniform Communication Delays. SODA (2022)
Sai Sandeep
Almost Optimal Inapproximability of Multidimensional Packing Problems. FOCS (2022)
Joshua Brakensiek, Venkatesan Guruswami, Sai Sandeep
SDPs and Robust Satisfiability of Promise CSP. CoRR (2022)
Sai Sandeep
Almost Optimal Inapproximability of Multidimensional Packing Problems. Electron. Colloquium Comput. Complex. 28 (2021)
Sai Sandeep
Almost Optimal Inapproximability of Multidimensional Packing Problems. FOCS (2021)
Sami Davies, Janardhan Kulkarni, Thomas Rothvoss, Sai Sandeep, Jakub Tarnawski, Yihao Zhang
On the Hardness of Scheduling With Non-Uniform Communication Delays. CoRR (2021)
Joshua Brakensiek, Venkatesan Guruswami, Sai Sandeep
Conditional Dichotomy of Boolean Ordered Promise CSPs. CoRR (2021)
Joshua Brakensiek, Venkatesan Guruswami, Sai Sandeep
Conditional Dichotomy of Boolean Ordered Promise CSPs. Electron. Colloquium Comput. Complex. 28 (2021)
Joshua Brakensiek, Venkatesan Guruswami, Sai Sandeep
Conditional Dichotomy of Boolean Ordered Promise CSPs. ICALP (2021)
Sai Sandeep
Almost Optimal Inapproximability of Multidimensional Packing Problems. CoRR (2021)
Venkatesan Guruswami, Sai Sandeep
d-To-1 Hardness of Coloring 3-Colorable Graphs with O(1) Colors. ICALP (2020)
Venkatesan Guruswami, Sai Sandeep
Rainbow Coloring Hardness via Low Sensitivity Polymorphisms. SIAM J. Discret. Math. 34 (1) (2020)
Varun Gupta, Ravishankar Krishnaswamy, Sai Sandeep
Permutation Strikes Back: The Power of Recourse in Online Metric Matching. APPROX-RANDOM (2020)
Venkatesan Guruswami, Jakub Oprsal, Sai Sandeep
Revisiting Alphabet Reduction in Dinur's PCP. APPROX-RANDOM (2020)
Venkatesan Guruswami, Sai Sandeep
Approximate Hypergraph Vertex Cover and generalized Tuza's conjecture. Electron. Colloquium Comput. Complex. 27 (2020)
Venkatesan Guruswami, Sai Sandeep
An Algorithmic Study of the Hypergraph Turán Problem. CoRR (2020)
Varun Gupta, Ravishankar Krishnaswamy, Sai Sandeep
PERMUTATION Strikes Back: The Power of Recourse in Online Metric Matching. CoRR (2019)
Venkatesan Guruswami, Sai Sandeep
$d$-to-$1$ Hardness of Coloring $4$-colorable Graphs with $O(1)$ colors. Electron. Colloquium Comput. Complex. 26 (2019)
Venkatesan Guruswami, Sai Sandeep
Rainbow coloring hardness via low sensitivity polymorphisms. Electron. Colloquium Comput. Complex. 26 (2019)
Mordecai J. Golin, Sai Sandeep
Minmax Regret for sink location on paths with general capacities. CoRR (2019)
Venkatesan Guruswami, Sai Sandeep
Rainbow Coloring Hardness via Low Sensitivity Polymorphisms. APPROX-RANDOM (2019)
Venkatesan Guruswami, Jakub Oprsal, Sai Sandeep
Revisiting Alphabet Reduction in Dinur's PCP. Electron. Colloquium Comput. Complex. 26 (2019)
Ravishankar Krishnaswamy, Shi Li, Sai Sandeep
Constant approximation for k-median and k-means with outliers via iterative rounding. STOC (2018)
Mordecai J. Golin, Sai Sandeep
Minmax-Regret k-Sink Location on a Dynamic Tree Network with Uniform Capacities. CoRR (2018)
S. Akshay, Supratik Chakraborty, Ankush Das, Vishal Jagannath, Sai Sandeep
On Petri Nets with Hierarchical Special Arcs. CoRR (2017)
Ravishankar Krishnaswamy, Shi Li, Sai Sandeep
Constant Approximation for k-Median and k-Means with Outliers via Iterative Rounding. CoRR (2017)
Ajit A. Diwan, Sai Sandeep
Decomposing Semi-complete Multigraphs and Directed Graphs into Paths of Length Two. CALDAM (2017)
S. Akshay, Supratik Chakraborty, Ankush Das, Vishal Jagannath, Sai Sandeep
On Petri Nets with Hierarchical Special Arcs. CONCUR (2017)