|
|
| Chair |
|
Shin-ichi Nakano (Gunma Univ.) |
| Secretary |
|
Ryuhei Uehara (JAIST), Shuji Kijima (Kyushu Univ.), Katsuhisa Yamanaka (UEC) |
|
|
|
| Chair |
|
Takeshi Tokuyama (Tohoku Univ.) |
| Vice Chair |
|
Satoru Iwata (Kyoto Univ.) |
| Secretary |
|
Yoshio Okamoto (Tokyo Inst. of Tech.), Takashi Horiyama (Saitama Univ.) |
|
| Conference Date |
Wed, May 19, 2010 10:00 - 17:20 |
| Topics |
|
| Conference Place |
Japan Advanced Institute of Science and Technology |
| Address |
Asahidai 1-1, Nomi, Ishikawa, 923-1292 Japan |
| Transportation Guide |
http://www.jaist.ac.jp/general_info/access/index.html |
Contact
Person |
Prof. Tetsuo Asano, Prof. Ryuhei Uehara |
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) |
Wed, May 19
10:00 - 17:20 |
(1)
COMP |
10:00-10:35 |
Voronoi Game on a Path  COMP2010-10 |
Masashi Kiyomi (JAIST), Toshiki Saitoh (JST), Ryuhei Uehara (JAIST) |
| (2) |
10:35-11:10 |
|
| (3) |
11:10-11:45 |
|
| |
11:45-13:15 |
Lunch Break ( 90 min. ) |
| (4) |
13:15-14:15 |
|
| |
14:15-14:30 |
Break ( 15 min. ) |
(5)
COMP |
14:30-15:05 |
Efficient Pattern Matching for Acyclic Regular Expressions COMP2010-11 |
Yusaku Kaneta, Shin-ichi Minato, Hiroki Arimura (Hokkaido Univ.) |
(6)
COMP |
15:05-15:40 |
Binary Image Processing with Limited Storage COMP2010-12 |
Tetsuo Asano (JAIST), Sergey Bereg (Univ. of Texas at Dallas, USA), Lilian Buzer (Univ. Paris-Est/LABINFO-IGM), David Kirkpatrick (Univ. of British Columbia) |
| |
15:40-15:55 |
Break ( 15 min. ) |
(7)
COMP |
15:55-16:30 |
On the t-pebbling number of weighted graphs COMP2010-13 |
Michael Hoffmann (Inst. of Theoretical Computer Sci, ETH Zurich), Jiri Matousek (Charles Univ.), Yoshio Okamoto (Tokyo Inst. of Tech.), Philipp Zumstein (Inst. of Theoretical Computer Sci, ETH Zurich) |
(8)
COMP |
16:30-17:05 |
Spanning tree congestion of k-outerplanar graphs COMP2010-14 |
Hans L. Bodlaender (Utrecht Univ.), Kyohei Kozawa (J-POWER), Takayoshi Matsushima (Gunma Univ.), Yota Otachi (Tohoku Univ.) |
| (9) |
17:05-17:20 |
|
| Announcement for Speakers |
| General Talk | Each speech will have 25 minutes for presentation and 10 minutes for discussion. |
| General Talk (short talk) | Each speech will have 10 minutes for presentation and 5 minutes for discussion. |
| Contact Address and Latest Schedule Information |
| IPSJ-AL |
Special Interest Group on Algorithms (IPSJ-AL) [Latest Schedule]
|
| Contact Address |
|
| 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: 2010-05-09 22:56:45
|