The following publications are possibly variants of this publication:
- Finding Cheapest Cycles in Vertex-weighted Quasi-transitive and Extended Semicomplete DigraphsJørgen Bang-Jensen, Gregory Gutin, Anders Yeo. acid 2005: 81-94
- Finding complementary cycles in locally semicomplete digraphsJørgen Bang-Jensen, Morten Hegner Nielsen. DAM, 146(3):245-256, 2005. [doi]
- Linkages in locally semicomplete digraphs and quasi-transitive digraphsJørgen Bang-Jensen. DM, 196(1-3):13-27, 1999. [doi]
- Vertex heaviest paths and cycles in quasi-transitive digraphsJørgen Bang-Jensen, Gregory Gutin. DM, 163(1-3):217-223, 1997. [doi]
- Polynomial algorithms for finding paths and cycles in quasi-transitive digraphsGregory Gutin. ajc, 10:231-236, 1994. [doi]
- Minimum cost homomorphisms to locally semicomplete digraphs and quasi-transitive digraphsArvind Gupta, Gregory Gutin, Mehdi Karimi, Eun Jung Kim 0002, Arash Rafiey. ajc, 46:217-232, 2010. [doi]
- A Polynomial Time Algorithm for Finding a Cycle Covering a Given Set of Vertices in a Semicomplete Multipartite DigraphAnders Yeo. jal, 33(1):124-139, 1999.
- Steiner type problems for digraphs that are locally semicomplete or extended semicompleteJørgen Bang-Jensen, Gregory Gutin, Anders Yeo. jgt, 44(3):193-207, 2003. [doi]
- Minimum cycle factors in quasi-transitive digraphsJørgen Bang-Jensen, Morten Hegner Nielsen. disopt, 5(1):121-137, 2008. [doi]
- Quasi-hamiltonian paths in semicomplete multipartite digraphsJørgen Bang-Jensen, Alessandro Maddaloni, Sven Simonsen. DAM, 161(7-8):889-898, 2013. [doi]