|
|
| Chair |
|
Tetsuo Asano (JAIST) |
| Vice Chair |
|
Kazuhisa Makino (Univ. of Tokyo) |
| Secretary |
|
Akinori Kawachi (Tokyo Inst. of Tech.), Takehiro Ito (Tohoku Univ.) |
|
| Conference Date |
Wed, Sep 29, 2010 10:00 - 16:20 |
| Topics |
|
| Conference Place |
Nagaoka University of Technology |
| Address |
1603-1, Kamitomiokamachi, Nagaoka, Niigata |
| Transportation Guide |
http://www.nagaokaut.ac.jp/j/access/ |
Contact
Person |
Prof. Yoshinori Takei
+81-258-47-9522 |
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, Sep 29 AM
10:00 - 16:20 |
| (1) |
10:00-10:35 |
Run-time Analysis of Ant Colony Optimization over the Cheapest Path with a Context-dependent Cost  COMP2010-24 |
Atsushi Murata, Yoshinori Takei (Nagaoka Univ. of Tech.) |
| (2) |
10:35-11:10 |
Minimum Cost Edge-Colorings of Trees Can be Reduced to Matchings COMP2010-25 |
Takehiro Ito, Naoki Sakamoto, Xiao Zhou (Tohoku Univ.), Takao Nishizeki (Kwansei Gakuin Univ.) |
| (3) |
11:10-11:45 |
In-place algorithm for Erasing a Component in a Binary Image COMP2010-26 |
Tetsuo Asano (JAIST) |
| |
11:45-13:30 |
Break ( 105 min. ) |
| (4) |
13:30-14:05 |
Counting and Verifying Maximal Palindromes COMP2010-27 |
Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda (Kyushu Univ.) |
| (5) |
14:05-14:40 |
A method to construct a compact automata from regular expressions COMP2010-28 |
Toshinori Sakata, Hiroaki Yamamoto (Shinshu Univ.) |
| |
14:40-15:10 |
Break ( 30 min. ) |
| (6) |
15:10-15:45 |
Considerations on static graphs of periodic graphs COMP2010-29 |
Akihiro Hashikura, Norie Fu, Hiroshi Imai (Tokyo Univ.) |
| (7) |
15:45-16:20 |
Neighbor Systems
-- Algorithms and the Relationship with Jump Systems and Bisubmodular Polyhedra -- COMP2010-30 |
Akiyoshi Shioura (Tohoku Univ.) |
| Announcement for Speakers |
| General Talk | Each speech will have 30 minutes for presentation and 5 minutes for discussion. |
| Contact Address and Latest Schedule Information |
| COMP |
Technical Committee on Theoretical Foundations of Computing (COMP) [Latest Schedule]
|
| Contact Address |
Akinori Kawachi
Graduate School of Information Science and Engineering
Tokyo Institute of Technology
2-12-1 W8-25, Ookayama, Meguro-ku, Tokyo
Phone: +81-3-5734-3868
Email:     is    |
Last modified: 2010-07-26 13:09:17
|