IEICE Technical Report

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

Theoretical Foundations of Computing

Workshop Date : 2010-06-25 / Issue Date : 2010-06-18

COMP2010-15
A Fast Algorithm for Computing HOMFLY Poynomials of 2-bridge Links
Fumio Takeshita, Seiichi Tani, Masahiko Murakami (Nihon Univ.)
pp. 1 - 8

COMP2010-16
Improved Approximation Algorithms for Firefighter Problem on Trees
Yutaka Iwaikawa, Naoyuki Kamiyama, Tomomi Matsui (Chuo Univ.)
pp. 9 - 12

COMP2010-17
A Polynomial-time Algorithm for the Prize-Collecting Edge Dominating Set Problem in Trees
Naoyuki Kamiyama (Chuo Univ.)
pp. 13 - 19

COMP2010-18
[Invited Talk] On birthday attacks and catching kangaroos
Ravi Montenegro (Univ. of Massachusetts at Lowell)
p. 21

COMP2010-19
Line Embeddings of Complete Binary Trees
Masao Kumamoto, Eiji Miyano (Kyushu Inst. of Tech.)
pp. 23 - 28

COMP2010-20
Minimum Energy Broadcast on Rectangular Grid Wireless Networks
Atsushi Murata, Akira Matsubayashi (Kanazawa Univ.)
pp. 29 - 35

COMP2010-21
Pattern Formation Algorithm for Weak Robots Which Utilizes Scaling and Rotation Around Centroid
Yasumasa Sujaku, Kiyoaki Yoshida (Kurume Inst. of Tech.)
pp. 37 - 44

COMP2010-22
A Constant Work Space Algorithm for Finding Nearest Larger Neighbors
Tetsuo Asano (JAIST), Sergey Bereg (Univ. of Texas at Dallas), David Kirkpatrick (Univ. of British Columbia)
pp. 45 - 52

COMP2010-23
On the Existence and Reconstruction of a Simple Graph with a Given Joint-Degree Sequence
Shigeo Shioda (Chiba 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