IEICE Technical Report

Print edition: ISSN 0913-5685      Online edition: ISSN 2432-6380

Volume 116, Number 211

Theoretical Foundations of Computing

Workshop Date : 2016-09-06 / Issue Date : 2016-08-30

[PREV] [NEXT]

[TOP] | [2013] | [2014] | [2015] | [2016] | [2017] | [2018] | [2019] | [Japanese] / [English]

[PROGRAM] [BULK PDF DOWNLOAD]


Table of contents

COMP2016-14
Counting the number of solutions for peg solitaire
Itsuki Kanemoto, Toshiki Saitoh (Kobe Univ.), Masashi Kiyomi (Yokohama City Univ.), Ryuhei Uehara (JAIST)
pp. 1 - 5

COMP2016-15
Gathering of mobile agents in Byzantine environments with authenticated whiteboards
Masashi Tsuchida, Fukuhito Ooshita, Michiko Inoue (NAIST)
pp. 7 - 14

COMP2016-16
On the inapproximability of the Frobenius problem and its relationship with the covering radius problem
Shunichi Matsubara (Aoyama Gakuin Univ.)
pp. 15 - 16

COMP2016-17
Games with a Single Pile of Stones and Number Theoretic Problems
Yoshihiro Tsukamura (SONY), Yoshihide Igarashi, Yuta Urabe, Koichi Yamazaki (Gunma Univ.)
pp. 17 - 24

COMP2016-18
(See Japanese page.)
pp. 25 - 28

COMP2016-19
On Enumeration of Spatial Proximity Patterns by Rectangle of Fixed Range in two Dimensions
Tomoaki Ogasawara, Hiroshi Imai (Univ. of Tokyo), Takuya Kida (Hokkaido Univ.)
pp. 29 - 35

COMP2016-20
An algorithm for an optimal sink location problem in dynamic tree networks on condition that minimize the total evacuation time
Naoki Takahashi, Naoki Katoh (Kwansei Gakuin Univ), Yuya Higashikawa (Chuo Univ)
pp. 37 - 44

COMP2016-21
A 2-dimensional topological representation theorem for rank 4 matroid polytopes
Hiroyuki Miyata (Gunma Univ.)
pp. 45 - 52

COMP2016-22
Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs
Kenjiro Takazawa (Hosei Univ.)
pp. 53 - 60

Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan