Sai Sandeep

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