Über Hamiltonizität in einer Klasse spezieller Graphen. - Vu Dinh Hoa (J. Inf. Process. Cybern., 1992)

On the Length of Maximal Dominating Cycle in 2-Connected Graphs. - Vu Dinh Hoa (J. Inf. Process. Cybern., 1994)

A sharp lower bound for the circumference of 1-tough graphs with large degree sums. - Vu Dinh Hoa (J. Graph Theory, 1995)

Long cycles and neighborhood union in 1-tough graphs with large degree sums. - Vu Dinh Hoa (Discuss. Math. Graph Theory, 1998)

Spanning cubic graph designs. - Peter Adams 001; Hayri Ardal; Ján Manuch; Vu Dinh Hoa; Moshe Rosenfeld 001; Ladislav Stacho (Discret. Math., 2009)

Convergence Analysis of the New Hybrid Genetic Algorithm for the Job Shop Scheduling Problem. - Nguyen Huu Mui; Vu Dinh Hoa; Luc Tri Tuyen (ISSPIT, 2012)

A parallel genetic algorithm for the job shop scheduling problem. - Nguyen Huu Mui; Vu Dinh Hoa; Luc Tri Tuyen (ISSPIT, 2012)

Cubic factorizations. - Moshe Rosenfeld 001; Vu Dinh Hoa (Discret. Math., 2013)

A new labeling of C2n proves that K4 + M6n decomposes K6n+4. - Vu Dinh Hoa; Moshe Rosenfeld 001 (Ars Comb., 2018)