J. Abello, P. M. Pardalos, and M. G. Resende, External Memory Algorithms, On Maximum Clique Problems in Very Large Graphs, pp.119-130, 1999.

D. Ajwani, Design, Implementation and Experimental Study of External Memory BFS Algorithms, 2005.

J. Alber, F. Dorn, and R. Niedermeier, Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs, Discrete Applied Mathematics, vol.145, issue.2, pp.219-231, 2004.
DOI : 10.1016/j.dam.2004.01.013

E. Angel, R. Campigotto, and C. Laforest, Analysis and Comparison of Three Algorithms for the Vertex Cover Problem on Large Graphs with Low Memory Capacities, Algorithmic Operations Research, vol.6, issue.1, pp.56-67, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00653634

E. Asgeirsson and C. Stein, Vertex Cover Approximations on Random Graphs, 6th Workshop on Experimental Algorithms, pp.285-296, 2007.
DOI : 10.1007/978-3-540-72845-0_22

R. Bar-yehuda, D. Hermelin, and D. Rawitz, Minimum Vertex Cover in Rectangle Graphs, 18th Annual European Conference on Algorithms, pp.255-266, 2010.

I. M. Bomze, M. Budinich, P. M. Pardalos, and M. Pedillo, Handbook of Combinatorial Optimization, chap. The Maximum Clique Problem, pp.1-74, 1999.

N. G. De-bruijn, A Combinatorial Problem, Koninklijke Nederlandse Akademie v. Wetenschappen, vol.49, pp.758-764, 1946.

F. Delbot and C. Laforest, A better list heuristic for vertex cover, Information Processing Letters, vol.107, issue.3-4, pp.125-127, 2008.
DOI : 10.1016/j.ipl.2008.02.004
URL : https://hal.archives-ouvertes.fr/hal-00341369

F. Delbot and C. Laforest, Analytical and experimental comparison of six algorithms for the vertex cover problem, Journal of Experimental Algorithmics, vol.15, 2010.
DOI : 10.1145/1671970.1865971

B. Escoffier, L. Gourvès, and J. Monnot, Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs, Journal of Discrete Algorithms, vol.8, issue.1, pp.36-49, 2010.
DOI : 10.1016/j.jda.2009.01.005
URL : https://hal.archives-ouvertes.fr/hal-00178912

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979.

S. Gilmour and M. Dras, Kernelization as Heuristic Structure for the Vertex Cover Problem, 5th International Workshop on Ant Colony Optimization and Swarm Intelligence, pp.452-459, 2006.
DOI : 10.1007/11839088_45

M. Molloy and B. Reed, A Critical Point for Random Graphs With a Given Degree Sequence. Random Structures and Algorithms pp, pp.161-179, 1995.

S. Pirzada and A. Dharwadker, Applications of graph theory, PAMM, vol.92, issue.1, pp.19-38, 2007.
DOI : 10.1002/pamm.200700981

L. Pitt, A Simple Probabilistic Approximation Algorithm for Vertex Cover, 1985.

F. Vigier and M. Latapy, Random Generation of Large Connected Simple Graphs with Prescribed Degree Distribution, 11th International Conference on Computing and Combinatorics, 2005.

J. S. Vitter, Algorithms and Data Structures for External Memory, Foundations and Trends?? in Theoretical Computer Science, vol.2, issue.4, 2009.
DOI : 10.1561/0400000014

E. W. Weisstein, Butterfly graph