IEICE Technical Report

Online edition: ISSN 2432-6380

Theoretical Foundations of Computing

Workshop Date : 2022-10-26 / Issue Date : 2022-10-19

COMP2022-13
[Invited Talk] Graph Search Parallelization and Applications
Kazuki Yoshizoe (Kyushu Univ.)
p. 1

COMP2022-14
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)
pp. 2 - 6

COMP2022-15
Evacuation problems on grid networks with uniform transit time and uniform capacity
Yuki Tokuni, Naoki Katoh, Junichi Teruyama, Yuya Higashikawa (Uoh)
pp. 7 - 13

COMP2022-16
Enumeration of Transversal Edge-Partitions
Koki Shinraku, Yazhou He, Katsuhisa Yamanaka, Takashi Hirayama (Iwate Univ.)
pp. 14 - 20

COMP2022-17
Efficient Enumeration of Spanning Subgraphs in Planar Graphs with Edge Connectivity Constraints
Yasuaki Kobayashi (Hokkaido Univ.), Kazuhiro Kurita (Nagoya Univ.), Kunihiro Wasa (Hosei Univ.)
pp. 21 - 28

COMP2022-18
[Invited Talk] Hedonic Games and Treewidth Revisited
Tesshu Hanaka (Kyushu Univ.), Michael Lampis (LAMSADE)
p. 29

COMP2022-19
(See Japanese page.)
pp. 30 - 31

COMP2022-20
Computational Complexity of List Constructing
Takashi Harada (Kochi Univ. of Tech.), Takashi Fuchino, Ken Tanaka (Kanagawa Univ.), Kenji Mikawa (MIT)
pp. 32 - 37

Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.

The Institute of Electronics, Information and Communication Engineers (IEICE), Japan