Mon, Mar 18 09:30 - 17:55 |
(1) |
09:30-09:55 |
Range Mode Query and Solution Enumeration |
Kentaro Sumigawa, Kunihiko Sadakane (Univ. of Tokyo) |
(2) |
09:55-10:15 |
* |
Sumiko Harasawa, Ryuhei Uehara (JAIST) |
(3) |
10:15-10:35 |
Implementation of Enumeration Algorithm of Connected Bipartite Permutation Graphs |
Shinichi Ikeda, Ryuhei Uehara (JAIST) |
|
10:35-10:45 |
Break ( 10 min. ) |
(4) |
10:45-11:10 |
|
|
(5) |
11:10-11:35 |
A GPU-based Non-commutative Reduction and Its Applications to Operations for Difference Arrays |
Atsushi Koike (NIT Ichinoseki), Kunihiko Sadakane (UTokyo) |
|
11:35-11:45 |
Break ( 10 min. ) |
(6) |
11:45-12:45 |
[Invited Talk]
The Diameter of Dense Random Regular Graphs |
Nobutaka Shimizu (Univ. Tokyo/RIKEN AIP) |
|
12:45-13:45 |
Lunch ( 60 min. ) |
(7) |
13:45-14:45 |
[Invited Talk]
Non-Black-Box Worst-Case to Average-Case Reductions within NP |
Shuichi Hirahara (Univ. Tokyo) |
|
14:45-15:00 |
Break ( 15 min. ) |
(8) |
15:00-16:00 |
[Invited Talk]
Cheeger Inequalities for Submodular Transformations |
Yuichi Yoshida (NII) |
|
16:00-16:15 |
Break ( 15 min. ) |
(9) |
16:15-16:40 |
Move-optimal Randomized Partial Gathering of Anonymous Mobile Agents in Anonymous Unidirectional Rings |
Norikazu Kawata (Osaka Univ.), Masahiro Shibata (KIT), Yuichi Sudo (Osaka Univ.), Fukuhito Ooshita (NAIST), Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ.) |
(10) |
16:40-17:05 |
On a Gathering by Seven Autonomous Mobile Robots in 2D Triangular Grid Plane |
Masaki Oyabu, Yonghwan Kim, Yoshiaki Katayama (NIT) |
(11) |
17:05-17:30 |
On an Algorithm for Constructing a Strongly-Connected (2,2)-Directed Acyclic Graph in Biconnected Undirected Graph |
Hiroki Aono, Yonghwan Kim, Yoshiaki Katayama (NIT) |
(12) |
17:30-17:55 |
Lower Bounds and Satisfiability Algorithms for Bounded Width Circuits |
Hiroki Morizumi (Shimane Univ.) |