Minimal Steiner Tree Problem - Math bibliographies - in Harvard style

In-text: (Dijkstra, 1959)

Your Bibliography: Dijkstra, E., 1959. A note on two problems in connexion with graphs. Numer. Math., 1(1), pp.269-271.

In-text: (Garey and Johnson, 1977)

Your Bibliography: Garey, M. and Johnson, D., 1977. The Rectilinear Steiner Tree Problem is $NP$-Complete. SIAM J. Appl. Math., 32(4), pp.826-834.

In-text: (Garey, Graham and Johnson, 1977)

Your Bibliography: Garey, M., Graham, R. and Johnson, D., 1977. The Complexity of Computing Steiner Minimal Trees. SIAM J. Appl. Math., 32(4), pp.835-859.

In-text: (Hwang, 1986)

Your Bibliography: Hwang, F., 1986. A linear time algorithm for full steiner trees. Operations Research Letters, 4(5), pp.235-237.

In-text: (Tarau, 2015)

Your Bibliography: Tarau, P., 2015. Djikstra algoritmo pseudokodas. [online] Department of Computer Science and Engineering at the University of North Texas. Available at: <http://www.cse.unt.edu/~tarau/teaching/AnAlgo/Dijkstra's%20algorithm.pdf> [Accessed 22 February 2015].

In-text: (Warme, Winter and Zachariasen, 2015)

Your Bibliography: Warme, D., Winter, P. and Zachariasen, M., 2015. GeoSteiner Homepage. [online] Diku.dk. Available at: <http://www.diku.dk/~martinz/geosteiner/> [Accessed 20 February 2015].