E. Morsy (D3), H. Nagamochi,
Approximating the generalized capacitated tree-routing,
The 14th Annual International Computing and Combinatorics Conference (COCOON 2008) June 27 -29, 2008, Dalian, China,
Xiaodong Hu and Jie Wang (Eds.), Lecture Notes in Computer Science, vol. 5092, pp. 621-630.
T. Imamichi (D3), H. Nagamochi,
A fast collision detection algorithm for a multi-sphere scheme,
2008 Korea-Japan Joint Workshop on Algorithms and Computation (WAAC2008),
Fukuoka, Japan, July 19-20, 2008.
T. Imamichi (D3), Y. Arahori, J. Gim, S.-H. Hong, H. Nagamochi,
Removing node overlaps using multi-sphere scheme,
The 16th International Symposium on Graph Drawing 2008 (GD2008),
Heraklion, Crete, Greece, September 21-24, 2008,
Ioannis G. Tollis, Maurizio Patrignani (Eds.), Lecture Notes in Computer Science, vol. 5417, pp. 296-301.
J. Wang (D2), L. Zhao, H. Nagamochi, T. Akutsu.
Enumerating Colored and Rooted Outerplanar Graphs with Degree Constraints.
Kyoto RIMS Workshop on Acceleration and Visualization of Computation for Enumeration Problems (KAVCEP),
Kyoto University, Japan, September 29-30, 2008.
M. Sasaki(M2), L. Zhao, H. Nagamochi,
Security-Aware Beacon Based Network Monitoring,
The Eleventh IEEE International Conference on Communications Systems (ICCS 2008),
November 19 - 21, 2008, Guangzhou, China.
Y. Ishida (M1), L. Zhao, H. Nagamochi, T. Akutsu,
Improved Algorithms for Enumerating Tree-Like Chemical Graphs with Given Path Frequency,
19th International Conference on Genome Informatics (GIW2008), Gold Coast, Australia, December 1-3, 2008,
Genome Informatics, vol. 21, pp. 53-64.
S. Karakawa, E. Morsy (D3), H. Nagamochi,
Minmax tree cover in the Euclidean space,
Third Annual Workshop on Algorithms and Computation (WALCOM 2009), February 18-20, Indian Statistical Institute, Kolkata, India,
LNCS 5431, pp. 202-213.