IEICE Technical Report

Online edition: ISSN 2432-6380

Theoretical Foundations of Computing

Workshop Date : 2026-03-04 / Issue Date : 2026-02-25

COMP2025-21
On the Complexity of Transformation from Tractable Boolean Formulas to Binary Decision Diagrams
Giovanni Buzzega (PU), Kazuhiro Kurita (OU), Kazuhisa Seto (HU)
pp. 1 - 4

COMP2025-22
An upper bound for the double domination number of maximal outerplanar graphs
Toru Araki (Gunma Univ)
pp. 5 - 12

COMP2025-23
[Invited Talk] Existence of Fair and Efficient Allocation of Indivisible Chores
Ryoga Mahara (The University of Tokyo)
p. 13

COMP2025-24
Generating diverse routes with lengths within a specified range
Satoru Mutoh, Yuki Amano, Keiko Imai (Chuo Univ.)
pp. 14 - 21

COMP2025-25
Gathering and information exchange for mobile robots on vertex-weighted graphs
Ryosuke Ikeda, Yukiko Yamauchi (Kyushu U.)
pp. 22 - 29

COMP2025-26
Hardwired Pattern Formation Algorithm for a Group of Mobile Robots with Global Agreement
Yuta Kojima, Yukiko Yamauchi (Kyushu Univ.)
pp. 30 - 37

COMP2025-27
Kirby's Dream Land is NP-complete
Ryuya Tamayama, Tomoyuki Yamakami (Univ. of Fukui)
pp. 38 - 44

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