Information and Systems-Theoretical Foundations of Computing(Date:2021/10/23)

Presentation
Finding a Route without an Intersection

Momo Tosue(Kwansei Gakuin Univ.),  Kazuko Takahashi(Kwansei Gakuin Univ.),  

[Date]2021-10-23
[Paper #]COMP2021-13
On an Algorithm to form a Triangle from a Line Using Pairbot Model

Yuya Taguchi(NIT),  Yonghwan Kim(NIT),  Yoshiaki Katayama(NIT),  

[Date]2021-10-23
[Paper #]COMP2021-18
Multifold tiles of polyominoes and convex lattice polygons

Kota Chida(UEC),  Erik Demaine(MIT),  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.),  

[Date]2021-10-23
[Paper #]COMP2021-15
Algorithms for Graph Class Identification Problems in the Population Protocol Model

Hiroto Yasumi(NAIST),  Fukuhito Ooshita(NAIST),  Michiko Inoue(NAIST),  

[Date]2021-10-23
[Paper #]COMP2021-17
地域上限を導入した研修医配属問題に対する計算複雑性

Koki Hamada(NTT),  Shuichi Miyazaki(Kyoto Univ.),  

[Date]2021-10-23
[Paper #]COMP2021-14
Sequentially Swapping Colored Tokens on King's Graphs

Yuto Okada(Nagoya Univ.),  Hironori Kiya(Nagoya Univ.),  Yota Otachi(Nagoya Univ.),  Hirotaka Ono(Nagoya Univ.),  

[Date]2021-10-23
[Paper #]COMP2021-19
Computing the Longest Path Length Distribution Function of DAGs with Small Treewidth and Random Edge Lengths

Ei Ando(Senshu Univ.),  

[Date]2021-10-23
[Paper #]COMP2021-20
[Invited Talk] Optimal-Time Queries on BWT-runs Compressed Indexes

Takaaki Nishimoto(RIKEN),  Yasuo Tabei(RIKEN),  

[Date]2021-10-23
[Paper #]COMP2021-16