|
|
| Chair |
|
Takeshi Tokuyama (Tohoku Univ.) |
| Vice Chair |
|
Satoru Iwata (Kyoto Univ.) |
| Secretary |
|
Yoshio Okamoto (Tokyo Inst. of Tech.), Takashi Horiyama (Saitama Univ.) |
|
| Conference Date |
Fri, Oct 16, 2009 10:00 - 16:35 |
| Topics |
|
| Conference Place |
Tohoku University |
Contact
Person |
Prof. Jinhee Chun |
Copyright
and
reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
Fri, Oct 16 AM
10:00 - 11:45 |
| (1) |
10:00-10:35 |
On simultaneous optimal segmentation of digital objects  COMP2009-32 |
Jinhee Chun, Ryosei Kasai, Matias Korman, Takeshi Tokuyama (Tohoku Univ.) |
| (2) |
10:35-11:10 |
Small Grid Drawings of Planar Graphs with Balanced Bipartition COMP2009-33 |
Xiao Zhou, Takashi Hikino, Takao Nishizeki (Tohoku Univ.) |
| (3) |
11:10-11:45 |
Reformulation of the scheme for computing tree-width and minimum fill-in COMP2009-34 |
Masanobu Furuse, Yota Otachi, Koichi Yamazaki (Gunma Univ.) |
| |
11:45-13:30 |
Lunch Break ( 105 min. ) |
Fri, Oct 16 PM
13:30 - 14:30 |
| (4) |
13:30-14:30 |
[Invited Talk]
Algorithms for Conflict Resolution COMP2009-35 |
Dao-Zhi Zeng (Tohoku Univ.) |
| |
14:30-14:50 |
Break ( 20 min. ) |
Fri, Oct 16 PM
14:50 - 16:35 |
| (5) |
14:50-15:25 |
Algorithm for Finding Minimum Reaction Cut of Metabolic Network COMP2009-36 |
Takeyuki Tamura (Kyoto Univ.), Kazuhiro Takemoto (Univ. of Tokyo.), Tatsuya Akutsu (Kyoto Univ.) |
| (6) |
15:25-16:00 |
An Improved Approximation Lower Bound for Maximum Cardinality Almost Stable Matching Problem COMP2009-37 |
Koki Hamada, Shuichi Miyazaki, Kazuo Iwama (Kyoto Univ.) |
| (7) |
16:00-16:35 |
Breaking the Rectangle Bound Barrier against Formula Size Lower Bounds COMP2009-38 |
Kenya Ueno (Univ. of Tokyo) |
| Announcement for Speakers |
| General Talk | Each speech will have 25 minutes for presentation and 10 minutes for discussion. |
| Invited Talk | Each speech will have 50 minutes for presentation and 10 minutes for discussion. |
| Contact Address and Latest Schedule Information |
| COMP |
Technical Committee on Theoretical Foundations of Computing (COMP) [Latest Schedule]
|
| Contact Address |
Yoshio Okamoto
Graduate School of Information Science and Engineering
Tokyo Institute of Technology
2-12-1-W8-88, Ookayama, Meguro-ku, Tokyo
Phone: +81-3-5734-3871
Email:     is    |
Last modified: 2009-08-20 22:10:19
|