@article{CTT100421124,
  author = {TAKEAKI UNO},
  title = {A Linear Time Algorithm for Finding a k-Tree Core},
  journal = {Journal of Algorithms},
  year = 1997,
}

@article{CTT100421125,
  author = {TAKEAKI UNO},
  title = {An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs},
  journal = {SIAM Journal of Computing},
  year = 1997,
}

@article{CTT100421127,
  author = {TAKEAKI UNO},
  title = {Algorithms for Enumerating All Perfect, Maximum and Maximal Matchings in Bipartite Graphs},
  journal = {Lecture. Notes in Computer Science, Springer-Verlag},
  year = 1997,
}

@article{CTT100421126,
  author = {TAKEAKI UNO},
  title = {An Algorithm for Enumerating All Directed Spanning Trees in a Directed Graph},
  journal = {Lecture. Notes in Computer Science, Springer-Verlag},
  year = 1996,
}

@misc{CTT100594162,
  author = {TAKEAKI UNO},
  title = {Studies on Speeding up Enumeration Algorithms},
  year = 1998,
}



@phdthesis{CTT100594162,
  author = {TAKEAKI UNO},
  title = {Studies on Speeding up Enumeration Algorithms},
  school = {東京工業大学},
  year = 1998,
}