Sai Sandeep

According to our database1, Sai Sandeep authored at least 20 papers between 2017 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Baby PIH: Parameterized Inapproximability of Min CSP.
Electron. Colloquium Comput. Complex., 2023

Improved Hardness of Approximation for Geometric Bin Packing.
CoRR, 2023

SDPs and Robust Satisfiability of Promise CSP.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Look Before, Before You Leap: Online Vector Load Balancing with Few Reassignments.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

2022
Minmax regret for sink location on dynamic flow paths with general capacities.
Discret. Appl. Math., 2022

On the Hardness of Scheduling With Non-Uniform Communication Delays.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021
Almost Optimal Inapproximability of Multidimensional Packing Problems.
Electron. Colloquium Comput. Complex., 2021

Conditional Dichotomy of Boolean Ordered Promise CSPs.
Electron. Colloquium Comput. Complex., 2021

2020
Rainbow Coloring Hardness via Low Sensitivity Polymorphisms.
SIAM J. Discret. Math., 2020

Approximate Hypergraph Vertex Cover and generalized Tuza's conjecture.
Electron. Colloquium Comput. Complex., 2020

An Algorithmic Study of the Hypergraph Turán Problem.
CoRR, 2020

d-To-1 Hardness of Coloring 3-Colorable Graphs with O(1) Colors.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Permutation Strikes Back: The Power of Recourse in Online Metric Matching.
Proceedings of the Approximation, 2020

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

Revisiting Alphabet Reduction in Dinur's PCP.
Electron. Colloquium Comput. Complex., 2019

Minmax Regret for sink location on paths with general capacities.
CoRR, 2019

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

Constant approximation for k-median and k-means with outliers via iterative rounding.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

2017
On Petri Nets with Hierarchical Special Arcs.
Proceedings of the 28th International Conference on Concurrency Theory, 2017

Decomposing Semi-complete Multigraphs and Directed Graphs into Paths of Length Two.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2017


  Loading...