Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Coja‐Oghlan, Amin
Moore, Cristopher
and
Sanwalani, Vishal
2006.
MAXk‐CUT and approximating the chromatic number of random graphs.
Random Structures & Algorithms,
Vol. 28,
Issue. 3,
p.
289.
Coja-Oghlan, Amin
and
Kuhtz, Lars
2006.
An improved algorithm for approximating the chromatic number of.
Information Processing Letters,
Vol. 99,
Issue. 6,
p.
234.
Coja-Oghlan, Amin
and
Behrisch, Michael
2006.
Informatik.
p.
49.
Chan, Yuk Hei
and
Lau, Lap Chi
2012.
On linear and semidefinite programming relaxations for hypergraph matching.
Mathematical Programming,
Vol. 135,
Issue. 1-2,
p.
123.
Banks, Jess
Kleinberg, Robert
and
Moore, Cristopher
2019.
The Lovász Theta Function for Random Regular Graphs and Community Detection in the Hard Regime.
SIAM Journal on Computing,
Vol. 48,
Issue. 3,
p.
1098.
Bachoc, Christine
Gundert, Anna
and
Passuello, Alberto
2019.
The theta number of simplicial complexes.
Israel Journal of Mathematics,
Vol. 232,
Issue. 1,
p.
443.
Porter, Alexandra
and
Wootters, Mary
2021.
Embedded Index Coding.
IEEE Transactions on Information Theory,
Vol. 67,
Issue. 3,
p.
1461.
Jones, Chris
Potechin, Aaron
Rajendran, Goutham
Tulsiani, Madhur
and
Xu, Jeff
2022.
Sum-of-Squares Lower Bounds for Sparse Independent Set.
p.
406.
Conneryd, Jonas
De Rezende, Susanna F.
Nordström, Jakob
Pang, Shuo
and
Risse, Kilian
2023.
Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz.
p.
1.
Ahmadi, Amir Ali
and
Dibek, Cemil
2023.
A Sum of Squares Characterization of Perfect Graphs.
SIAM Journal on Applied Algebra and Geometry,
Vol. 7,
Issue. 4,
p.
685.
Sason, Igal
2024.
Observations on graph invariants with the Lovász $ \vartheta $-function.
AIMS Mathematics,
Vol. 9,
Issue. 6,
p.
15385.
Kothari, Pravesh K.
Potechin, Aaron
and
Xu, Jeff
2024.
Sum-of-Squares Lower Bounds for Independent Set on Ultra-Sparse Random Graphs.
p.
1923.