Online edition: ISSN 2432-6380
[TOP] | [2017] | [2018] | [2019] | [2020] | [2021] | [2022] | [2023] | [Japanese] / [English]
COMP2020-18
Counting Weave Diagrams
Tomio Hirata (Nagoya Univ.), Isamu Matsuura (Aichi Center for Industry and Science Technology)
pp. 1 - 7
COMP2020-19
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.)
pp. 8 - 15
COMP2020-20
Efficient Construction of Cryptarithm Catalogues over DFA
Koya Watanabe, Diptarama Hendrian, Ryo Yoshinaka (Tohoku Univ.), Takashi Horiyama (Hokkaido Univ.), Ayumi Shinohara (Tohoku Univ.)
pp. 16 - 23
COMP2020-21
Capacitated Network Design Games on a Generalized Fair Allocation Model
Toshiyuki Hirose (Nagoya Univ.), Tesshu Hanaka (Chuo Univ.), Hirotaka Ono (Nagoya Univ.)
pp. 24 - 27
COMP2020-22
[Invited Talk]
A Blossom Algorithm for Maximum Edge-Disjoint T-Paths
Satoru Iwata (Univ. of Tokyo), Yu Yokoi (NII)
p. 28
COMP2020-23
[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.)
p. 29
COMP2020-24
Fixed Parameter Algorithms for L(p,1)-labeling
Kazuma Kawai (Nagoya Univ), Tesshu Hanaka (Chuo Univ), Hirotaka Ono (Nagoya Univ)
pp. 30 - 32
COMP2020-25
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, Yusuke Kobayashi (Kyoto Univ.), Kazuhiro Kurita (NII), Yota Otachi (Nagoya Univ.)
pp. 33 - 38
COMP2020-26
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, Ippei Terabaru (Kyutech)
pp. 39 - 43
COMP2020-27
Quantum sampling verification with offline quantum communication
Taiga Hiroka (Kyoto Univ), Yuki Takeuchi (NTT CS Lab.), Tomoyuki Morimae (Kyoto Univ)
pp. 44 - 50
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.