1. ANANTHARAM, V. and SALEZ, J. (2016). The densest subgraph problem in sparse random graphs. Ann. Appl. Probab. 26 305–327.
2. BARAK, B., CHOU, C.-N., LEI, Z., SCHRAMM, T. and SHENG, Y. (2019). (Nearly) efficient algorithms for the graph matching problem on correlated random graphs. In Advances in Neural Information Processing Systems 32. Curran Associates, Inc., Red Hook.
3. BERG, A., BERG, T. and MALIK, J. (2005). Shape matching and object recognition using low distortion correspondences. In 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR’05) 1 26–33.
4. BOZORG, M., SALEHKALEYBAR, S. and HASHEMI, M. (2019). Seedless graph matching via tail of degree distribution for correlated Erdős–Rényi graphs. Preprint. Available at arXiv:1907.06334.
5. CAIN, J. A., SANDERS, P. and WORMALD, N. (2007). The random graph threshold for k-orientability and a fast algorithm for optimal multiple-choice allocation. In Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms 469–476. ACM, New York, NY, USA.