1. An algorithm for finding Hamiltonian paths and cycles in random graphs;Bollobas;Combinatorica,1987
2. Spanning trees with many or few colors in edge-colored graphs;Broersma;Discussiones Mathematicae Graph Theory,1997
3. R. D. Carr, S. Doddi, G. Konjedov, M. Marathe, On the red-blue set cover problem. In Proc. 11th ACN-SIAM Symposium on Discrete Algorithms, 345-353, 2000 [ISBN: 0-89871-453-2]
4. R. Cerulli, A. Fink, M. Gentili, S. Voß, Applications of the pilot method and VNS to hard modifications of the minimum spanning tree problem. Presented at the Mini Euro Conference on VNS, Tenerife, 2005
5. Metaheuristics comparison for the minimum labelling spanning tree problem;Cerulli,2005