| 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 | 114 | 2018 |
| 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 | 31 | 2020 |
| Conditional dichotomy of boolean ordered promise csps J Brakensiek, V Guruswami, S Sandeep TheoretiCS 2, 2023 | 18 | 2023 |
| Almost optimal inapproximability of multidimensional packing problems S Sandeep 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 16 | 2022 |
| Permutation strikes back: The power of recourse in online metric matching V Gupta, R Krishnaswamy, S Sandeep arXiv preprint arXiv:1911.12778, 2019 | 16 | 2019 |
| SDPs and robust satisfiability of promise CSP J Brakensiek, V Guruswami, S Sandeep Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 609-622, 2023 | 8 | 2023 |
| Rainbow coloring hardness via low sensitivity polymorphisms V Guruswami, S Sandeep SIAM Journal on Discrete Mathematics 34 (1), 520-537, 2020 | 8 | 2020 |
| On petri nets with hierarchical special arcs S Akshay, S Chakraborty, A Das, V Jagannath, S Sandeep arXiv preprint arXiv:1707.01157, 2017 | 7 | 2017 |
| Conditional Dichotomy of Boolean Ordered Promise CSPs. TheoretiCS, 2 J Brakensiek, V Guruswami, S Sandeep arXiv preprint arXiv:2102.11854, 2023 | 5 | 2023 |
| Minmax-Regret -Sink Location on a Dynamic Tree Network with Uniform Capacities MJ Golin, S Sandeep arXiv preprint arXiv:1806.03814, 2018 | 4 | 2018 |
| Baby pih: Parameterized inapproximability of min csp V Guruswami, X Ren, S Sandeep arXiv preprint arXiv:2310.16344, 2023 | 3 | 2023 |
| Approximate Hypergraph Vertex Cover and generalized Tuza's conjecture V Guruswami, S Sandeep Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022 | 3 | 2022 |
| On the hardness of scheduling with non-uniform communication delays S Davies, J Kulkarni, T Rothvoss, S Sandeep, J Tarnawski, Y Zhang Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022 | 3 | 2022 |
| Revisiting Alphabet Reduction in Dinur’s PCP V Guruswami, J Opršal, S Sandeep Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2020 | 3 | 2020 |
| Rainbow coloring hardness via low sensitivity polymorphisms V Guruswami, S Sandeep Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2019 | 3 | 2019 |
| Look before, before you leap: Online vector load balancing with few reassignments V Gupta, R Krishnaswamy, S Sandeep, J Sundaresan 14th Innovations in Theoretical Computer Science Conference (ITCS 2023), 2023 | 1 | 2023 |
| An algorithmic study of the hypergraph turán problem V Guruswami, S Sandeep CoRR, abs/2008.07344, 2020 | 1 | 2020 |
| Improved Hardness of Approximation for Geometric Bin Packing A Ray, S Sandeep arXiv preprint arXiv:2301.09272, 2023 | | 2023 |
| Minmax regret for sink location on dynamic flow paths with general capacities M Golin, S Sandeep Discrete Applied Mathematics 315, 1-26, 2022 | | 2022 |
| Minmax Regret for sink location on paths with general capacities M Golin, S Sandeep arXiv preprint arXiv:1912.12447, 2019 | | 2019 |
Venkatesan GuruswamiUniversity of California, Berkeley在 berkeley.edu 的电子邮件经过验证
