IEICE Technical Report

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

Theoretical Foundations of Computing

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

COMP2011-22
A PTAS for the Subset Sum Reconfiguration Problem
Takehiro Ito (Tohoku Univ.), Erik D. Demaine (MIT)
pp. 7 - 14

COMP2011-23
On A DAG Constructing Self-stabilizing Protocol for GeoCast in MANET
Koichi Ito, Yoshiaki Katayama, Koichi Wada, Naohisa Takahashi (Nitech)
pp. 23 - 30

COMP2011-24
Experimental Evaluation of Algorithm for Minimum-Weight Rooted Not-Necessarily-Spanning Arborescence Problem
Yusuke Abe, Eishi Chiba (Hosei Univ.)
pp. 39 - 45

COMP2011-25
Extended Pseudo-tree Pattern Matching with labels of strings
Hiroaki Yamamoto (Shinshu Univ.), Takashi Miyazaki (Nagano NCT)
pp. 53 - 60

COMP2011-26
Lower Bounds for Linear Decision Trees via An Energy Complexity Argument
Kei Uchizawa (Tohoku Univ.), Eiji Takimoto (Kyushu Univ.)
pp. 67 - 73

COMP2011-27
Unfoldings of Platonic Solids with Minimum/Maximum Diameter, Width, and Enclosing-Rectangle
Takashi Horiyama, Wataru Shoji (Saitama Univ.)
pp. 83 - 89

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