Citation: J. Bang-jensen et A. Yeo, The minimum spanning strong subdigraph problem for extended semicomplete digraphs and semicomplete bipartite digraphs, J ALGORITHM, 41(1), 2001, pp. 1-19
Citation: J. Bang-jensen et T. Jordan, Splitting off edges within a specified subset preserving the edge-connectivity of the graph, J ALGORITHM, 37(2), 2000, pp. 326-343
Citation: J. Bang-jensen et G. Gutin, On the complexity of hamiltonian path and cycle problems in certain classes of digraphs, DISCR APP M, 95(1-3), 1999, pp. 41-60