Online edition: ISSN 2432-6380
[TOP] | [2017] | [2018] | [2019] | [2020] | [2021] | [2022] | [2023] | [Japanese] / [English]
COMP2020-28
On an Algorithm for minimizing the number of routers in Grid Networks among Three Points
Yusuke Sawada, Yonghwan Kim, Yoshiaki Katayama (Nitech)
pp. 1 - 8
COMP2020-29
On the gathering problem for fat robots on a grid with agreement on the origin and one-axis
Kazuki Takahashi, Yonghwan Kim, Yoshiaki Katayama (Nitech)
pp. 9 - 16
COMP2020-30
Team Assembling Problem by Kilobots
Tang Run, Yamauchi Yukiko (Kyushu Univ.), Sebastien Tixeuil (Sorbonne Univ.)
pp. 17 - 23
COMP2020-31
[Invited Talk]
Tight Distributed Listing of Cliques
Keren Censor-Hillel (Technion), Yi-Jun Chang (ETH), François Le Gall (Nagoya Univ.), Dean Leitersdorf (Technion)
p. 24
COMP2020-32
[Invited Talk]
Sample-efficient Hamiltonian learning of quantum many-body systems
Anurag Anshu (UC Berkley), Srinivasan Arunachalam (IBM), Tomotaka Kuwahara (RIKEN AIP), Mehdi Soleimanifar (MIT)
p. 25
COMP2020-33
Classically Simulating Quantum Circuits with Local Depolarizing Noise
Yasuhiro Takahashi, Yuki Takeuchi, Seiichiro Tani (NTT)
pp. 26 - 29
COMP2020-34
A hyper-heuristic for the maximum clique problem
Kazuho Kanahara, Kengo Katayama (OUS), Etsuji Tomita (UEC)
pp. 30 - 37
COMP2020-35
A further improved MCT algorithm for finding a maximum clique
Jiro Yanagisawa, Etsuji Tomita (UEC), Kengo Katayama, Kanahara Kazuho (OUS), Takahisa Toda, Hiro Ito, Mitsuo Wakatsuki, Tetsuro Nishino (UEC)
pp. 38 - 45
COMP2020-36
On the Existence of 4-regular Uniquely Hamiltonian Graphs
Ryota Sakamoto (UEC Tokyo)
pp. 46 - 50
COMP2020-37
A 2-Approximation Algorithm for the 4-Edge Dominating Set Problem
Takumi Tatematsu, Toshihiro Fujito (TUT)
pp. 51 - 58
COMP2020-38
On generative capacity of controlled right linear grammars with unknown behaviors
Daihei Ise, Satoshi Kobayashi (UEC)
pp. 59 - 66
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.