1. Abu-Khzam, F.N., Collins, R.L., Fellows, M.R., Langston, M.A., Suters, W.H., Symons, C.T.: Kernelization algorithms for the vertex cover problem: Theory and experiments. In: Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, New Orleans, LA, USA, pp. 62–69. SIAM, Philadelphia (2004)
2. Barabási, A.-L.: Emergence of scaling in complex networks. In: Handbook of graphs and networks, pp. 69–84. Wiley-VCH, Weinheim (2003)
3. Barabási, A.-L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)
4. Bollobás, B., Riordan, O., Spencer, J., Tusnády, G.: The degree sequence of a scale-free random graph process. Random Structures Algorithms 18(3), 279–290 (2001)
5. Buss, J.F., Goldsmith, J.: Nondeterminism within p. SIAM J. Computing 22, 560–572 (1993)