Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380
[TOP] | [2014] | [2015] | [2016] | [2017] | [2018] | [2019] | [2020] | [Japanese] / [English]
COMP2017-1
(See Japanese page.)
pp. 1 - 8
COMP2017-2
An RBT Decision Tree Construction for Sparse Rules
Takashi Harada, Ken Tanaka (Kanagawa Univ.), Kenji Mikawa (Niigata Univ.)
pp. 9 - 15
COMP2017-3
Bulk Execution of the Dynamic Programming for the Optimal Polygon Triangulation on the GPU
Kohei Yamashita, Yasuaki Ito, Koji Nakano (Hiroshima Univ.)
pp. 17 - 22
COMP2017-4
A GPU Implementation of the Smith-Waterman Algorithm using Bitwise Parallel Bulk Computation Technique
Takahiro Nishimura (Hiroshima Univ.), Jacir L. Bordim (UnB), Yasuaki Ito, Koji Nakano (Hiroshima Univ.)
pp. 23 - 30
COMP2017-5
Acute Constrains in Straight-Line Drawings of Planar Graphs
Akane Seto, Aleksandar Shurbevski, Hiroshi Nagamochi (Kyoto Univ.)
pp. 31 - 38
COMP2017-6
Approximating Bounded Degree Deletion via Matroid Matching
Toshihiro Fujito (TUT)
pp. 39 - 45
COMP2017-7
Approximability of the distance independent set problem on cubic graphs
Hiroshi Eto (Kyushu Univ), Takehiro Ito (Tohoku Univ), Zhilong Liu, Eiji Miyano (Kyutech)
pp. 47 - 54
COMP2017-8
Practical Linear-Time Algorithm for Estimation of Silhouette after Folding Crease Pattern
Koji Ouchi, Kazuaki Yamazaki, Ryuhei Uehara (JAIST)
pp. 55 - 60
COMP2017-9
λ Group Strategy Proof Mechanisms for the Obnoxious Facility Game in Star Networks
Yuhei Fukui, Aleksandar Shurbevski, Hiroshi Nagamochi (Kyoto Univ.)
pp. 61 - 68
COMP2017-10
Automatic Drawing for Metro Maps in Tokyo
Masahiro Onda, Masaki Moriguchi, Keiko Imai (Chuo Univ.)
pp. 69 - 76
COMP2017-11
On Equivalence of de Bruijn Graphs and State-minimized Finite Automata
Yoshiaki Takahashi (Solar), Akira Ito (Yamaguchi Univ.)
pp. 77 - 83
COMP2017-12
Design Conditions and Optimization for RT-level Circuit with Rollback Mechanism
Keisuke Inoue (KTC)
pp. 85 - 89
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.