1. K.V. Aadithya, B. Ravindran, T. Michalak, N. Jennings, Efficient computation of the Shapley value for centrality in networks, in Internet and Network Economics. Volume 6484 of Lecture Notes in Computer Science (Springer, Berlin/Heidelberg, 2010), pp. 1–13
2. E. Abbe, C. Sandon, Recovering communities in the general stochastic block model without knowing the parameters. CoRR, abs/1506.03729 (2015)
3. P.K. Agarwal, S. Har-Peled, K.R. Varadarajan, Geometric approximation via coresets, in Combinatorial and Computational Geometry, MSRI (Cambridge University Press, Cambridge, 2005), pp. 1–30
4. E.M. Airoldi, T.B. Costa, S.H. Chan, Stochastic blockmodel approximation of a graphon: theory and consistent estimation, in 27th Annual Conference on Neural Information Processing Systems 2013 (2013), pp. 692–700
5. N. Alon, V. Asodi, C. Cantor, S. Kasif, J. Rachlin, Multi-node graphs: a framework for multiplexed biological assays. J. Comput. Biol. 13(10), 1659–1672 (2006)