Tue, Sep 3 AM
10:10 - 11:55 |
| (1) |
10:10-10:45 |
An O(n log n) Algorithm for the Minimax Regret Sink Location Problem in Dynamic Path Networks with the Uniform Capacity |
Yuya Higashikawa (Kyoto Univ.), Mordecai J. Golin (HKUST), Naoki Katoh (Kyoto Univ.) |
| (2) |
10:45-11:20 |
A New UCB-based Algorithm for the Matching-Selection Multi-armed Bandit Problem |
Ryo Watanabe, Atsuyoshi Nakamura, Mineichi Kudo (Hokkaido Univ.) |
| (3) |
11:20-11:55 |
Oracle Pushdown Automata, Nondeterministic Reducibilities, and the Hierarchy over the Family of Context-Free Languages
-- (Preliminary Version) -- |
Tomoyuki Yamakami (Univ. of Fukui) |
| |
11:55-13:30 |
Break ( 95 min. ) |
Tue, Sep 3 PM
13:30 - 14:40 |
| (4) |
13:30-14:05 |
A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and a Few Random Positions |
Endre Boros (Rutgers Univ.), Khaled Elbassioni (MPI), Vladimir Gurvich (Rutgers Univ.), Kazuhisa Makino (Kyoto Univ.) |
| (5) |
14:05-14:40 |
Hardness of Classically Simulating Quantum Circuits with Unbounded Toffoli and Fan-Out Gates |
Yasuhiro Takahashi (NTT), Takeshi Yamazaki, Kazuyuki Tanaka (Tohoku Univ.) |
| |
14:40-15:00 |
Break ( 20 min. ) |
Tue, Sep 3 PM
15:00 - 16:10 |
| (6) |
15:00-15:35 |
Approximation Algorithms for Bandwidth Consective Multicolorings |
Yuji Obata, Takao Nishizeki (Kwansei Gakuin Univ.) |
| (7) |
15:35-16:10 |
Finding Maximum Regular Induced Subgraphs with Prescribed Degree |
Yuichi Asahiro (Kyushu Sangyo Univ.), Takehiro Ito (Tohoku Univ.), Hiroshi Eto, Eiji Miyano (Kyushu Inst. of Tech.) |
: 
is
s
