IEICE Technical Report

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

Theoretical Foundations of Computing

Workshop Date : 2014-06-13 - 2014-06-14 / Issue Date : 2014-06-06

COMP2014-8
The Independent Feedback Vertex Set Problem
Yuma Tamura, Takehiro Ito, Xiao Zhou (Tohoku Univ.)
pp. 13 - 18

COMP2014-9
Algorithmic construction of track layouts of graph subdivisions
Miki Miyauchi (NTT)
pp. 27 - 32

COMP2014-10
A Gathering Problem for Mobile Fat Robots in a Grid without the Global Coodinate System
Yoshinobu Ito, Yoshiaki Katayama (Nagoya Inst. of Tech.), Koichi Wada (hosei Univ.)
pp. 53 - 59

COMP2014-11
Computational Complexity of Irredundancy of Local Hamiltonian
Ryo Kawasaki, Harumichi Nishimura (Nagoya Univ.)
pp. 69 - 76

COMP2014-12
On Characterizations of Randomized Computation Using Plain Kolmogorov Complexity
Shuichi Hirahara, Akitoshi Kawamura (Univ. of Tokyo)
pp. 77 - 83

COMP2014-13
A Further Improved Extended Result on Polynomial-Time Solvability of the Maximum Clique Problem
Hiroaki Nakanishi (Waseda Univ.), Etsuji Tomita, Mitsuo Wakatsuki, Tetsuro Nishino (UEC)
pp. 85 - 92

COMP2014-14
Enumeration of Polyominoes for pmg Tiling
Jun Nishioka, Takashi Horiyama (Saitama Univ.)
pp. 107 - 114

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