Information and Systems-Theoretical Foundations of Computing(Date:2019/05/10)

Presentation
Research on Similar Hole Puzzle: Hardness and Efficient Algorithm

Takashi Himoto(JAIST),  Ryuhei Uehara(JAIST),  

[Date]2019-05-10
[Paper #]COMP2019-1
On the Complexity of Lattice Puzzle:

Yasuaki Kobayashi(Kyoto Univ),  Koki Suetsugu(Kyoto Univ),  Hideki Tsuiki(Kyoto Univ),  Ryuhei Uehara(JAIST),  

[Date]2019-05-10
[Paper #]COMP2019-2
[Invited Talk] Plane Formation by Synchronous Mobile Robots in the Three-Dimensional Euclidean Space

Yukiko Yamauchi(Kyushu Univ.),  Taichi Uehara(Kyushu Univ.),  Shuji Kijima(Kyushu Univ.),  Masafumi Yamashita(Kyushu Univ.),  

[Date]2019-05-11
[Paper #]COMP2019-6
Improved Quantum Multicollision-Finding Algorithm

Akinori Hosoyamada(NTT),  Yu Sasaki(NTT),  Seiichiro Tani(NTT),  Keita Xagawa(NTT),  

[Date]2019-05-11
[Paper #]COMP2019-4
Rational proofs for quantum computing

Tomoyuki Morimae(Kyoto Univ.),  Harumichi Nishimura(Nagoya Univ.),  

[Date]2019-05-11
[Paper #]COMP2019-5
Parameterized Algorithms for Order Dimension

Yasuaki Kobayashi(Kyoto Univ.),  

[Date]2019-05-11
[Paper #]COMP2019-8
Enumerating and Indexing Graph Subdivisions using Zero-suppressed Binary Decision Diagrams

Yu Nakahata(Kyoto Univ.),  Jun Kawahara(Kyoto Univ.),  Takashi Horiyama(Saitama Univ.),  Shin-ichi Minato(Kyoto Univ.),  

[Date]2019-05-11
[Paper #]COMP2019-3
Subgraph Isomorphism on Graph Classes that Exclude a Substructure

Hans L. Bodlaender(Utrecht Univ.),  Tesshu Hanaka(Chuo Univ.),  Yasuaki Kobayashi(Kyoto Univ.),  Yusuke Kobayashi(Kyoto Univ.),  Yoshio Okamoto(UEC),  Yota Otachi(Kumamoto Univ.),  Tom C. van der Zanden(Utrecht Univ.),  

[Date]2019-05-11
[Paper #]COMP2019-9
Ring Exploration Algorithms for Myopic Luminous Robots with Larger Visibility

Shota Nagahama(NAIST),  Fukuhito Ooshita(NAIST),  Michiko Inoue(NAIST),  

[Date]2019-05-11
[Paper #]COMP2019-7