Mon, Mar 5 AM 10:00 - 17:30 |
(1) |
10:00-10:25 |
Relationship between Retweet and Structure of the Twitter Network |
Tatsuya Fukushima (Waseda Univ.) |
(2) |
10:25-10:50 |
The Growth of Non-Giant Component in Preferentially-Attached Networks |
Takahiro Shimomura, Hiroshi Toyoizumi (Waseda Univ.) |
|
10:50-11:00 |
Break ( 10 min. ) |
(3) |
11:00-11:50 |
[Invited Talk]
Stochastic Packing Integer Programs with Few Queries |
Takanori Maehara (RIKEN), Yutaro Yamaguchi (Osaka Univ./RIKEN) |
|
11:50-13:20 |
Break ( 90 min. ) |
(4) |
13:20-14:10 |
[Invited Talk]
Space-Efficient Algorithms for Longest Increasing Subsequence |
Masashi Kiyomi (Yokohama City Univ.), Hirotaka Ono (Nagoya Univ.), Yota Otachi (Kumamoto Univ.), Pascal Schweitzer (TU Kaiserslautern), Jun Tarui (UEC) |
|
14:10-14:25 |
Break ( 15 min. ) |
(5) |
14:25-14:50 |
Analysis of Polynomial-time Learnability with Membership Queries |
Mikito Nanashima (Tokyo Inst. of Tech.) |
(6) |
14:50-15:15 |
A recognition algorithm for simple-triangle graphs |
Asahi Takaoka (Kanagawa Univ.) |
|
15:15-15:30 |
Break ( 15 min. ) |
(7) |
15:30-15:55 |
Efficient Computation of Betweenness Centrality by Graph Decompositions and their Applications to Real-world Networks |
Tatsuya Inoha (Osaka Pref. Univ.), Kunihiko Sadakane (Univ. of Tokyo), Yushi Uno (Osaka Pref. Univ.), Yuuma Yonebayashi (Univ. of Tokyo) |
(8) |
15:55-16:20 |
Implementation of global partition algorithm and verification of hyperfiniteness for property testing of real-world networks |
Yutaro Honda (Osaka Pref. Univ.), Hiro Ito (UEC), Munehiko Sasajima (Univ. of Hyogo), Yushi Uno (Osaka Pref. Univ.) |
(9) |
16:20-16:45 |
On Settlement Fund Circulation Problem |
Hitoshi Hayakawa, Toshimasa Ishii (Hokkaido Univ.), Hirotaka Ono (Nagoya Univ.), Yushi Uno (Osaka Pref. Univ.) |
|
16:45-17:00 |
Break ( 15 min. ) |
(10) |
17:00-17:30 |
|