Information and Systems-Image Engineering(Date:2020/12/04)

Presentation
Quantum sampling verification with offline quantum communication

Taiga Hiroka(Kyoto Univ),  Yuki Takeuchi(NTT CS Lab.),  Tomoyuki Morimae(Kyoto Univ),  

[Date]2020-12-04
[Paper #]COMP2020-27
Efficient Construction of Cryptarithm Catalogues over DFA

Koya Watanabe(Tohoku Univ.),  Diptarama Hendrian(Tohoku Univ.),  Ryo Yoshinaka(Tohoku Univ.),  Takashi Horiyama(Hokkaido Univ.),  Ayumi Shinohara(Tohoku Univ.),  

[Date]2020-12-04
[Paper #]COMP2020-20
Approximation algorithms for the maximum happy set problem

Yuichi Asahiro(Kyushu Sangyo Univ),  Hiroshi Eto(Kyushu Univ),  Tesshu Hanaka(Chuo Univ),  Guohui Lin(U. Alberta),  Eiji Miyano(Kyutech),  Ippei Terabaru(Kyutech),  

[Date]2020-12-04
[Paper #]COMP2020-26
A Fast ZDD-Based Method for Enumerating All Solutions of Cost-Bounded Combinatorial Problems

Shin-ichi Minato(Kyoto Univ.),  Mutsunori Banbara(Nagoya Univ.),  Takashi Horiyama(Hokkaido Univ.),  Jun Kawahara(Kyoto Univ.),  Ichigaku Takigawa(Hokkaido Univ.),  Yutaro Yamaguchi(Kyushu Univ.),  

[Date]2020-12-04
[Paper #]COMP2020-19
Fixed Parameter Algorithms for L(p,1)-labeling

Kazuma Kawai(Nagoya Univ),  Tesshu Hanaka(Chuo Univ),  Hirotaka Ono(Nagoya Univ),  

[Date]2020-12-04
[Paper #]COMP2020-24
Capacitated Network Design Games on a Generalized Fair Allocation Model

Toshiyuki Hirose(Nagoya Univ.),  Tesshu Hanaka(Chuo Univ.),  Hirotaka Ono(Nagoya Univ.),  

[Date]2020-12-04
[Paper #]COMP2020-21
An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion

Yuuki Aoike(Yokohama City Univ.),  Tatsuya Gima(Nagoya Univ.),  Tesshu Hanaka(Chuo Univ.),  Masashi Kiyomi(Yokohama City Univ.),  Yasuaki Kobayashi(Kyoto Univ.),  Yusuke Kobayashi(Kyoto Univ.),  Kazuhiro Kurita(NII),  Yota Otachi(Nagoya Univ.),  

[Date]2020-12-04
[Paper #]COMP2020-25
Counting Weave Diagrams

Tomio Hirata(Nagoya Univ.),  Isamu Matsuura(Aichi Center for Industry and Science Technology),  

[Date]2020-12-04
[Paper #]COMP2020-18
[Invited Talk] A Blossom Algorithm for Maximum Edge-Disjoint T-Paths

Satoru Iwata(Univ. of Tokyo),  Yu Yokoi(NII),  

[Date]2020-12-04
[Paper #]COMP2020-22
[Invited Talk] How many vertices does a random walk miss in a network with moderately increasing the number of vertices?

Shuji Kijima(Kyushu Univ.),  Nobutaka Shimizu(The Univ. of Tokyo),  Takeharu Shiraga(Chuo Univ.),  

[Date]2020-12-04
[Paper #]COMP2020-23