Online edition: ISSN 2432-6380
[TOP] | [2018] | [2019] | [2020] | [2021] | [2022] | [2023] | [2024] | [Japanese] / [English]
COMP2023-11
An algorithm for the secure total domination problem in proper interval graphs
Toru Araki, Yasufumi Aita (Gunma Univ.)
pp. 1 - 8
COMP2023-12
Solving Distance-constrained Labeling Problems for Small Diameter Graphs via TSP
Tesshu Hanaka (Kyushu Univ.), Hirotaka Ono, Kosuke Sugiyama (Nagoya Univ.)
pp. 9 - 11
COMP2023-13
[Invited Talk]
Recent advances in algorithmic randomness
Takayuki Kihara (Nagoya Univ.)
p. 12
COMP2023-14
Algorithm of uniform deployment for mobile robots in perfect bipartite graphs
Masahiro Shibata (Kyutech), Naoki Kitamura (Osaka Univ.), Ryota Eguchi (NAIST), Yuichi Sudo (Hosei Univ.), Junya Nakamura (Toyohashi Tech.), Yonghwan Kim, Yoshiaki Katayama (Nagoya Tech.), Toshimitsu Masuzawa (Osaka Univ.), Sebastien Tixeuil (Sorbonne Univ.)
pp. 13 - 20
COMP2023-15
On Space Complexity of Generating a Tent Code
Naoaki Okada (Kyushu Univ.), Shuji Kijima (Shiga Univ.)
pp. 21 - 23
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.