F. R. Chung, M. R. Garey, and R. E. Tarjan, Strongly connected orientations of mixed multigraphs, Networks, vol.3, issue.4, pp.477-484, 1985.
DOI : 10.1002/net.3230150409

V. Chvátal and C. Thomassen, Distances in orientations of graphs, Journal of Combinatorial Theory, Series B, vol.24, issue.1, pp.61-75, 1978.
DOI : 10.1016/0095-8956(78)90078-3

P. Dankelmann, The diameter of directed graphs, Journal of Combinatorial Theory, Series B, vol.94, issue.1, pp.183-186, 2005.
DOI : 10.1016/j.jctb.2004.11.005

P. Dankelmann, H. C. Swart, and D. P. Day, On strong distances in oriented graphs, Discrete Mathematics, vol.266, issue.1-3, pp.195-201, 2003.
DOI : 10.1016/S0012-365X(02)00807-5

P. Dankelmann, O. R. Oellermann, and J. Wu, Minimum average distance of strong orientations of graphs, Discrete Applied Mathematics, vol.143, issue.1-3, pp.204-212, 2004.
DOI : 10.1016/j.dam.2004.01.005

F. V. Fomin, M. Matamala, E. Prisner, and I. Rapaport, Bilateral Orientations and Domination, Proceedings of the Brazilian Symposiun on Graphs, 2001.
DOI : 10.1016/S1571-0653(04)00216-1

F. V. Fomin, M. Matamala, and I. Rapaport, The complexity of approximating the oriented diameter of chordal graphs. (extended abstract) Graph-theoretic concepts in computer science, 2002.

F. V. Fomin, M. Matamala, E. Prisner, and I. Rapaport, AT-free graphs: linear bounds for the oriented diameter, Discrete Applied Mathematics, vol.141, issue.1-3, pp.1-3135, 2004.
DOI : 10.1016/S0166-218X(03)00376-7

F. V. Fomin, M. Matamala, and I. Rapaport, Complexity of approximating the oriented diameter of chordal graphs, Journal of Graph Theory, vol.1, issue.4, pp.255-269, 2004.
DOI : 10.1002/jgt.10160

K. M. Koh and K. L. Ng, The orientation number of two complete graphs with linkages, Discrete Mathematics, vol.295, issue.1-3, pp.91-106, 2005.
DOI : 10.1016/j.disc.2005.02.010

K. M. Koh and B. P. Tan, The diameter of an orientation of a complete multipartite graph, Discrete Mathematics, vol.149, issue.1-3, pp.131-139, 1996.
DOI : 10.1016/0012-365X(94)00315-A

K. M. Koh and B. P. Tan, The minimum diameter of orientations of complete multipartite graphs, Graphs and Combinatorics, vol.36, issue.4, pp.333-339, 1996.
DOI : 10.1007/BF01858466

K. M. Koh and E. G. Tay, Optimal orientations of products of paths and cycles, Discrete Applied Mathematics, vol.78, issue.1-3, pp.163-174, 1997.
DOI : 10.1016/S0166-218X(97)00017-6

K. M. Koh and E. G. Tay, On optimal orientations of cartesian products with a bipartite graph, Discrete Applied Mathematics, vol.98, issue.1-2, pp.103-120, 1999.
DOI : 10.1016/S0166-218X(99)00110-9

K. M. Koh and E. G. Tay, On optimal orientations of cartesian products of graphs (ii): complete graphs and even cycles, Discrete Mathematics, vol.211, issue.1-3, pp.75-102, 2000.
DOI : 10.1016/S0012-365X(99)00136-3

K. M. Koh and E. G. Tay, On optimal orientations of G vertex-multiplications, Discrete Mathematics, vol.219, issue.1-3, pp.153-171, 2000.
DOI : 10.1016/S0012-365X(99)00373-8

K. M. Koh and E. G. Tay, On a conjecture concerning optimal orientations of the cartesian product of a triangle and an odd cycle, Discrete Mathematics, vol.232, issue.1-3, pp.153-161, 2001.
DOI : 10.1016/S0012-365X(00)00346-0

K. M. Koh and E. G. Tay, On optimal orientations of tree vertex-multiplications, Australas. J. Comb, vol.34, pp.69-87, 2006.

J. König, D. W. Krumme, and E. Lazard, Diameter-preserving orientations of the torus, Networks, vol.32, issue.1, pp.1-11, 1998.

J. E. Mccanna, Orientations of the n-cube with minimum diameter, Discrete Mathematics, vol.68, issue.2-3, pp.309-310, 1988.
DOI : 10.1016/0012-365X(88)90123-9

J. Plesník, Remarks on diameters of orientations of graphs, Acta Math. Univ. Comenian, vol.4647, pp.225-236, 1985.

J. Plesník, On minimal graphs of diameter 2 with every edge in a 3-cycle, Math. Slovaca, vol.36, pp.145-149, 1986.

H. E. Robbins, A Theorem on Graphs, with an Application to a Problem of Traffic Control, The American Mathematical Monthly, vol.46, issue.5, pp.281-283, 1939.
DOI : 10.2307/2303897