Fri, Jun 23 AM 10:00 - 16:10 |
(1) |
10:00-10:35 |
Track layout of bipartite graph subdivisions |
Miki Miyauchi (NTT) |
(2) |
10:35-11:10 |
On the Computational Complexity of Interview Timetabling Problems |
Yuuki Kiyonari, Eiji Miyano (KIT), Shuichi Miyazaki (Kyoto Univ.) |
(3) |
11:10-11:45 |
Reductions for Monotone Boolean Circuits |
Kazuo Iwama, Hiroki Morizumi (Kyoto Univ.) |
|
11:45-13:00 |
Lunch Break ( 75 min. ) |
(4) |
13:00-13:35 |
Relationships between Data-Privacy and Key-Privacy |
Ryotaro Hayashi, Keisuke Tanaka (Tokyo Inst. of Tech.) |
(5) |
13:35-14:10 |
Polynomial-Time Algorithm for Finding a Solution in the Core of a Multicommodity Flow Game |
Kazuhiro Karasawa, Toshinori Yamada (Saitama Univ.) |
|
14:10-14:25 |
Break ( 15 min. ) |
(6) |
14:25-15:00 |
Improvement of repeat search using factor oracles |
Hisashi Iwasaki (Tokyo Inst. of Tech.) |
(7) |
15:00-15:35 |
Simple Rank/Select Dictionaries |
Kunihiko Sadakane (Kyushu U) |
(8) |
15:35-16:10 |
Notes on Voronoi Diagrams for Pure Quantum States |
Kimikazu Kato (Nihon Unisys/Univ. of Tokyo), Mayumi Oto (Toshiba), Hiroshi Imai (Univ. of Tokyo), Keiko Imai (Chuo Univ.) |