===============================================
Technical Committee on Theoretical Foundations of Computing (COMP)
Chair: Tetsuo Asano (JAIST) Vice Chair: Kazuhisa Makino (Univ. of Tokyo)
Secretary: Akinori Kawachi (Tokyo Inst. of Tech.), Takehiro Ito (Tohoku Univ.)
DATE:
Fri, Jun 25, 2010 09:30 - 17:10
PLACE:
Room No.345, Main Building 3F, Ookayama Campus, Tokyo Institute of Technology(2-12-1, Meguro-ku, Tokyo, 152-8550, Japan.http://www.titech.ac.jp/english/about/campus/index.html. Prof. Yoshio Okamoto. +81-5734-3871(Ext.3871))
TOPICS:
----------------------------------------
Fri, Jun 25 AM (09:30 - 17:10)
----------------------------------------
(1) 09:30 - 10:05
A Fast Algorithm for Computing HOMFLY Poynomials of 2-bridge Links
Fumio Takeshita, Seiichi Tani, Masahiko Murakami (Nihon Univ.)
(2) 10:05 - 10:40
Improved Approximation Algorithms for Firefighter Problem on Trees
Yutaka Iwaikawa, Naoyuki Kamiyama, Tomomi Matsui (Chuo Univ.)
(3) 10:40 - 11:15
A Polynomial-time Algorithm for the Prize-Collecting Edge Dominating Set Problem in Trees
Naoyuki Kamiyama (Chuo Univ.)
----- Break ( 15 min. ) -----
(4) 11:30 - 12:30
[Invited Talk]
On birthday attacks and catching kangaroos
Ravi Montenegro (Univ. of Massachusetts at Lowell)
----- Break ( 90 min. ) -----
(5) 14:00 - 14:35
Line Embeddings of Complete Binary Trees
Masao Kumamoto, Eiji Miyano (Kyushu Inst. of Tech.)
(6) 14:35 - 15:10
Minimum Energy Broadcast on Rectangular Grid Wireless Networks
Atsushi Murata, Akira Matsubayashi (Kanazawa Univ.)
(7) 15:10 - 15:45
Pattern Formation Algorithm for Weak Robots Which Utilizes Scaling and Rotation Around Centroid
Yasumasa Sujaku, Kiyoaki Yoshida (Kurume Inst. of Tech.)
----- Break ( 15 min. ) -----
(8) 16:00 - 16:35
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)
(9) 16:35 - 17:10
On the Existence and Reconstruction of a Simple Graph with a Given Joint-Degree Sequence
Shigeo Shioda (Chiba Univ.)
# Information for speakers
General Talk will have 30 minutes for presentation and 5 minutes for discussion.
=== Technical Committee on Theoretical Foundations of Computing (COMP) ===
# FUTURE SCHEDULE:
Wed, Sep 29, 2010: Nagaoka Univ. of Tech. [Fri, Jul 16]
# SECRETARY:
Akinori Kawachi
Graduate School of Information Science and Engineering
Tokyo Institute of Technology
2-12-1 W8-25, Ookayama, Meguro-ku, Tokyo
Phone: +81-3-5734-3868
Email: is
Last modified: 2010-04-15 16:16:18
|
Notification: Mail addresses are partially hidden against SPAM.
|