Online edition: ISSN 2432-6380
[TOP] | [2016] | [2017] | [2018] | [2019] | [2020] | [2021] | [2022] | [Japanese] / [English]
COMP2019-1
Research on Similar Hole Puzzle: Hardness and Efficient Algorithm
Takashi Himoto, Ryuhei Uehara (JAIST)
pp. 9 - 13
COMP2019-2
On the Complexity of Lattice Puzzle:
Yasuaki Kobayashi, Koki Suetsugu, Hideki Tsuiki (Kyoto Univ), Ryuhei Uehara (JAIST)
pp. 15 - 22
COMP2019-3
Enumerating and Indexing Graph Subdivisions using Zero-suppressed Binary Decision Diagrams
Yu Nakahata, Jun Kawahara (Kyoto Univ.), Takashi Horiyama (Saitama Univ.), Shin-ichi Minato (Kyoto Univ.)
pp. 51 - 58
COMP2019-4
Improved Quantum Multicollision-Finding Algorithm
Akinori Hosoyamada, Yu Sasaki, Seiichiro Tani, Keita Xagawa (NTT)
pp. 59 - 65
COMP2019-5
Rational proofs for quantum computing
Tomoyuki Morimae (Kyoto Univ.), Harumichi Nishimura (Nagoya Univ.)
pp. 67 - 74
COMP2019-6
[Invited Talk]
Plane Formation by Synchronous Mobile Robots in the Three-Dimensional Euclidean Space
Yukiko Yamauchi, Taichi Uehara, Shuji Kijima, Masafumi Yamashita (Kyushu Univ.)
p. 75
COMP2019-7
Ring Exploration Algorithms for Myopic Luminous Robots with Larger Visibility
Shota Nagahama, Fukuhito Ooshita, Michiko Inoue (NAIST)
pp. 83 - 90
COMP2019-8
(See Japanese page.)
pp. 91 - 95
COMP2019-9
Subgraph Isomorphism on Graph Classes that Exclude a Substructure
Hans L. Bodlaender (Utrecht Univ.), Tesshu Hanaka (Chuo Univ.), Yasuaki Kobayashi, Yusuke Kobayashi (Kyoto Univ.), Yoshio Okamoto (UEC), Yota Otachi (Kumamoto Univ.), Tom C. van der Zanden (Utrecht Univ.)
pp. 103 - 104
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.