Online edition: ISSN 2432-6380
[TOP] | [2018] | [2019] | [2020] | [2021] | [2022] | [2023] | [2024] | [Japanese] / [English]
COMP2021-13
Finding a Route without an Intersection
Momo Tosue, Kazuko Takahashi (Kwansei Gakuin Univ.)
pp. 1 - 6
COMP2021-14
(See Japanese page.)
pp. 7 - 10
COMP2021-15
Multifold tiles of polyominoes and convex lattice polygons
Kota Chida (UEC), Erik Demaine, Martin Demaine (MIT), David Eppstein (UCI), Adam Hesterberg (Harvard Univ.), Takashi Horiyama (Hokkaido Univ.), John Iacono (ULB), Hiro Ito (UEC), Stefan Langerman (ULB), Ryuhei Uehara (JAIST), Yushi Uno (Osaka Pref. Univ.)
pp. 11 - 18
COMP2021-16
[Invited Talk]
Optimal-Time Queries on BWT-runs Compressed Indexes
Takaaki Nishimoto, Yasuo Tabei (RIKEN)
p. 19
COMP2021-17
Algorithms for Graph Class Identification Problems in the Population Protocol Model
Hiroto Yasumi, Fukuhito Ooshita, Michiko Inoue (NAIST)
pp. 20 - 27
COMP2021-18
On an Algorithm to form a Triangle from a Line Using Pairbot Model
Yuya Taguchi, Yonghwan Kim, Yoshiaki Katayama (NIT)
pp. 28 - 35
COMP2021-19
Sequentially Swapping Colored Tokens on King's Graphs
Yuto Okada, Hironori Kiya, Yota Otachi, Hirotaka Ono (Nagoya Univ.)
pp. 36 - 38
COMP2021-20
Computing the Longest Path Length Distribution Function of DAGs with Small Treewidth and Random Edge Lengths
Ei Ando (Senshu Univ.)
pp. 39 - 46
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.