1. Birmele E, Ferreira RA, Grossi R, Marino A, Pisanti N, Rizzi R, Sacomoto G (2013) Optimal listing of cycles and st-paths in undirected graphs. SODA 2013:1884–1896
2. Ferreira RA, Grossi R, Rizzi R (2011) Output-sensitive listing of bounded-size trees in undirected graphs. ESA 2011:275–286
3. Shioura A, Tamura A, Uno T (1997) An optimal algorithm for scanning all spanning trees of undirected graphs. SIAM J Comput 26:678–692
4. Uno T (1998) New approach for speeding up enumeration algorithms. LNCS 1533:287–296
5. Uno T (1999) A new approach for speeding up enumeration algorithms and its application for matroid bases. LNCS 1627:349–359