研究成果 > 学生による発表(国際会議・シンポジウム)
2007年度
緑色の氏名は発表者.
-
J. Wang (D2), L. Zhao, H. Nagamochi, T. Akutsu,
An Efficient Algorithm for Generating Colored Outerplanar Graphs,
The 4th Annual Conference on Theory and Applications of Models of Computation (TAMC07),
May 22-25, 2007, Shanghai, China, Lecture Notes in Computer Science, vol. 4484, pp. 573-583. -
E. Morsy (D2), H. Nagamochi,
Approximating capacitated tree-routings in networks, The 4th Annual Conference on Theory and Applications of Models of Computation (TAMC07),
May 22-25, Shanghai, China, Lecture Notes in Computer Science, vol. 4484, pp. 342-353. -
A. Kawaguchi (M2), H. Nagamochi,
Orthogonal Drawings for Plane Graphs with Specified Face Areas,
The 4th Annual Conference on Theory and Applications of Models of Computation (TAMC2007),
May 22-25, 2007, Shanghai, China, Lecture Notes in Computer Science, vol. 4484, pp. 584-594. -
H. Hashimoto(D3), M. Yagiura,
Path Relinking Approach with an Adaptive Mechanism to Control Parameters for the Vehicle Routing Problem with Time Windows,
Eighth European Conference on Evolutionary Computation in Combinatorial Optimization,
Naples, Italy, March 26-28 2008, Lecture Notes in Computer Science. -
S. Ota (M1), H. Nagamochi,
A plane graph representation for tripartitions of a triconnected graph,
The Kyoto International Conference on Computational Geometry and Graph Theory (KyotoCGGT2007),
Kyoto, Japan, June 11-15, 2007. -
T. Imamichi (D2), H. Nagamochi,
Packing Sets of Circles with Shape-memory,
INFORMS International Meeting Puerto Rico 2007, Puerto Rico, July 8-11, 2007. -
H. Fujiwara, J. Wang (D2), L. Zhao, H. Nagamochi, T. Akutsu,
Enumerating Tree-like Chemical Structures from Feature Vector,
The 10th KOREA-JAPAN Joint Workshop on Algorithms and Computation (WAAC2007), August 9-10, 2007, Gwangju, Korea. - T. Imamichi (D2), H. Nagamochi,
An iterated local search algorithm in a multi-sphere scheme for 2D and 3D packing problems,
Korea-Japan Joint Workshop on Algorithms and Computation, Chonnam National University, Gwangju, Korea, August 9-10, 2007. -
T. Imamichi (D2), H. Nagamochi,
A multi-sphere scheme for 2D and 3D packing problems,
Proceedings of Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics (SLS2007),
September 6-8, 2007, Universite Libre de Bruxelles, Brussels, Belgium, Lecture Notes in Computer Science, vol. 4638, pp. 207-211. -
H. Hashimoto(D3), Y. Ezaki, M. Yagiura, K. Nonobe, T. Ibaraki, A. L{\o}kketangen,
A Set Covering Approach for the Pickup and Delivery Problem with General Constraints on Each Route,
Engineering Stochastic Local Search Algorithms: Designing, Implementing and Analyzing Effective Heuristics (SLS 2007),
Universit\'{e} Libre de Bruxelles, Brussels, Belgium, September 6-8, 2007,
Lecture Notes in Computer Science, vol. 4638, pp.192-196. -
T. Imamichi (D2), H. Nagamochi,
Two local searches in a multi-sphere scheme for 2D and 3D packing problems,
7th PhD Workshop on Cutting and Packing and Related Topics, Leiria, Portugal, September 9-12, 2007. -
E. Morsy (D2), H. Nagamochi,
Approximation to the minimum cost edge installation problem,
The 18th International Symposium on Algorithms and Computation (ISAAC 2007),
December 17-19, 2007, Sendai, Japan, Lecture Notes in Computer Science, vol. 4835, pp. 292-303.