研究成果 > 学生による発表(国際会議・シンポジウム)
2002年度
緑色の氏名は発表者.
- T. Imamichi (M2), M. Kenmochi (M1), K. Nonobe, M. Yagiura, H. Nagamochi,
Branch-and-bound algorithms for rectangular strip packing and perfect packing problems,
ESICUP (EURO Special Interest Group on Cutting and Packing) 2nd Meeting,
Southampton, UK, April 14-16, 2005. -
T. Fukunaga (D1), H. Nagamochi,
Edge packing problem with edge capacity constraints,
4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications,
Renyi Institute, Budapest, Hungary, June 3-6, 2005, pp.69-75. -
K. Haraguchi (D3), H. Nagamochi, T. Ibaraki,
Compactness of Classifiers by Iterative Compositions of Features,
4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications,
Renyi Institute, Budapest, Hungary, June 3-6, 2005, pp.92-98. -
Y. Kamidoi, N. Yoshida, H. Nagamochi,
A Deterministic Algorithm for Finding All Minimum k-Way Cuts,
4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications,
Renyi Institute, Budapest, Hungary, June 3-6, 2005, pp.224-234. -
M. Sakashita (D1), K. Makino, S. Fujishige,
Laminar Covering Problem,
4th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications,
Renyi Institute, Budapest, Hungary, June 3-6, 2005, pp.296-302. -
M. Kenmochi (M1), T. Imamichi (M2), K. Nonobe, M. Yagiura and H. Nagamochi,
Exact Algorithms for the 2-Dimensional Strip Packing Problem with Rotations,
The Seventeenth Triennial Conference of the International Federation of Operational Research Societies (IFORS2005),
Hilton Hawaiian Village Beach Resort & Spa, Honolulu, Hawaii, July 11-15, 2005, p.36.
-
H. Nagamochi,
Heuristics for the Minmax Tree Cover in Graphs,
The Seventeenth Triennial Conference of the International Federation of Operational Research Societies (IFORS2005),
Hilton Hawaii Village Beach Resort & Spa, Honolulu, Hawaii, July 11-15, 2005, p.25. -
T. Fukunaga (D1), H. Nagamochi,
Approximation algorithms for the b-edge dominating set problem and its related problems,
the Eleventh International Computing and Combinatorics Conference (COCOON 2005),
Kunming, China, August 16-19, 2005. -
H. Hashimoto (D1), T. Ibaraki, M. Yagiura,
An Iterated Local Search Algorithm for the Time-Dependent Vehicle Routing Problem with Time Windows,
The Sixth Metaheuristics International Conference,
Vienna, Austria, August 22-26, 2005.
-
H. Hashimoto (D1), T. Ibaraki, S. Imahori, H. Nagamochi, M. Yagiura,
Generalizations for the vehicle routing problem with time windows,
International Workshop on Discrete Optimization,
Kyoto University, Japan, December 6, 2005. -
Kazuya Haraguchi (D3), Hiroshi Nagamochi, Toshihide Ibaraki,
Experimental Studies on Representation Complexity and Error Rates of Iteratively Composed Features,
Proceedings of the 3rd International Conference on Innovative Applications of Information Technology for Developing World (AACC2005), Kathmandu, Nepal, December 10-12, 2005. -
Y. Koga (M2), M. Yagiura, K. Nonobe,
T. Imamichi (M2), H. Nagamochi, T. Ibaraki,
Efficient Branch-and-Bound Algorithms for weighted MAX-2-SAT,
Third International Conference on Innovative Applications of Information Technology for Developing World (Asian Applied Computing Conference),
Kathmandu, Nepal, December 10-12, 2005.