| Conference Date |
Tue, Dec 6, 2022 09:30 - 17:20 |
| Topics |
Theoretical Computer Science, etc |
| Conference Place |
Media Hall, Ehime University |
| Address |
3 Bunkyo-cho, Matsuyama-shi, Ehime, Japan. |
| Registration Fee |
This workshop will be held as the IEICE workshop in fully electronic publishing. Registration fee will be necessary except the speakers and participants other than the participants to workshop(s) in non-electronic publishing. See the registration fee page. We request the registration fee or presentation fee to participants who will attend the workshop(s) on COMP. |
Tue, Dec 6 AM
09:30 - 17:20 |
| (1) |
09:30-09:55 |
Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries |
Yuta Nozaki (Hiroshima Univ.), Kunihiro Wasa (Hosei Univ.), Katsuhisa Yamanaka (Iwate Univ.) |
| (2) |
09:55-10:20 |
|
|
| (3) |
10:20-10:45 |
A Common Generalization of Budget Games and Congestion Games |
Fuga Kiyosue (SCSK), Kenjiro Takazawa (Hosei Univ.) |
| |
10:45-11:00 |
Break ( 15 min. ) |
| (4) |
11:00-11:25 |
Average space complexity of tent expansions around the golden ratio |
Naoaki Okada (Kyushu Univ.), Shuji Kijima (Shiga Univ.) |
| (5) |
11:25-11:50 |
Efficient Computation of the Run-length Encoded Burrows-Wheeler Transform Based on the Compact Directed Acyclic Word Graph |
Mizuki Sue, Yasuaki Kobayashi, Hiroki Arimura (Hokkaido Univ.), Yuto Nakashima, Shunsuke Inenaga (Kyushu Univ.) |
| (6) |
11:50-12:15 |
|
|
| |
12:15-13:45 |
Lunch Break ( 90 min. ) |
| (7) |
13:45-14:45 |
[Invited Talk]
Coordination of Multiple game AI in Two-player Board Games |
Shogo Takeuchi (Kochi Univ. of Tech.) |
| |
14:45-15:00 |
Break ( 15 min. ) |
| (8) |
15:00-15:25 |
A Fast (1+epsilon)-Approximating Algorithm for Single Source Replacement Path Problem |
Kaito Harada, Naoki Kitamura, Taisuke Izumi, Toshimitsu masuzawa (Osaka Univ.) |
| (9) |
15:25-15:50 |
|
|
| |
15:50-16:05 |
Break ( 15 min. ) |
| (10) |
16:05-16:30 |
The Computational Complexity of Majority Function : A Survey |
Kazuhisa Seto (Hokkaido Univ.) |
| (11) |
16:30-16:55 |
Sequentially Swapping Tokens: Further on Graph Classes |
Hironori Kiya (Kyushu Univ.), Yuto Okada, Hirotaka Ono, Yota Otachi (Nagoya Univ.) |
| (12) |
16:55-17:20 |
Isomorphism Elimination by Repetitive Representative-Extraction with Fragments of Automorphisms |
Kouhei Takahashi, Kazuhisa Seto, Takashi Horiyama (Hokkaido Univ.) |
: comp-
n
