|
|
| Chair |
|
Takeshi Tokuyama (Tohoku Univ.) |
| Vice Chair |
|
Satoru Iwata (Kyoto Univ.) |
| Secretary |
|
Yoshio Okamoto (Tokyo Inst. of Tech.), Takashi Horiyama (Saitama Univ.) |
|
| Conference Date |
Mon, Jun 29, 2009 10:00 - 16:00 |
| Topics |
|
| Conference Place |
Hokkaido University |
| Address |
North14 West9, Sapporo, 060-0814, Japan |
| Transportation Guide |
http://www.hokudai.ac.jp/bureau/info-j/johokan-map.htm |
Contact
Person |
Prof. Shin-ichi Minato |
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) |
Mon, Jun 29 AM
10:00 - 11:45 |
| (1) |
10:00-10:35 |
Compressed Pattern Matching on VF Codes  COMP2009-18 |
Takuya Kida (Hokkaido Univ.) |
| (2) |
10:35-11:10 |
Reconfiguration of List Edge-Colorings in a Graph COMP2009-19 |
Takehiro Ito (Tohoku Univ.), Marcin Kaminski (Univ. Libre de Bruxelles), Erik D. Demaine (MIT) |
| (3) |
11:10-11:45 |
The Longest Path Problem and Its Application to the Path Selection in JR Urban Areas COMP2009-20 |
Takashi Horiyama, Kosuke Higuchi (Saitama Univ.) |
Mon, Jun 29 PM
13:30 - 14:40 |
| (4) |
13:30-14:05 |
Algorithms for optimal segmentation of regions decomposable into basic shapes COMP2009-21 |
Ryosei Kasai, Jinhee Chun, Matias Korman, Takeshi Tokuyama (Tohoku Univ.) |
| (5) |
14:05-14:40 |
Approximating Edit Distance of Unordered Trees of Bounded Height COMP2009-22 |
Daiji Fukagawa (NII), Tatsuya Akutsu (Kyoto Univ.), Atsuhiro Takasu (NII) |
Mon, Jun 29 PM
14:50 - 16:00 |
| (6) |
14:50-15:25 |
A Polynomial-time Perfect Sampler for the Q-Ising with a Vertex-Independent Noise COMP2009-23 |
Masaki Yamamoto (Tokai Univ.), Shuji Kijima (Kyoto Univ.), Yasuko Matsui (Tokai Univ.) |
| (7) |
15:25-16:00 |
Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes COMP2009-24 |
Yoshio Okamoto (Tokyo Inst. of Tech.), Ryuhei Uehara (JAIST), Takeaki Uno (NII) |
| Announcement for Speakers |
| General Talk | Each speech will have 25 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-04-17 09:43:20
|