Tue, Sep 6 AM
10:30 - 16:50 |
| (1) |
10:30-11:00 |
Counting the number of solutions for peg solitaire |
Itsuki Kanemoto, Toshiki Saitoh (Kobe Univ.), Masashi Kiyomi (Yokohama City Univ.), Ryuhei Uehara (JAIST) |
| (2) |
11:00-11:30 |
Gathering of mobile agents in Byzantine environments with authenticated whiteboards |
Masashi Tsuchida, Fukuhito Ooshita, Michiko Inoue (NAIST) |
| (3) |
11:30-12:00 |
On the inapproximability of the Frobenius problem and its relationship with the covering radius problem |
Shunichi Matsubara (Aoyama Gakuin Univ.) |
| |
12:00-13:30 |
Lunch ( 90 min. ) |
| (4) |
13:30-14:00 |
Games with a Single Pile of Stones and Number Theoretic Problems |
Yoshihiro Tsukamura (SONY), Yoshihide Igarashi, Yuta Urabe, Koichi Yamazaki (Gunma Univ.) |
| (5) |
14:00-14:30 |
|
|
| (6) |
14:30-15:00 |
On Enumeration of Spatial Proximity Patterns by Rectangle of Fixed Range in two Dimensions |
Tomoaki Ogasawara, Hiroshi Imai (Univ. of Tokyo), Takuya Kida (Hokkaido Univ.) |
| |
15:00-15:20 |
Break ( 20 min. ) |
| (7) |
15:20-15:50 |
An algorithm for an optimal sink location problem in dynamic tree networks on condition that minimize the total evacuation time |
Naoki Takahashi, Naoki Katoh (Kwansei Gakuin Univ), Yuya Higashikawa (Chuo Univ) |
| (8) |
15:50-16:20 |
A 2-dimensional topological representation theorem for rank 4 matroid polytopes |
Hiroyuki Miyata (Gunma Univ.) |
| (9) |
16:20-16:50 |
Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs |
Kenjiro Takazawa (Hosei Univ.) |
: 
i
h
eedept
be-u