IEICE Technical Report

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

Theoretical Foundations of Computing

Workshop Date : 2010-09-29 / Issue Date : 2010-09-22

COMP2010-24
Run-time Analysis of Ant Colony Optimization over the Cheapest Path with a Context-dependent Cost
Atsushi Murata, Yoshinori Takei (Nagaoka Univ. of Tech.)
pp. 1 - 8

COMP2010-25
Minimum Cost Edge-Colorings of Trees Can be Reduced to Matchings
Takehiro Ito, Naoki Sakamoto, Xiao Zhou (Tohoku Univ.), Takao Nishizeki (Kwansei Gakuin Univ.)
pp. 9 - 15

COMP2010-26
In-place algorithm for Erasing a Component in a Binary Image
Tetsuo Asano (JAIST)
pp. 17 - 23

COMP2010-27
Counting and Verifying Maximal Palindromes
Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda (Kyushu Univ.)
pp. 25 - 30

COMP2010-28
A method to construct a compact automata from regular expressions
Toshinori Sakata, Hiroaki Yamamoto (Shinshu Univ.)
pp. 31 - 38

COMP2010-29
Considerations on static graphs of periodic graphs
Akihiro Hashikura, Norie Fu, Hiroshi Imai (Tokyo Univ.)
pp. 39 - 43

COMP2010-30
Neighbor Systems -- Algorithms and the Relationship with Jump Systems and Bisubmodular Polyhedra --
Akiyoshi Shioura (Tohoku Univ.)
pp. 45 - 52

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