| Conference Date |
Fri, Oct 23, 2020 10:00 - 17:40 |
| Topics |
|
| Conference Place |
B101, Graduate School of Information Science and Technology, Osaka University + Online |
| Address |
Yamadaoka 1-5, Suita-shi, 565-0871 Japan |
| Transportation Guide |
https://www.ist.osaka-u.ac.jp/english/access/ |
Contact
Person |
Prof. Toshimitsu Masuzawa |
| 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. |
Fri, Oct 23 AM
10:00 - 11:45 |
| (1) |
10:00-10:35 |
Algorithms for uniform deployment of mobile agents in dynamic rings
Masahiro Shibata（Kyutech）・〇Yuichi Sudo（Osaka Univ.）・Junya Nakamura（Toyohashi Tech）・Yonghwan Kim（NITech） |
| (2) |
10:35-11:10 |
On a Complete Visibility for Autonomous Mobile Robots with Lights in Asynchronous scheduler on a Grid Plane |
Yuno Ishida, Yonghwan Kim, Yoshiaki Katayama (NIT) |
| (3) |
11:10-11:45 |
Classical verification of quantum computing with the trusted center |
Tomoyuki Morimae (Kyoto Univ.) |
| |
11:45-13:15 |
Lunch Break ( 90 min. ) |
Fri, Oct 23 PM
13:15 - 14:15 |
| (4) |
13:15-14:15 |
[Invited Talk]
Index reduction for differential-algebraic equations with mixed matrices |
Satoru Iwata, Taihei Oki (The Univ. of Tokyo), Mizuyo Takamatsu (Chuo Univ.) |
| |
14:15-14:30 |
Break ( 15 min. ) |
Fri, Oct 23 PM
14:30 - 17:40 |
| (5) |
14:30-15:05 |
Mathematical Characterization and Computational Complexity of Anti-Slide Puzzles |
Ko Minamisawa, Ryuhei Uehara (JAIST), Masao Hara (Tokai Univ.) |
| (6) |
15:05-15:40 |
The odd depth tree problem |
Hiroshi Nishiyama (Kyushu Univ.) |
| (7) |
15:40-16:15 |
Optimal online packet scheduling for 2-bounded delay buffer management with lookahead |
Koji M. Kobayashi (UT) |
| |
16:15-16:30 |
Break ( 15 min. ) |
| (8) |
16:30-17:05 |
Efficient Enumeration of Non-isomorphic Distance-Hereditary Graphs and Ptolemaic Graphs |
Kazuaki Yamazaki, Qian Mengze, Ryuhei Uehara (JAIST) |
| (9) |
17:05-17:40 |
Polynomial Delay Enumeration for Steiner Problems |
Yasuaki Kobayashi (Kyoto Univ.), Kazuhiro Kurita (NII), Kunihiro Wasa (Toyohashi Tech) |
: f-oosi
is
ist