IEICE Technical Report

Online edition: ISSN 2432-6380

Theoretical Foundations of Computing

Workshop Date : 2023-05-10 - 2023-05-11 / Issue Date : 2023-05-03

COMP2023-1
[Invited Talk] Reallocation Problems with Minimum Completion Time
Toshimasa Ishii (Hokkaido Univ.), Jun Kawahara, Kazuhisa Makino (Kyoto Univ.), Hirotaka Ono (Nagoya Univ.)
p. 1

COMP2023-2
A computational complexity assumption necessary for pseudorandom quantum states generators
Yuki Shirakawa (Kyoto Univ.)
pp. 2 - 7

COMP2023-3
On the Solvability of Gathering Problems by Autonomous Mobile Robots with Defected View
Yonghwan Kim (NITech), Masahiro Shibata (Kyutech), Yuichi Sudo (Hosei Univ.), Junya Nakamura (TUT), Yoshiaki Katayama (NITech), Toshimitsu Masuzawa (Osaka Univ.)
pp. 8 - 15

COMP2023-4
Improved approximation algorithm for TTP-2
Yuga Kanaya, Kenjiro Takazawa (Hosei Univ)
pp. 16 - 21

COMP2023-5
Enumeration of Minimal Induced Steiner Subgraph in a Series-Parallel Graph
Shun Onogi (TUT), Kunihiro Wasa (Hosei Univ.)
pp. 22 - 28

COMP2023-6
Parameterized Complexity of Shortest Path Most Vital Edges Problem
Yuto Ashida, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa (Osaka Univ.)
pp. 29 - 35

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