On the public citation graph

Reductions between Expansion Problems

https://doi.org/10.1109/ccc.2012.43
0 signed · 101 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.1007/978-3-642-32512-0_2openalex-snapshot
Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems
inferredcites →https://doi.org/10.1007/bf00532234openalex-snapshot
Geometric bounds on the Ornstein-Uhlenbeck velocity process
inferredcites →https://doi.org/10.1007/bf01200757openalex-snapshot
The geometry of graphs and some of its algorithmic applications
inferredcites →https://doi.org/10.1007/bf02579166openalex-snapshot
Eigenvalues and expanders
inferredcites →https://doi.org/10.1007/s004930200018openalex-snapshot
Improved Bounds for Acyclic Job Shop Scheduling
inferredcites →https://doi.org/10.1016/0095-8956(85)90092-9openalex-snapshot
λ1, Isoperimetric inequalities for graphs, and superconcentrators
inferredcites →https://doi.org/10.1016/j.jcss.2007.06.019openalex-snapshot
Vertex cover might be hard to approximate to within 2−ε
inferredcites →https://doi.org/10.1109/ccc.2002.1004334openalex-snapshot
On the power of unique 2-prover 1-round games
inferredcites →https://doi.org/10.1109/focs.2007.34openalex-snapshot
One-Way Multi-Party Communication Lower Bound for Pointer Jumping with Applications
inferredcites →https://doi.org/10.1109/focs.2007.35openalex-snapshot
Integrality gaps of 2 - o(1) for Vertex Cover SDPs in the Lovész-Schrijver Hierarchy
inferredcites →https://doi.org/10.1109/focs.2009.37openalex-snapshot
SDP Integrality Gaps with Local ell_1-Embeddability
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/focs.2010.59openalex-snapshot
Subexponential Algorithms for Unique Games and Related Problems
inferredcites →https://doi.org/10.1109/focs.2011.79openalex-snapshot
Min-max Graph Partitioning and Small Set Expansion
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/080721479openalex-snapshot
Integrality Gaps of $2-o(1)$ for Vertex Cover SDPs in the Lovász–Schrijver Hierarchy
inferredcites →https://doi.org/10.1137/s0097539705447372openalex-snapshot
Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
inferredcites →https://doi.org/10.1137/s0097539794285983openalex-snapshot
An O (log k ) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
inferredcites →https://doi.org/10.1145/1007352.1007355openalex-snapshot
Expander flows, geometric embeddings and graph partitioning
inferredcites →https://doi.org/10.1145/1132516.1132594openalex-snapshot
Integrality gaps for sparsest cut and minimum linear arrangement problems
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/1374376.1374415openalex-snapshot
Optimal hierarchical decompositions for congestion minimization in networks
inferredcites →https://doi.org/10.1145/1806689.1806776openalex-snapshot
Approximations for the isoperimetric and spectral profile of graphs and related parameters
inferredcites →https://doi.org/10.1145/1806689.1806792openalex-snapshot
Graph expansion and the unique games conjecture
inferredcites →https://doi.org/10.1145/2775105openalex-snapshot
Subexponential Algorithms for Unique Games and Related Problems
inferredcites →https://doi.org/10.1145/331524.331526openalex-snapshot
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
inferredcites →https://doi.org/10.1145/509907.510017openalex-snapshot
On the power of unique 2-prover 1-round games
inferredcites →https://doi.org/10.1515/9781400869312-013openalex-snapshot
A Lower Bound for the Smallest Eigenvalue of the Laplacian
inferredcites →https://doi.org/10.48550/arxiv.1110.4319openalex-snapshot
Min-Max Graph Partitioning and Small Set Expansion

What points at this work

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

inferred← citeshttps://doi.org/10.1002/rsa.20877openalex-snapshot
A periodic isoperimetric problem related to the unique games conjecture
inferred← citeshttps://doi.org/10.1007/978-3-030-64843-5_18openalex-snapshot
The Small Set Vertex Expansion Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-92702-8_4openalex-snapshot
Tight Inapproximability of Minimum Maximal Matching on Bipartite Graphs and Related Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-71682-4_7openalex-snapshot
Working Together: Committee Selection and the Supermodular Degree
inferred← citeshttps://doi.org/10.1007/978-3-642-32512-0_2openalex-snapshot
Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-32512-0_27openalex-snapshot
Approximation Guarantees for the Minimum Linear Arrangement Problem by Higher Eigenvalues
inferred← citeshttps://doi.org/10.1007/978-3-642-32512-0_52openalex-snapshot
Finding Small Sparse Cuts by Random Walk
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_83openalex-snapshot
Optimal Strong Parallel Repetition for Projection Games on Low Threshold Rank Graphs
inferred← citeshttps://doi.org/10.1007/s00220-019-03382-yopenalex-snapshot
Limitations of Semidefinite Programs for Separable States and Entangled Games
inferred← citeshttps://doi.org/10.1007/s00453-017-0291-7openalex-snapshot
Effect of Gromov-Hyperbolicity Parameter on Cuts and Expansions in Graphs and Some Algorithmic Implications
inferred← citeshttps://doi.org/10.1007/s00453-022-00983-3openalex-snapshot
$$\ell _p$$-Norm Multiway Cut
inferred← citeshttps://doi.org/10.1007/s00453-026-01404-5openalex-snapshot
Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number
inferred← citeshttps://doi.org/10.1007/s11128-014-0877-9openalex-snapshot
The commuting local Hamiltonian problem on locally expanding graphs is approximable in $$\mathsf{{NP}}$$ NP
inferred← citeshttps://doi.org/10.1016/j.ipm.2019.102172openalex-snapshot
Revealing the political affinity of online entities through their Twitter followers
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.07.006openalex-snapshot
Finding Cheeger cuts in hypergraphs via heat equation
inferred← citeshttps://doi.org/10.1109/bdcloud.2018.00173openalex-snapshot
Deriving the Political Affinity of Twitter Users from Their Followers
inferred← citeshttps://doi.org/10.1109/focs.2011.79openalex-snapshot
Min-max Graph Partitioning and Small Set Expansion
inferred← citeshttps://doi.org/10.1109/focs.2013.46openalex-snapshot
The Complexity of Approximating Vertex Expansion
inferred← citeshttps://doi.org/10.1109/focs.2016.65openalex-snapshot
Decidability of Non-interactive Simulation of Joint Distributions
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00069openalex-snapshot
Explicit Lower Bounds Against Ω(n)-Rounds of Sum-of-Squares
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00009openalex-snapshot
On Lifting Integrality Gaps to SSEH Hardness for Globally Constrained CSPs
inferred← citeshttps://doi.org/10.1137/080729256openalex-snapshot
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
inferred← citeshttps://doi.org/10.1137/1.9781611973402.91openalex-snapshot
Non-Uniform Graph Partitioning
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch105openalex-snapshot
Integrality Gaps and Approximation Algorithms for Dispersers and Bipartite Expanders
inferred← citeshttps://doi.org/10.1137/1.9781611974782.23openalex-snapshot
Parameterized Algorithms for Constraint Satisfaction Problems Above Average with Global Cardinality Constraints
inferred← citeshttps://doi.org/10.1137/1.9781611975482.104openalex-snapshot
Losing Treewidth by Separating Subsets
inferred← citeshttps://doi.org/10.1137/1.9781611975482.160openalex-snapshot
Cheeger Inequalities for Submodular Transformations
inferred← citeshttps://doi.org/10.1137/1.9781611976465.26openalex-snapshot
Approximation Algorithms and Hardness for Strong Unique Games
inferred← citeshttps://doi.org/10.1137/13093025xopenalex-snapshot
Constant Factor Lasserre Integrality Gaps for Graph Partitioning Problems
inferred← citeshttps://doi.org/10.1137/15m1047209openalex-snapshot
Partitioning Well-Clustered Graphs: Spectral Clustering Works!
inferred← citeshttps://doi.org/10.1145/1993806.1993854openalex-snapshot
Minimum congestion mapping in a cloud
inferred← citeshttps://doi.org/10.1145/2213977.2214013openalex-snapshot
Approximation algorithms for semi-random partitioning problems
inferred← citeshttps://doi.org/10.1145/2591796.2591841openalex-snapshot
Constant factor approximation for balanced cut in the PIE model
inferred← citeshttps://doi.org/10.1145/2591796.2591886openalex-snapshot
Rounding sum-of-squares relaxations
inferred← citeshttps://doi.org/10.1145/2775105openalex-snapshot
Subexponential Algorithms for Unique Games and Related Problems
inferred← citeshttps://doi.org/10.1145/2996799openalex-snapshot
Cheeger-Type Approximation for Sparsest st -Cut
inferred← citeshttps://doi.org/10.1145/3055399.3055412openalex-snapshot
Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph
inferred← citeshttps://doi.org/10.1145/3178123openalex-snapshot
Spectral Properties of Hypergraph Laplacian and Approximation Algorithms
inferred← citeshttps://doi.org/10.1145/3228342openalex-snapshot
Approximation Guarantees for the Minimum Linear Arrangement Problem by Higher Eigenvalues
inferred← citeshttps://doi.org/10.1145/3406325.3451099openalex-snapshot
Playing unique games on certified small-set expanders
inferred← citeshttps://doi.org/10.1145/3501304openalex-snapshot
Quasipolynomial Multicut-mimicking Networks and Kernels for Multiway Cut Problems
inferred← citeshttps://doi.org/10.1145/3519935.3520072openalex-snapshot
A characterization of approximability for biased CSPs
inferred← citeshttps://doi.org/10.1145/3522588openalex-snapshot
Network Design for s - t Effective Resistance
inferred← citeshttps://doi.org/10.1145/3618260.3649747openalex-snapshot
Approximating Small Sparse Cuts
inferred← citeshttps://doi.org/10.1145/3798129.3800755openalex-snapshot
A Sharp Characterization of Pessiland
inferred← citeshttps://doi.org/10.1145/3802807.3802814openalex-snapshot
The QMA(2) UniverseComplexity, Entanglement, and Optimization
inferred← citeshttps://doi.org/10.1184/r1/6605654openalex-snapshot
Finding almost-perfect graph bisections
inferred← citeshttps://doi.org/10.1201/9781420010749-23openalex-snapshot
Hardness of Approximation
inferred← citeshttps://doi.org/10.1287/ijoc.2015.0678openalex-snapshot
Approximation of the Quadratic Knapsack Problem
inferred← citeshttps://doi.org/10.14778/3291264.3291273openalex-snapshot
Chasing similarity
inferred← citeshttps://doi.org/10.1613/jair.4030openalex-snapshot
Inapproximability of Treewidth and Related Problems
inferred← citeshttps://doi.org/10.3390/a11010010openalex-snapshot
Inapproximability of Maximum Biclique Problems, Minimum k-Cut and Densest At-Least-k-Subgraph from the Small Set Expansion Hypothesis
inferred← citeshttps://doi.org/10.3390/a11110173openalex-snapshot
Inapproximability of Rank, Clique, Boolean, and Maximum Induced Matching-Widths under Small Set Expansion Hypothesis
inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2014.160openalex-snapshot
Constrained Monotone Function Maximization and the Supermodular Degree
inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2014.371openalex-snapshot
Computational Complexity of Certifying Restricted Isometry Property
inferred← citeshttps://doi.org/10.4230/oasics.sosa.2019.15openalex-snapshot
A Note on Max $k$-Vertex Cover: Faster FPT-AS, Smaller Approximate Kernel and Improved Approximation
inferred← citeshttps://doi.org/10.48550/arxiv.1304.3139openalex-snapshot
The Complexity of Approximating Vertex Expansion
inferred← citeshttps://doi.org/10.48550/arxiv.1306.4384openalex-snapshot
Approximation Algorithm for Sparsest k-Partitioning
inferred← citeshttps://doi.org/10.48550/arxiv.1311.7378openalex-snapshot
The commuting local Hamiltonian on locally-expanding graphs is in NP
inferred← citeshttps://doi.org/10.48550/arxiv.1404.5236openalex-snapshot
Sum-of-squares proofs and the quest toward optimal algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1406.5665openalex-snapshot
Constant Factor Approximation for Balanced Cut in the PIE model
inferred← citeshttps://doi.org/10.48550/arxiv.1410.3889openalex-snapshot
Cheeger-type approximation for sparsest $st$-cut
inferred← citeshttps://doi.org/10.48550/arxiv.1507.05950openalex-snapshot
On the Worst-Case Approximability of Sparse PCA
inferred← citeshttps://doi.org/10.48550/arxiv.1702.06969openalex-snapshot
Approximating Unique Games Using Low Diameter Graph Decomposition
inferred← citeshttps://doi.org/10.48550/arxiv.1807.06101openalex-snapshot
A PTAS for $\ell_p$-Low Rank Approximation
inferred← citeshttps://doi.org/10.48550/arxiv.1810.00511openalex-snapshot
Chasing Similarity: Distribution-aware Aggregation Scheduling (Extended Version)
inferred← citeshttps://doi.org/10.48550/arxiv.1903.07870openalex-snapshot
How Hard Is Robust Mean Estimation?
inferred← citeshttps://doi.org/10.48550/arxiv.1912.06983openalex-snapshot
Bisect and Conquer: Hierarchical Clustering via Max-Uncut Bisection
inferred← citeshttps://doi.org/10.48550/arxiv.2103.08743openalex-snapshot
Strong Parallel Repetition for Unique Games on Small Set Expanders
inferred← citeshttps://doi.org/10.5555/2634074.2634165openalex-snapshot
Non-uniform graph partitioning
inferred← citeshttps://doi.org/10.5555/3091125.3091368openalex-snapshot
Working Together: Committee Selection and the Supermodular Degree
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.