E. Birmelé, P. Crescenzi, R. A. Ferreira, R. Grossi, V. Lacroix et al., Efficient bubble enumeration in directed graphs, Proc. SPIRE 2012, pp.118-129, 2012.

E. Birmelé, R. A. Ferreira, R. Grossi, A. Marino, N. Pisanti et al., Optimal listing of cycles and st-paths in undirected graphs, Proc. SODA 2013, pp.1884-1896, 2013.

T. Eilam-tzoreff, The disjoint shortest paths problem, Discrete Applied Mathematics, vol.85, issue.2, pp.113-138, 1998.

D. Eppstein, k-best enumeration, Encyclopedia of Algorithms, pp.1003-1006, 2016.

S. Fortune, J. Hopcroft, and J. Wyllie, The directed subgraph homeomorphism problem, Theoretical Computer Science, vol.10, issue.2, pp.111-121, 1980.

A. V. Goldberg and S. Rao, Beyond the flow decomposition barrier, Journal of the ACM (JACM), vol.45, issue.5, pp.783-797, 1998.

D. B. Johnson, Finding all the elementary circuits of a directed graph, SIAM J. Comput, vol.4, issue.1, pp.77-84, 1975.

D. B. Johnson, Efficient algorithms for shortest paths in sparse networks, J. ACM, vol.24, issue.1, pp.1-13, 1977.

R. M. Karp, On the computational complexity of combinatorial problems, Networks, vol.5, issue.1, pp.45-68, 1975.

K. Kawarabayashi, Y. Kobayashi, and B. Reed, The disjoint paths problem in quadratic time, Journal of Combinatorial Theory, Series B, vol.102, issue.2, pp.424-435, 2012.

C. Li, S. T. Mccormick, and D. Simchi-levi, The complexity of finding two disjoint paths with min-max objective function, Discrete Applied Mathematics, vol.26, issue.1, pp.105-115, 1990.

K. Menger, Zur allgemeinen kurventheorie, Fundamenta Mathematicae, vol.10, issue.1, pp.96-115, 1927.

R. C. Read and R. E. Tarjan, Bounds on backtrack algorithms for listing cycles, paths, and spanning trees, Networks, vol.5, issue.3, pp.237-252, 1975.

R. Rizzi, G. Sacomoto, and M. Sagot, Efficiently listing bounded length st-paths, Proc.IWOCA 2014, pp.318-329, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01091924

G. Sacomoto, V. Lacroix, and M. Sagot, A polynomial delay algorithm for the enumeration of bubbles with length constraints in directed graphs and its application to the detection of alternative splicing in rna-seq data, Proc. WABI, pp.99-111, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00842982

A. Schrijver, Combinatorial optimization: polyhedra and efficiency, 2003.

R. Tarjan, Enumeration of the elementary circuits of a directed graph, SIAM J. on Comput, vol.2, issue.3, pp.211-216, 1973.

J. C. Tiernan, An efficient search algorithm to find the elementary circuits of a graph, Communications ACM, vol.13, pp.722-726, 1970.