default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSai Sandeep
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c14]Venkatesan Guruswami, Xuandi Ren, Sai Sandeep:
Baby PIH: Parameterized Inapproximability of Min CSP. CCC 2024: 27:1-27:17- 2023
- [j3]Joshua Brakensiek, Venkatesan Guruswami, Sai Sandeep:
Conditional Dichotomy of Boolean Ordered Promise CSPs. TheoretiCS 2 (2023) - [c13]Varun Gupta, Ravishankar Krishnaswamy, Sai Sandeep, Janani Sundaresan:
Look Before, Before You Leap: Online Vector Load Balancing with Few Reassignments. ITCS 2023: 65:1-65:17 - [c12]Joshua Brakensiek, Venkatesan Guruswami, Sai Sandeep:
SDPs and Robust Satisfiability of Promise CSP. STOC 2023: 609-622 - [i19]Arka Ray, Sai Sandeep:
Improved Hardness of Approximation for Geometric Bin Packing. CoRR abs/2301.09272 (2023) - [i18]Venkatesan Guruswami, Xuandi Ren, Sai Sandeep:
Baby PIH: Parameterized Inapproximability of Min CSP. CoRR abs/2310.16344 (2023) - [i17]Venkatesan Guruswami, Xuandi Ren, Sai Sandeep:
Baby PIH: Parameterized Inapproximability of Min CSP. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j2]Mordecai J. Golin
, Sai Sandeep:
Minmax regret for sink location on dynamic flow paths with general capacities. Discret. Appl. Math. 315: 1-26 (2022) - [c11]Sami Davies, Janardhan Kulkarni, Thomas Rothvoss, Sai Sandeep, Jakub Tarnawski, Yihao Zhang:
On the Hardness of Scheduling With Non-Uniform Communication Delays. SODA 2022: 316-328 - [c10]Venkatesan Guruswami, Sai Sandeep:
Approximate Hypergraph Vertex Cover and generalized Tuza's conjecture. SODA 2022: 927-944 - [i16]Joshua Brakensiek, Venkatesan Guruswami, Sai Sandeep:
SDPs and Robust Satisfiability of Promise CSP. CoRR abs/2211.08373 (2022) - 2021
- [c9]Sai Sandeep:
Almost Optimal Inapproximability of Multidimensional Packing Problems. FOCS 2021: 245-256 - [c8]Joshua Brakensiek, Venkatesan Guruswami, Sai Sandeep:
Conditional Dichotomy of Boolean Ordered Promise CSPs. ICALP 2021: 37:1-37:15 - [i15]Sai Sandeep:
Almost Optimal Inapproximability of Multidimensional Packing Problems. CoRR abs/2101.02854 (2021) - [i14]Joshua Brakensiek, Venkatesan Guruswami, Sai Sandeep:
Conditional Dichotomy of Boolean Ordered Promise CSPs. CoRR abs/2102.11854 (2021) - [i13]Sami Davies, Janardhan Kulkarni, Thomas Rothvoss, Sai Sandeep, Jakub Tarnawski, Yihao Zhang:
On the Hardness of Scheduling With Non-Uniform Communication Delays. CoRR abs/2105.00111 (2021) - [i12]Joshua Brakensiek, Venkatesan Guruswami, Sai Sandeep:
Conditional Dichotomy of Boolean Ordered Promise CSPs. Electron. Colloquium Comput. Complex. TR21 (2021) - [i11]Sai Sandeep:
Almost Optimal Inapproximability of Multidimensional Packing Problems. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j1]Venkatesan Guruswami, Sai Sandeep:
Rainbow Coloring Hardness via Low Sensitivity Polymorphisms. SIAM J. Discret. Math. 34(1): 520-537 (2020) - [c7]Venkatesan Guruswami, Jakub Oprsal, Sai Sandeep:
Revisiting Alphabet Reduction in Dinur's PCP. APPROX-RANDOM 2020: 34:1-34:14 - [c6]Varun Gupta, Ravishankar Krishnaswamy, Sai Sandeep:
Permutation Strikes Back: The Power of Recourse in Online Metric Matching. APPROX-RANDOM 2020: 40:1-40:20 - [c5]Venkatesan Guruswami, Sai Sandeep:
d-To-1 Hardness of Coloring 3-Colorable Graphs with O(1) Colors. ICALP 2020: 62:1-62:12 - [i10]Venkatesan Guruswami, Sai Sandeep:
An Algorithmic Study of the Hypergraph Turán Problem. CoRR abs/2008.07344 (2020) - [i9]Venkatesan Guruswami, Sai Sandeep:
Approximate Hypergraph Vertex Cover and generalized Tuza's conjecture. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [c4]Venkatesan Guruswami, Sai Sandeep:
Rainbow Coloring Hardness via Low Sensitivity Polymorphisms. APPROX-RANDOM 2019: 15:1-15:17 - [i8]Varun Gupta, Ravishankar Krishnaswamy, Sai Sandeep:
PERMUTATION Strikes Back: The Power of Recourse in Online Metric Matching. CoRR abs/1911.12778 (2019) - [i7]Mordecai J. Golin, Sai Sandeep:
Minmax Regret for sink location on paths with general capacities. CoRR abs/1912.12447 (2019) - [i6]Venkatesan Guruswami, Jakub Oprsal, Sai Sandeep:
Revisiting Alphabet Reduction in Dinur's PCP. Electron. Colloquium Comput. Complex. TR19 (2019) - [i5]Venkatesan Guruswami, Sai Sandeep:
Rainbow coloring hardness via low sensitivity polymorphisms. Electron. Colloquium Comput. Complex. TR19 (2019) - [i4]Venkatesan Guruswami, Sai Sandeep:
$d$-to-$1$ Hardness of Coloring $4$-colorable Graphs with $O(1)$ colors. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [c3]Ravishankar Krishnaswamy, Shi Li, Sai Sandeep:
Constant approximation for k-median and k-means with outliers via iterative rounding. STOC 2018: 646-659 - [i3]Mordecai J. Golin, Sai Sandeep:
Minmax-Regret k-Sink Location on a Dynamic Tree Network with Uniform Capacities. CoRR abs/1806.03814 (2018) - 2017
- [c2]Ajit A. Diwan, Sai Sandeep:
Decomposing Semi-complete Multigraphs and Directed Graphs into Paths of Length Two. CALDAM 2017: 166-176 - [c1]S. Akshay, Supratik Chakraborty, Ankush Das, Vishal Jagannath, Sai Sandeep:
On Petri Nets with Hierarchical Special Arcs. CONCUR 2017: 40:1-40:17 - [i2]S. Akshay, Supratik Chakraborty, Ankush Das, Vishal Jagannath, Sai Sandeep:
On Petri Nets with Hierarchical Special Arcs. CoRR abs/1707.01157 (2017) - [i1]Ravishankar Krishnaswamy, Shi Li, Sai Sandeep:
Constant Approximation for k-Median and k-Means with Outliers via Iterative Rounding. CoRR abs/1711.01323 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-16 19:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
