Online edition: ISSN 2432-6380
[TOP] | [2018] | [2019] | [2020] | [2021] | [2022] | [2023] | [2024] | [Japanese] / [English]
COMP2022-1
Transportation Problem on a Graph
Tetsuo Asano (Kanazawa Univ.)
pp. 1 - 8
COMP2022-2
Transportation Problem Allowing Sending and Bringing Back
Tetsuo Asano (Kanazawa Univ.)
pp. 9 - 16
COMP2022-3
An Uniform Scattering Algorithm with d-Spacing by (d-1)-distance Visible Autonomous Mobile Robots
Syunsuke Aizu, Yonghwan Kim, Yoshiaki Katayama (NITech)
pp. 17 - 24
COMP2022-4
A Self-Stabilizing Algorithm to Construct Node Disjoint Paths between Two Senders and Targets on a Biconnected Graph
Takuma Kitaoka, Yonghwan Kim, Yoshiaki Katayama (NITech)
pp. 25 - 32
COMP2022-5
On Time Complexity of Distributed Minimum Spanning Tree Construction in the broadcast-CONGEST model for Restricted Graph Classes
Narumi Shigekiyo, Toshimitsu Masuzawa, Taisuke Izumi (Osaka Univ.)
pp. 33 - 38
COMP2022-6
Information Theory of Evolution
-- The Driving Force of Saltative Evolution --
Kumon Tokumaru (Researcher)
pp. 39 - 44
COMP2022-7
[Invited Talk]
Planning with Explanations for Finding Desired Meeting Points on Graphs
Keisuke Otaki (TCRDL)
p. 45
COMP2022-8
Computational Power of A Memoryless Mobile Agent in Undirected Rings
Taichi Inoue, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa (Osaka Univ.)
pp. 46 - 53
COMP2022-9
Energy-Constrained Autonomous Mobile Robots: Computational Power and Cross-Model Analysis
Kevin Buchin (TU Dort.), Paola Flocchini (Univ. of Ottawa), Irina Kostitsyna, Tom Peters (TU Eind.), Nicola Santoro (Carleton Univ.), Koichi Wada (Hosei Univ.)
pp. 54 - 61
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.