Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Dorogovtsev, S. N.
Goltsev, A. V.
Mendes, J. F. F.
and
Samukhin, A. N.
2003.
Spectra of complex networks.
Physical Review E,
Vol. 68,
Issue. 4,
Coja-Oghlan, Amin
Goerdt, Andreas
and
Lanka, André
2004.
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques.
Vol. 3122,
Issue. ,
p.
310.
Coja-Oghlan, Amin
Goerdt, Andreas
Lanka, André
and
Schädlich, Frank
2004.
Techniques from combinatorial approximation algorithms yield efficient algorithms for random2k-SAT.
Theoretical Computer Science,
Vol. 329,
Issue. 1-3,
p.
1.
Feige, Uriel
and
Ofek, Eran
2005.
Spectral techniques applied to sparse random graphs.
Random Structures & Algorithms,
Vol. 27,
Issue. 2,
p.
251.
Coja-Oghlan, Amin
Goerdt, Andreas
and
Lanka, André
2006.
Fourth IFIP International Conference on Theoretical Computer Science- TCS 2006.
Vol. 209,
Issue. ,
p.
271.
Corbo, Jacomo
Calvó-Armengol, Antoni
and
Parkes, David
2006.
A study of Nash equilibrium in contribution games for peer-to-peer networks.
ACM SIGOPS Operating Systems Review,
Vol. 40,
Issue. 3,
p.
61.
Khorunzhiy, Oleksiy
Kirsch, Werner
and
Müller, Peter
2006.
Lifshitz tails for spectra of Erdős–Rényi random graphs.
The Annals of Applied Probability,
Vol. 16,
Issue. 1,
Coja‐Oghlan, Amin
2006.
A spectral heuristic for bisecting random graphs.
Random Structures & Algorithms,
Vol. 29,
Issue. 3,
p.
351.
Restrepo, Juan G.
Ott, Edward
and
Hunt, Brian R.
2007.
Approximating the largest eigenvalue of network adjacency matrices.
Physical Review E,
Vol. 76,
Issue. 5,
COJA-OGHLAN, AMIN
2007.
On the Laplacian Eigenvalues of Gn,p.
Combinatorics, Probability and Computing,
Vol. 16,
Issue. 6,
p.
923.
Dorogovtsev, S. N.
Goltsev, A. V.
and
Mendes, J. F. F.
2008.
Critical phenomena in complex networks.
Reviews of Modern Physics,
Vol. 80,
Issue. 4,
p.
1275.
Vu, Van
2008.
Horizons of Combinatorics.
Vol. 17,
Issue. ,
p.
257.
Khorunzhiy, O.
2008.
On Connected Diagrams and Cumulants of Erdős-Rényi Matrix Models.
Communications in Mathematical Physics,
Vol. 282,
Issue. 1,
p.
209.
Ding, Xue
and
Jiang, Tiefeng
2010.
Spectral distributions of adjacency and Laplacian matrices of random graphs.
The Annals of Applied Probability,
Vol. 20,
Issue. 6,
Castellano, Claudio
and
Pastor-Satorras, Romualdo
2010.
Thresholds for Epidemic Spreading in Networks.
Physical Review Letters,
Vol. 105,
Issue. 21,
COJA-OGHLAN, AMIN
2010.
Graph Partitioning via Adaptive Spectral Techniques.
Combinatorics, Probability and Computing,
Vol. 19,
Issue. 2,
p.
227.
Coja-Oghlan, Amin
and
Lanka, André
2010.
Finding Planted Partitions in Random Graphs with General Degree Distributions.
SIAM Journal on Discrete Mathematics,
Vol. 23,
Issue. 4,
p.
1682.
ANDO, Tomonori
KABASHIMA, Yoshiyuki
TAKAHASHI, Hisanao
WATANABE, Osamu
and
YAMAMOTO, Masaki
2011.
Spectral Analysis of Random Sparse Matrices.
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences,
Vol. E94-A,
Issue. 6,
p.
1247.
Jacobs, David P.
and
Trevisan, Vilmar
2011.
Locating the Eigenvalues of Trees.
Linear Algebra and its Applications,
Vol. 434,
Issue. 1,
p.
81.
Löwe, Matthias
and
Vermet, Franck
2011.
The Hopfield Model on a Sparse Erdös-Renyi Graph.
Journal of Statistical Physics,
Vol. 143,
Issue. 1,
p.
205.