| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
Special Interest Group on Algorithms (IPSJ-AL) (Searched in: 2019)
Search Results: Keywords 'from:2019-05-10 to:2019-05-10'
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP, IPSJ-AL | 2019-05-10 15:15 |
Kumamoto | Kumamoto University | Research on Similar Hole Puzzle: Hardness and Efficient Algorithm Takashi Himoto, Ryuhei Uehara (JAIST)  COMP2019-1 |
[more] | COMP2019-1 pp.9-13 |
| COMP, IPSJ-AL | 2019-05-10 15:40 |
Kumamoto | Kumamoto University | On the Complexity of Lattice Puzzle: Yasuaki Kobayashi, Koki Suetsugu, Hideki Tsuiki (Kyoto Univ), Ryuhei Uehara (JAIST) COMP2019-2 |
In this paper, we investigate the computational complexity of lattice puzzle, which is one of the traditional puzzles. ... [more] |
COMP2019-2 pp.15-22 |
| COMP, IPSJ-AL | 2019-05-11 10:40 |
Kumamoto | Kumamoto University | 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.) COMP2019-3 |
A subdivision of a graph $H$ is a graph obtained by inserting some vertices into each edge of $H$. In this paper, when ... [more] |
COMP2019-3 pp.51-58 |
| COMP, IPSJ-AL | 2019-05-11 11:05 |
Kumamoto | Kumamoto University | Improved Quantum Multicollision-Finding Algorithm Akinori Hosoyamada, Yu Sasaki, Seiichiro Tani, Keita Xagawa (NTT) COMP2019-4 |
[more] | COMP2019-4 pp.59-65 |
| COMP, IPSJ-AL | 2019-05-11 11:30 |
Kumamoto | Kumamoto University | Rational proofs for quantum computing Tomoyuki Morimae (Kyoto Univ.), Harumichi Nishimura (Nagoya Univ.) COMP2019-5 |
It is an open problem whether a classical client can delegate quantum computing to a remote quantum server in such a way... [more] | COMP2019-5 pp.67-74 |
| COMP, IPSJ-AL | 2019-05-11 13:30 |
Kumamoto | Kumamoto University | [Invited Talk]
Plane Formation by Synchronous Mobile Robots in the Three-Dimensional Euclidean Space Yukiko Yamauchi, Taichi Uehara, Shuji Kijima, Masafumi Yamashita (Kyushu Univ.) COMP2019-6 |
[more] | COMP2019-6 p.75 |
| COMP, IPSJ-AL | 2019-05-11 15:10 |
Kumamoto | Kumamoto University | Ring Exploration Algorithms for Myopic Luminous Robots with Larger Visibility Shota Nagahama, Fukuhito Ooshita, Michiko Inoue (NAIST) COMP2019-7 |
In this paper, we investigate ring exploration algorithms for autonomous mobile robots. The robots are myopic, that is, ... [more] | COMP2019-7 pp.83-90 |
| COMP, IPSJ-AL | 2019-05-11 15:50 |
Kumamoto | Kumamoto University | COMP2019-8 |
The {em dimension} of a partially ordered set (poset) is known to be one of the fundamental complexity measures of poset... [more] | COMP2019-8 pp.91-95 |
| COMP, IPSJ-AL | 2019-05-11 16:40 |
Kumamoto | Kumamoto University | 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.) COMP2019-9 |
[more] | COMP2019-9 pp.103-104 |
[Return to Top Page]