研究成果 > 学生による発表(国際会議・シンポジウム)
2009年度
緑色の氏名は発表者.
- J. Wang (D3), J. Gim (M2), M. Sasaki, L. Zhao, H. Nagamochi,
Efficient Approximation Algorithms for Beacon Placement Problem and Its Dual Problem,
Korea-Japan Joint Workshop on Algorithms and Computation (WAAC), Seoul, Korea, July 4-5, 2009. - J. Wang (D3), J. Gim (M2), M. Sasaki, L. Zhao, H. Nagamochi,
Efficient Approximation Algorithms for Beacon Placement Problem and Its Dual Problem,
International Conference on Computational Intelligence and Software Engineering (CiSE), Wuhan, China, December 11-13, 2009. -
T. Imada (M1), S. Ota, H. Nagamochi, T. Akutsu,
Enumerating stereoisomers of tree structured molecules using dynamic programming,
The 20th International Symposium on Algorithms and Computation (ISAAC 2009),
December 16-18, 2009, in Hawaii, USA, LNCS 5878, pp. 14-23. -
J. Wang (D3), H. Nagamochi,
Enumeration Algorithms for Colored and Rooted Outerplanar Graphs,
GCOE workshop, Hongkong, China, March 13-14, 2010. -
K. Sejima(D1), T. Fukunaga, H. Nagamochi,
Path Partition Problem for Node-Weighted Transitive Acyclic Digraphs,
Joint Workshop of Hong Kong and Kyoto on Computer Science and Algorithms 2010,
City University of Hong Kong, Hong Kong, China, March 13-14, 2010. -
P. Eumthurapojn (D1), L. Zhao, H. Nagamochi,
A general A* algorithm framework for the time-dependent shortest path problem,
Joint Workshop of Hong Kong and Kyoto on Computer Science and Algorithms 2010,
City University of Hong Kong, Hong Kong, China, March 13-14, 2010.