Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Giesen, Joachim
and
Mitsche, Dieter
2005.
Fundamentals of Computation Theory.
Vol. 3623,
Issue. ,
p.
433.
Giesen, Joachim
and
Mitsche, Dieter
2005.
Graph-Theoretic Concepts in Computer Science.
Vol. 3787,
Issue. ,
p.
409.
Giesen, Joachim
and
Mitsche, Dieter
2005.
Algorithms and Computation.
Vol. 3827,
Issue. ,
p.
473.
Coja‐Oghlan, Amin
2006.
A spectral heuristic for bisecting random graphs.
Random Structures & Algorithms,
Vol. 29,
Issue. 3,
p.
351.
COJA-OGHLAN, AMIN
2010.
Graph Partitioning via Adaptive Spectral Techniques.
Combinatorics, Probability and Computing,
Vol. 19,
Issue. 2,
p.
227.
Bollobás, Béla
and
Riordan, Oliver
2011.
Sparse graphs: Metrics and random models.
Random Structures & Algorithms,
Vol. 39,
Issue. 1,
p.
1.
Chen, Yudong
Sanghavi, Sujay
and
Xu, Huan
2014.
Improved Graph Clustering.
IEEE Transactions on Information Theory,
Vol. 60,
Issue. 10,
p.
6440.
Vinayak, Ramya Korlakai
Oymak, Samet
and
Hassibi, Babak
2014.
Sharp performance bounds for graph clustering via convex optimization.
p.
8297.
Fei, Yingjie
and
Chen, Yudong
2019.
Exponential Error Rates of SDP for Block Models: Beyond Grothendieck’s Inequality.
IEEE Transactions on Information Theory,
Vol. 65,
Issue. 1,
p.
551.
Fakcharoenphol, Jittat
and
Vajanopath, Phanu
2022.
MAX-CUT on Samplings of Dense Graphs.
p.
1.
Amini, Hamed
Chen, Yudong
Minca, Andreea
and
Qian, Xin
2024.
Clustering heterogeneous financial networks.
Mathematical Finance,
Vol. 34,
Issue. 2,
p.
425.