IEICE Technical Committee Submission System
Advance Program
Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top  Go Back   Prev COMP Conf / Next COMP Conf [HTML] / [HTML(simple)] / [TEXT]  [Japanese] / [English] 

===============================================
Technical Committee on Theoretical Foundations of Computing (COMP)
Chair: Masafumi Yamashita Vice Chair: Tatsuya Akutsu
Secretary: Kunihiko Sadakane, Keisuke Tanaka

DATE:
Wed, Apr 26, 2006 09:20 - 16:55

PLACE:
(http://www.media.kyoto-u.ac.jp/access/. 075-753-7418)

TOPICS:


----------------------------------------
Wed, Apr 26 AM (09:20 - 10:30)
----------------------------------------

(1) 09:20 - 09:55
Optimality of Balanced Semi-Matchings
Yuta Harada, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyushu Univ.)

(2) 09:55 - 10:30
Reducing L versus P to Reversal versus Access
Kenya Ueno (Univ. of Tokyo)

----- Break ( 20 min. ) -----

----------------------------------------
Wed, Apr 26 AM (10:50 - 12:00)
----------------------------------------

(3) 10:50 - 11:25
Polygonal Curve Approximation Using Grid Points with Application to a Triangular Mesh Generation with Small Number of Different Edge Lengths
Shin-ichi Tanigawa, Naoki Katoh (Kyoto Univ.)

(4) 11:25 - 12:00
Efficient Broadcasting and Gathering Algorithms on Dynamic Sensor Networks
Naoki Inaba, Jiro Uchida, Yoshiaki Katayama (Nagoya Inst. of Tech.), Wei Chen (Tennessee State Univ.), Koichi Wada (Nagoya Inst. of Tech.)

----- Lunch Break, Steering Comittee ( 100 min. ) -----

----------------------------------------
Wed, Apr 26 PM (13:40 - 15:25)
----------------------------------------

(5) 13:40 - 14:15
Searching Scale-Free Networks with Local Information
Yuichi Kurumida, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyushu Univ.)

(6) 14:15 - 14:50
An Efficient Algorithm for Evacuation Problem in Dynamic Network Flows with Uniform Arc Capacity
Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa (Kyoto Univ.)

(7) 14:50 - 15:25
An Efficient Alignability Decision Algorithm for Unordered Trees
Tetsuji Kuboyama, Kilho Shin (Univ. of Tokyo)

----- Break ( 20 min. ) -----

----------------------------------------
Wed, Apr 26 PM (15:45 - 16:55)
----------------------------------------

(8) 15:45 - 16:20
A simple algorithm for testing isomorphism of chordal graphs
Seinosuke Toda (Nihon Univ.)

(9) 16:20 - 16:55
An exact algorithm for the label placement problem
Yuichi Inoue, Kazuaki Yamaguchi, Sumio Masuda (Kobe Univ.)



=== Technical Committee on Theoretical Foundations of Computing (COMP) ===
# FUTURE SCHEDULE:

Wed, May 24, 2006: Kyushu Institute of Technology [Wed, Mar 22]
Fri, Jun 23, 2006: Saitama Univ. [Fri, Apr 21]

# SECRETARY:



Last modified: 2006-02-24 16:26:35


Notification: Mail addresses are partially hidden against SPAM.

[Download Paper's Information (in Japanese)] <-- Press download button after click here.
 

[Presentation and Participation FAQ] (in Japanese)
 
[Cover and Index of IEICE Technical Report by Issue]
 

[Return to COMP Schedule Page]   /  
 
 Go Top  Go Back   Prev COMP Conf / Next COMP Conf [HTML] / [HTML(simple)] / [TEXT]  [Japanese] / [English] 


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan