|
|
| Chair |
|
Hiroyuki Uno (Osaka Metropolitan Univ.) |
| Vice Chair |
|
Shuji Kijima (Shiga Univ.) |
| Secretary |
|
Kunihiro Wasa (Hosei Univ.), Yu Yokoi (NII) |
| Assistant |
|
Ei Ando (Senshu Univ.) |
|
| 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. |
Copyright
and
reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
| 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  COMP2022-21 |
Yuta Nozaki (Hiroshima Univ.), Kunihiro Wasa (Hosei Univ.), Katsuhisa Yamanaka (Iwate Univ.) |
| (2) |
09:55-10:20 |
COMP2022-22 |
|
| (3) |
10:20-10:45 |
A Common Generalization of Budget Games and Congestion Games COMP2022-23 |
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 COMP2022-24 |
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 COMP2022-25 |
Mizuki Sue, Yasuaki Kobayashi, Hiroki Arimura (Hokkaido Univ.), Yuto Nakashima, Shunsuke Inenaga (Kyushu Univ.) |
| (6) |
11:50-12:15 |
COMP2022-26 |
|
| |
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 COMP2022-27 |
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 COMP2022-28 |
Kaito Harada, Naoki Kitamura, Taisuke Izumi, Toshimitsu masuzawa (Osaka Univ.) |
| (9) |
15:25-15:50 |
COMP2022-29 |
|
| |
15:50-16:05 |
Break ( 15 min. ) |
| (10) |
16:05-16:30 |
The Computational Complexity of Majority Function : A Survey COMP2022-30 |
Kazuhisa Seto (Hokkaido Univ.) |
| (11) |
16:30-16:55 |
Sequentially Swapping Tokens: Further on Graph Classes COMP2022-31 |
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 COMP2022-32 |
Kouhei Takahashi, Kazuhisa Seto, Takashi Horiyama (Hokkaido Univ.) |
| Announcement for Speakers |
| General Talk | Each speech will have 20 minutes for presentation and 5 minutes for discussion. |
| Contact Address and Latest Schedule Information |
| COMP |
Technical Committee on Theoretical Foundations of Computing (COMP) [Latest Schedule]
|
| Contact Address |
COMP Secretaries
E- : comp- n   |
Last modified: 2022-10-20 22:49:45
|