| IEICE Technical Committee Submission System Advance Program |
Online Proceedings [Sign in] Tech. Rep. Archives |
| Go Top | Go Back | Prev COMP Conf / Next COMP Conf | [HTML] / [HTML(simple)] / [TEXT] | [Japanese] / [English] |
|
=============================================== Technical Committee on Theoretical Foundations of Computing (COMP) 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.) DATE: Wed, Oct 26, 2022 10:00 - 17:30 PLACE: Large conference room A, Nishijin Plaza, Kyushu University(2-16-23 Nishijin, Sawara-ku, Fukuoka-shi) TOPICS: Theoretical Computer Science, etc ---------------------------------------- Wed, Oct 26 AM (10:00 - 17:30) ---------------------------------------- (1) 10:00 - 11:00 [Invited Talk] Graph Search Parallelization and Applications Kazuki Yoshizoe (Kyushu Univ.) ----- 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) ----- 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.) ----- Break ( 15 min. ) ----- (6) 15:15 - 16:15 [Invited Talk] Hedonic Games and Treewidth Revisited Tesshu Hanaka (Kyushu Univ.), Michael Lampis (LAMSADE) ----- Break ( 15 min. ) ----- (7) 16:30 - 17:00 (See Japanese page.) (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) # Information for speakers General Talk will have 25 minutes for presentation and 5 minutes for discussion. === Technical Committee on Theoretical Foundations of Computing (COMP) === # FUTURE SCHEDULE: Tue, Dec 6, 2022: Ehime Univ. Media Hall [Tue, Oct 18], Topics: Theoretical Computer Science, etc # SECRETARY: COMP Secretaries E-mail: comp-  n    Last modified: 2022-08-19 18:02:49 |
Notification: Mail addresses are partially hidden against SPAM.
[Download Paper's Information (in Japanese)] <-- Press download button after click here.
[Cover and Index of IEICE Technical Report by Issue]
[Presentation and Participation FAQ] (in Japanese)
[Return to COMP Schedule Page] /
| Go Top | Go Back | Prev COMP Conf / Next COMP Conf | [HTML] / [HTML(simple)] / [TEXT] | [Japanese] / [English] |
[Return to Top Page]