IEICE Technical Report

Online edition: ISSN 2432-6380

Theoretical Foundations of Computing

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

COMP2026-9
k-Product Lists for (Generalized) Feedback Vertex Sets -- A Tool for Designing FPT Algorithms --
Rin Saito, Yuma Tamura (Tohoku Univ.)
pp. 1 - 7

COMP2026-10
On the Complexity of Locally Rainbow Path
Hiroshi Eto (Kyutech), Tesshu Hanaka (Kyushu Univ.), Eiji Miyano, Shuya Yoshida (Kyutech)
pp. 8 - 15

COMP2026-11
[Invited Talk] Expanders and finitely generated groups
Masato Mimura (Tohoku Univ.)
p. 16

COMP2026-12
Theoretically and Practically Faster Algorithms for Protein Structure Alignment
Masahito Tsukahara, Tetsuo Shibuya (Tokyo Univ.)
pp. 17 - 24

COMP2026-13
Super-Peer P2P Style Distributed Checkpointing and Rollback Algorithm Using Secret Sharing
Sen Moriya (Kindai Univ.)
pp. 25 - 32

COMP2026-14
The Computational Complexity of L(2,1)-Labeling on Unit Disk Graphs
Hirotaka Ono (Nagoya Univ.)
pp. 33 - 34

COMP2026-15
Positivity Proofs for Third-Order Holonomic Sequences
Fugen Hagihara (Kyoto Univ.)
pp. 35 - 42

COMP2026-16
Characterizing Algebraic Complexity Classes Defined by Uniform Arithmetic Circuit Families via Nondeterministic and Alternating Semiring Turing Machines
Hiroki Arimura (Hokkaido Univ.)
pp. 43 - 50

COMP2026-17
Near-unit distance embedding of points in plane and space -- Experience of collaboration with AI --
Tetsuo Asano (Kanazawa U.), Takeshi Tokuyama (KGU)
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