IEICE Technical Report

Online edition: ISSN 2432-6380

Theoretical Foundations of Computing

Workshop Date : 2022-12-06 / Issue Date : 2022-11-29

COMP2022-21
Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries
Yuta Nozaki (Hiroshima Univ.), Kunihiro Wasa (Hosei Univ.), Katsuhisa Yamanaka (Iwate Univ.)
pp. 1 - 8

COMP2022-22
(See Japanese page.)
pp. 9 - 13

COMP2022-23
A Common Generalization of Budget Games and Congestion Games
Fuga Kiyosue (SCSK), Kenjiro Takazawa (Hosei Univ.)
pp. 14 - 17

COMP2022-24
Average space complexity of tent expansions around the golden ratio
Naoaki Okada (Kyushu Univ.), Shuji Kijima (Shiga Univ.)
pp. 18 - 20

COMP2022-25
Efficient Computation of the Run-length Encoded Burrows-Wheeler Transform Based on the Compact Directed Acyclic Word Graph
Mizuki Sue, Yasuaki Kobayashi, Hiroki Arimura (Hokkaido Univ.), Yuto Nakashima, Shunsuke Inenaga (Kyushu Univ.)
pp. 21 - 28

COMP2022-26
(See Japanese page.)
pp. 29 - 30

COMP2022-27
[Invited Talk] Coordination of Multiple game AI in Two-player Board Games
Shogo Takeuchi (Kochi Univ. of Tech.)
p. 31

COMP2022-28
A Fast (1+epsilon)-Approximating Algorithm for Single Source Replacement Path Problem
Kaito Harada, Naoki Kitamura, Taisuke Izumi, Toshimitsu masuzawa (Osaka Univ.)
pp. 32 - 39

COMP2022-29
(See Japanese page.)
pp. 40 - 47

COMP2022-30
The Computational Complexity of Majority Function : A Survey
Kazuhisa Seto (Hokkaido Univ.)
p. 48

COMP2022-31
Sequentially Swapping Tokens: Further on Graph Classes
Hironori Kiya (Kyushu Univ.), Yuto Okada, Hirotaka Ono, Yota Otachi (Nagoya Univ.)
pp. 49 - 50

COMP2022-32
Isomorphism Elimination by Repetitive Representative-Extraction with Fragments of Automorphisms
Kouhei Takahashi, Kazuhisa Seto, Takashi Horiyama (Hokkaido Univ.)
pp. 51 - 58

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