|
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 |
Wed, Oct 26, 2022 10:00 - 17:30 |
Topics |
Theoretical Computer Science, etc |
Conference Place |
Large conference room A, Nishijin Plaza, Kyushu University |
Address |
2-16-23 Nishijin, Sawara-ku, Fukuoka-shi |
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. |
Wed, Oct 26 AM 10:00 - 17:30 |
(1) |
10:00-11:00 |
[Invited Talk]
Graph Search Parallelization and Applications |
Kazuki Yoshizoe (Kyushu Univ.) |
|
11:00-11:15 |
Break ( 15 min. ) |
(2) |
11:15-11:45 |
A Moderately Exponential Time Satisfiability Algorithm for Linear-Sized Deterministic Width-2 Branching Programs |
Tomu Makita (Seikei Univ.), Atsuki Nagao (Ochanomizu Univ.), Tatsuki Okada (Seikei Univ.), Kazuhisa Seto (Hokkaido Univ.), Junichi Teruyama (Univ. of Hyogo) |
(3) |
11:45-12:15 |
Evacuation problems on grid networks with uniform transit time and uniform capacity |
Yuki Tokuni, Naoki Katoh, Junichi Teruyama, Yuya Higashikawa (Uoh) |
|
12:15-14:00 |
Lunch Break ( 105 min. ) |
(4) |
14:00-14:30 |
Enumeration of Transversal Edge-Partitions |
Koki Shinraku, Yazhou He, Katsuhisa Yamanaka, Takashi Hirayama (Iwate Univ.) |
(5) |
14:30-15:00 |
Efficient Enumeration of Spanning Subgraphs in Planar Graphs with Edge Connectivity Constraints |
Yasuaki Kobayashi (Hokkaido Univ.), Kazuhiro Kurita (Nagoya Univ.), Kunihiro Wasa (Hosei Univ.) |
|
15:00-15:15 |
Break ( 15 min. ) |
(6) |
15:15-16:15 |
[Invited Talk]
Hedonic Games and Treewidth Revisited |
Tesshu Hanaka (Kyushu Univ.), Michael Lampis (LAMSADE) |
|
16:15-16:30 |
Break ( 15 min. ) |
(7) |
16:30-17:00 |
|
|
(8) |
17:00-17:30 |
Computational Complexity of List Constructing |
Takashi Harada (Kochi Univ. of Tech.), Takashi Fuchino, Ken Tanaka (Kanagawa Univ.), Kenji Mikawa (MIT) |
Announcement for Speakers |
General Talk | Each speech will have 25 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-08-19 18:02:49
|