Selected papers that cite this one
- David S. Johnson. The NP-completeness column: An ongoing guide. Journal of Algorithms, 2(4):393-405, December 1981.
- Alberto O. Mendelzon and Peter T. Wood. Finding regular simple paths in graph databases. SIAM Journal on Computing, 24(6):1235-1258, December 1995.
- B. Mishra. Bidirectional edges problem: Part I -- a simple algorithm. Algorithmica, 15(3):256-286, March 1996.
- S. Natarajan and A. P. Sprague. Disjoint Paths in Circular Arc Graphs Nordic Journal of Computing, 3(3):256-270, Fall 1996.