@inproceedings{Uno1996, 
     address = "Osaka, Japan", 
     author = "Uno, Takeaki", 
     booktitle = "ISAAC 1996: the 7th International Symposium on Algorithms and Computation", 
     doi = "10.1007/BFb0009492", 
     editor = "Asano, Tetsuo and Igarashi, Yoshihide and Nagamochi, Hiroshi and Miyano, Satoru and Suri, Subhash", 
     keyword = "directed spanning tree,enumerating algorithm,listing", 
     link = "http://link.springer.com/chapter/10.1007/BFb0009492", 
     month = "dec", 
     pages = "166--173", 
     publisher = "Springer Berlin Heidelberg", 
     series = "Lecture Notes in Computer Science", 
     title = "An algorithm for enumerating all directed spanning trees in a directed graph", 
     uri = "http://link.springer.com/chapter/10.1007/BFb0009492", 
     volume = "1178", 
     year = "1996", 
}

Problems: 115