Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380
[TOP] | [2013] | [2014] | [2015] | [2016] | [2017] | [2018] | [2019] | [Japanese] / [English]
COMP2016-50
Development of Peg Solitaire Font
Taishi Oikawa (Ichinoseki National College of Tech.), Kazuaki Yamazaki, Tomoko Taniguchi, Ryuhei Uehara (JAIST)
pp. 1 - 4
COMP2016-51
Recognizing Simple-Triangle Graphs by Restricted 2-Chain Subgraph Cover
Asahi Takaoka (Kanagawa Univ.)
pp. 5 - 9
COMP2016-52
Extension of the Vertex Cover Problem to the Size-t Cycle Cover Problems
Batchunag Dashdemberel, Osamu Watanabe (Tokyo Tech.)
pp. 11 - 18
COMP2016-53
[Invited Talk]
Beating Brute Force for Systems of Polynomial Equations over Finite Fields
Daniel Lokshtanov (U. Bergen), Ramamohan Paturi (UC San Diego), Suguru Tamaki (Kyoto U.), Ryan Williams (MIT), Huacheng Yu (Stanford U.)
p. 19
COMP2016-54
An Optimal Online Graph Search Algorithm in terms of the Number of Searchers
Takahiro Yakami, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita (Kyushu Univ.)
pp. 21 - 28
COMP2016-55
Improved Analysis of Greedy Algorithm for Sorting k-Sets in Bins
Kento Shimizu, Tatsuya Mitsuhashi, Kazuhisa Seto (Seikei Univ.)
pp. 29 - 32
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.