On the public citation graph

Spectral Algorithms for Unique Games

0 signed · 30 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/rsa.20089openalex-snapshot
Spectral techniques applied to sparse random graphs
inferredcites →https://doi.org/10.1007/s00037-006-0210-9openalex-snapshot
ON THE HARDNESS OF APPROXIMATING MULTICUT AND SPARSEST-CUT
inferredcites →https://doi.org/10.1109/ccc.2003.1214437openalex-snapshot
Vertex cover might be hard to approximate to within 2-ε
inferredcites →https://doi.org/10.1109/focs.2004.49openalex-snapshot
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs?
inferredcites →https://doi.org/10.1109/focs.2006.36openalex-snapshot
How to Play Unique Games Using Embeddings
inferredcites →https://doi.org/10.1109/focs.2007.41openalex-snapshot
Towards Sharp Inapproximability For Any 2-CSP
inferredcites →https://doi.org/10.1109/focs.2009.73openalex-snapshot
Integrality Gaps for Strong SDP Relaxations of UNIQUE GAMES
inferredcites →https://doi.org/10.1109/sfcs.2005.22openalex-snapshot
Approximation Algorithms for Unique Games
inferredcites →https://doi.org/10.1109/sfcs.2005.74openalex-snapshot
The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into \ell 1
inferredcites →https://doi.org/10.1137/0707001openalex-snapshot
The Rotation of Eigenvectors by a Perturbation. III
inferredcites →https://doi.org/10.1145/1109557.1109569openalex-snapshot
Approximating unique games
inferredcites →https://doi.org/10.1145/1132516.1132547openalex-snapshot
Near-optimal algorithms for unique games
inferredcites →https://doi.org/10.1145/1374376.1374380openalex-snapshot
Unique games on expanding constraint graphs are easy
inferredcites →https://doi.org/10.1145/1374376.1374414openalex-snapshot
Optimal algorithms and inapproximability results for every CSP?
inferredcites →https://doi.org/10.1145/509907.510017openalex-snapshot
On the power of unique 2-prover 1-round games

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_29openalex-snapshot
Universal Factor Graphs
inferred← citeshttps://doi.org/10.1109/ccc.2010.19openalex-snapshot
On the Unique Games Conjecture (Invited Survey)
inferred← citeshttps://doi.org/10.1109/ccc.2012.11openalex-snapshot
A Strong Parallel Repetition Theorem for Projection Games on Expanders
inferred← citeshttps://doi.org/10.1109/focs.2010.59openalex-snapshot
Subexponential Algorithms for Unique Games and Related Problems
inferred← citeshttps://doi.org/10.1109/focs.2011.36openalex-snapshot
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Graph Partitioning and Quadratic Integer Programming with PSD Objectives
inferred← citeshttps://doi.org/10.1109/focs.2011.78openalex-snapshot
How to Play Unique Games Against a Semi-random Adversary: Study of Semi-random Models of Unique Games
inferred← citeshttps://doi.org/10.1109/focs.2011.95openalex-snapshot
Rounding Semidefinite Programming Hierarchies via Global Correlation
inferred← citeshttps://doi.org/10.1109/focs.2012.83openalex-snapshot
Making the Long Code Shorter
inferred← citeshttps://doi.org/10.1145/2213977.2214005openalex-snapshot
A new point of NP-hardness for unique games
inferred← citeshttps://doi.org/10.1145/2554797.2554839openalex-snapshot
Multireference alignment using semidefinite programming
inferred← citeshttps://doi.org/10.1145/2775105openalex-snapshot
Subexponential Algorithms for Unique Games and Related Problems
inferred← citeshttps://doi.org/10.1145/3406325.3451099openalex-snapshot
Playing unique games on certified small-set expanders
inferred← citeshttps://doi.org/10.4086/cjtcs.2015.001openalex-snapshot
inferred← citeshttps://doi.org/10.5555/2627817.2627839openalex-snapshot
Approximating non-uniform sparsest cut via generalized spectra
inferred← citeshttps://doi.org/10.5555/2722129.2722214openalex-snapshot
Decomposing a graph into expanding subgraphs
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.