IEICE Technical Report

Online edition: ISSN 2432-6380

Theoretical Foundations of Computing

Workshop Date : 2025-12-05 / Issue Date : 2025-11-28

COMP2025-13
Average Rules for Facility Location Games with Voluntary Participation
Shota Miyamoto, Taiki Todo, Makoto Yokoo (Kyushu Univ.)
pp. 1 - 8

COMP2025-14
Deterministic (2/3-ε)-Approximation of Matroid Intersection Using Nearly-Linear Independence-Oracle Queries
Tatsuya Terao (Kyoto Univ.)
pp. 9 - 15

COMP2025-15
[Invited Talk] Revitalizing Research on Approximate String Matching Algorithms
Philip Wellnitz (NII)
p. 16

COMP2025-16
The linear time algorithm for isomorphism of block cactus graphs
Munetomo Issei, Uehara Ryuhei (JAIST), Nakashima Yuto (Kyudai)
pp. 17 - 24

COMP2025-17
Enumeration of Perfect Dominating Sets: Complexity, Equivalence, and Exact Algorithm
Tomonori Sasaki, Aito Ochi, Takashi Hirayama (Iwate Univ.), Kazuhiro Kurita (Okayama Univ.), Kei Uchizawa (Yamagata Univ.), Katsuhisa Yamanaka (Iwate Univ.)
pp. 25 - 32

COMP2025-18
An Approximation Algorithm for Two-Edge-Connected Subgraph Problem via Triangle-Free Two-Matching
Takashi Noguchi, Yusuke Kobayashi (Kyoto Univ.)
pp. 33 - 36

COMP2025-19
NP-hardness of Wittgenstein Briquet Puzzle
Kengo Igarashi (Kaijo)
pp. 37 - 43

COMP2025-20
A New Relaxation of Fairness in Two-Sided MatchingRespecting Acquaintance Relationships
Ryota Takeshima, Kei Kimura, Ayumu Kuroki, Temma Wakasugi, Makoto Yokoo (Kyushu Univ.)
pp. 44 - 51

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