===============================================
Technical Committee on Theoretical Foundations of Computing (COMP)
Chair: Masafumi Yamashita Vice Chair: Tatsuya Akutsu
Secretary: Keisuke Tanaka, Kunihiko Sadakane
DATE:
Thu, Oct 14, 2004 10:30 - 17:05
Fri, Oct 15, 2004 10:30 - 16:25
PLACE:
School of Engineering, Tohoku University(Aoba05, Aoba-ku, Sendai, 980-8579, Japan. 20 minutes from JR Sendai station by public bus. http://www.eng.tohoku.ac.jp/eng/map/citymap.html. Prof. Eiji Takimoto. 022-217-7148)
TOPICS:
----------------------------------------
Thu, Oct 14 AM (10:30 - 12:00)
----------------------------------------
(1) 10:30 - 11:00
Inner Rectangular Drawings of Plane Graphs
Kazuyuki Miura, Hiroki Haga, Takao Nishizeki (Tohoku Univ)
(2) 11:00 - 11:30
On the t-Safety of Key-sharing Graphs
Yasuhito Asano, Takaaki Mizuki, Takao Nishizeki (Tohoku Univ.)
(3) 11:30 - 12:00
Approximation algorithms for the bipartite dense subgraph problem
Akiko Suzuki, Takeshi Tokuyama (Tohoku Univ.)
----- Lunch Break ( 90 min. ) -----
----------------------------------------
Thu, Oct 14 PM (13:30 - 17:05)
----------------------------------------
(1) 13:30 - 14:30
[Tutorial Lecture]
Kazuyuki Tanaka (Tohoku Univ.)
----- Break ( 15 min. ) -----
(2) 14:45 - 15:15
Boosting Based on Divide and Merge
Eiji Takimoto, Syuhei Koya, Akira Maruoka (Tohoku Univ.)
(3) 15:15 - 15:45
On the Monotone Circuit Complexity of Quadratic Boolean Functions
Kazuyuki Amano, Akira Maruoka (Tohoku Univ.)
(4) 15:45 - 16:15
Multicoloring Unit Disk Graphs on Triangular Lattice Points
Yuichiro Miyamoto (Sophia Univ.), Tomomi Matsui (Univ. Tokyo)
(5) 16:15 - 16:45
Shuji Kijima, Tomomi Matsui (Univ. Tokyo)
(6) 16:45 - 17:05
An Effcient Mining Algorithm for Frequent Closed Sequential Episodes
Hiroki Arimura (Hokkaido Univ.), Takeaki Uno (NII)
----------------------------------------
Fri, Oct 15 AM (10:30 - 12:00)
----------------------------------------
(1) 10:30 - 11:00
Tiling Problems with the Edge-Overwriting Rule
Kazuo Iwama (Kyoto Univ.), Kousuke Izumi, Eiji Miyano (Kyushu Inst. Tech.), Hirotaka Ono (Kyushu Univ.)
(2) 11:00 - 11:30
Mining Frequent Trees with Node-Inclusion Constraints
Atsuyoshi Nakamura, Mineichi Kudo (Hokkaido Univ.)
(3) 11:30 - 12:00
Experimental Study of Compressed Full-Text Index Construction
Kunihiko Sadakane (Kyushu Univ.)
----- Lunch Break ( 90 min. ) -----
----------------------------------------
Fri, Oct 15 PM (13:30 - 16:25)
----------------------------------------
(1) 13:30 - 14:30
[Tutorial Lecture]
Algorithm Aspect of Graph Minor Theory
Ken-ichi Kawarabayashi (Tohoku Univ.)
----- Break ( 15 min. ) -----
(2) 14:45 - 15:05
Mizue Ushijima, Akihiro Fujiwara (Kyushu Inst. Tech.)
(3) 15:05 - 15:25
()
(4) 15:25 - 15:55
A Local Search Algorithm for Barrier Heights Estimation in DNA computing
Tsutomu Takeda, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyushu Univ.)
(5) 15:55 - 16:25
An algorithm for computing the Holevo capacity of 1-qubit channel with using computational gemetry
Mayumi Oto, Hiroshi Imai (Univ. of Tokyo), Keiko Imai (Chuo Univ.)
----- -----
=== Technical Committee on Theoretical Foundations of Computing (COMP) ===
# FUTURE SCHEDULE:
Fri, Dec 10, 2004: Toho University [Sat, Oct 23]
Fri, Jan 28, 2005: Nagoya University [Wed, Nov 24]
Last modified: 2004-10-01 19:12:13
|
Notification: Mail addresses are partially hidden against SPAM.
|