|
Chair |
|
Masafumi Yamashita |
Vice Chair |
|
Tatsuya Akutsu |
Secretary |
|
Keisuke Tanaka, Kunihiko Sadakane |
|
Conference Date |
Mon, Apr 18, 2005 10:00 - 16:25 |
Topics |
|
Conference Place |
Kwansei Gakuin University |
Contact Person |
Prof. Hiroyoshi MIWA
079-565-7947 |
Mon, Apr 18 AM 10:00 - 16:25 |
(1) |
10:00-10:35 |
A fast algorithm for calculating an upper bound of the weight of the maximum weighted clique |
Kazuaki Yamaguchi, Sumio Masuda (Kobe Univ.) |
(2) |
10:35-11:10 |
Exact Algorithms for the Two-Dimensional Strip Packing Problem with Rotations |
Mitsutoshi Kenmochi, Takashi Imamichi, Koji Nonobe, Mutsunori Yagiura, Hiroshi Nagamochi (Kyoto Univ.) |
(3) |
11:10-11:45 |
Branch-and-Bound Algorithms for MAX-2-SAT |
Yuichi Koga, Koji Nonobe, Mutsunori Yagiura, Hiroshi Nagamochi (Kyoto Univ.), Toshihide Ibaraki (Kwansei Gakuin Univ.) |
|
11:45-13:15 |
Break ( 90 min. ) |
(4) |
13:15-13:50 |
On time and space complexity of functions |
Kenya Ueno (Univ. of Tokyo) |
(5) |
13:50-14:25 |
Quantum Algorithms for the Hidden Subgroup Problem over Semidirect Product Groups of Cyclic Groups |
Yoshifumi Inui, Francois Le Gall (Univ. of Tokyo/JST) |
(6) |
14:25-15:00 |
Truthful Auctions with Limited Ranges of Bids |
Daisuke Sumita, Takashi Horiyama, Kazuo Iwama (Kyoto Univ.) |
|
15:00-15:15 |
Break ( 15 min. ) |
(7) |
15:15-15:50 |
On the Complexity of Inferring a Graph from Path Frequency |
Tatsuya Akutsu, Daiji Fukagawa (Kyoto Univ.) |
(8) |
15:50-16:25 |
Lowering Eccentricity of a Tree by Node-Upgrading |
Toshihide Ibaraki (Kwansei Gakuin Univ.), Xiao-Guang Yang (CAS) |
Contact Address and Latest Schedule Information |
COMP |
Technical Committee on Theoretical Foundations of Computing (COMP) [Latest Schedule]
|
Contact Address |
|
Last modified: 2005-04-07 17:57:41
|