Sai Sandeep
Sai Sandeep
Student at CMU
Verified email at andrew.cmu.edu
Title
Cited by
Cited by
Year
Constant approximation for k-median and k-means with outliers via iterative rounding
R Krishnaswamy, S Li, S Sandeep
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
482018
Rainbow coloring hardness via low sensitivity polymorphisms
V Guruswami, S Sandeep
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2019
42019
Minmax-Regret -Sink Location on a Dynamic Tree Network with Uniform Capacities
MJ Golin, S Sandeep
arXiv preprint arXiv:1806.03814, 2018
42018
On petri nets with hierarchical special arcs
S Akshay, S Chakraborty, A Das, V Jagannath, S Sandeep
arXiv preprint arXiv:1707.01157, 2017
42017
Rainbow coloring hardness via low sensitivity polymorphisms
V Guruswami, S Sandeep
SIAM Journal on Discrete Mathematics 34 (1), 520-537, 2020
22020
PERMUTATION Strikes Back: The Power of Recourse in Online Metric Matching
V Gupta, R Krishnaswamy, S Sandeep
arXiv preprint arXiv:1911.12778, 2019
22019
d-To-1 Hardness of Coloring 3-Colorable Graphs with O (1) Colors
V Guruswami, S Sandeep
47th International Colloquium on Automata, Languages, and Programming (ICALP …, 2020
12020
An Algorithmic Study of the Hypergraph Tur\'{a} n Problem
V Guruswami, S Sandeep
arXiv preprint arXiv:2008.07344, 2020
2020
Revisiting alphabet reduction in Dinur’s PCP.
V Guruswami, J Opršal, S Sandeep
Schloss Dagstuhl, 2020
2020
Minmax Regret for sink location on paths with general capacities
M Golin, S Sandeep
arXiv preprint arXiv:1912.12447, 2019
2019
LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS, LIPICS
V Guruswami, S Sandeep, D Fotakis, J Matuschke, O Papadigenopoulos, ...
2019
Decomposing Semi-complete Multigraphs and Directed Graphs into Paths of Length Two
AA Diwan, S Sandeep
Conference on Algorithms and Discrete Applied Mathematics, 166-176, 2017
2017
The system can't perform the operation now. Try again later.
Articles 1–12