IEICE Technical Report

Online edition: ISSN 2432-6380

Theoretical Foundations of Computing

Workshop Date : 2024-12-16 / Issue Date : 2024-12-09

COMP2024-20
On the Solvability of Linear Flocking Problems by Pairbots
Tomohiro Shinonaga, Yonghwan Kim, Yoshiaki Katayama (NITech)
pp. 1 - 8

COMP2024-21
On an Asynchronous Algorithm for Complete Visibility of Autonomous Mobile robots Under One-Axis Agreement on Grid Plane
Yuji Tachi, Yonghwan Kim, Yoshiaki Katayama (NIT)
pp. 9 - 16

COMP2024-22
[Invited Talk] Algorithmic Aspects of Convex Universal Covering Problems
Takeshi Tokuyama (Kwansei Gakuin Univ.)
p. 17

COMP2024-23
Towards ETH-Hardness of Multi-MCSP
Masaki Nagata, Mikito Nanashima (Science Tokyo)
pp. 18 - 22

COMP2024-24
Complexity of the Locally Dense Lattice Problem
Shuichi Hirahara (NII), Kazuki Ogitsuka (SOKENDAI)
pp. 23 - 27

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