M. Shimizu (M2), H. Nagamochi, T. Akutsu
Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies,
The 22nd International Conference on Genome Informatics (GIW2011), Haeundae Grand Hotel, Busan, Korea, December 5-7, 2011, BMC Bioinformatics 2011, 12 (Suppl 14): S3
- K. Sejima (D3), T. Fukunaga, H. Nagamochi,
Algorithms for Covering Digraphs by Length-Bounded Paths,
The 7th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications (HJ2011), Kyoto University, Japan, May 31-June 3, 2011.