|
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, Mar 9, 2011 10:00 - 16:40 |
Topics |
|
Conference Place |
6410 No.6 Bldg, Korakuen Campus, Chuo University |
Address |
1-13-27 Kasuga, Bunkyo-ku, Tokyo, 112-8551 Japan |
Transportation Guide |
http://www.chuo-u.ac.jp/chuo-u/access/access_korakuen_j.html |
Contact Person |
Naoyuki Kamiyama and Keiko Imai
+81-3-3817-1692 |
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, Mar 9 10:00 - 16:40 |
(1) |
10:00-10:35 |
The Digital Principle and the Listening Automaton
-- The Mechanisms to generate human evolutions -- COMP2010-47 |
Kimiaki Tokumaru (System Engineer) |
(2) |
10:35-11:10 |
Communication-Efficient Broadcast on Markovian Evolving Graphs COMP2010-48 |
Kei Matsubara, Taisuke Izumi, Koichi Wada (NIT) |
|
11:10-13:00 |
Break ( 110 min. ) |
(3) |
13:00-13:35 |
New k shortest simple path algorithm that reduces the average case time complexity COMP2010-49 |
Hiroshi Matsuura (NTT) |
(4) |
13:35-14:10 |
Evaluation of metaheuristic algorithms for Spanning Tree Congestion COMP2010-50 |
Daiki Maruta (Gunma Univ.), Yota Otachi (Tohoku Univ.), Koichi Yamazaki (Gunma Univ.) |
(5) |
14:10-14:45 |
Constant-time approximation algorithms for the knapsack problem COMP2010-51 |
Hiro Ito, Susumu Kiyoshima, Yuichi Yoshida (Kyoto Univ.) |
|
14:45-15:10 |
Break ( 25 min. ) |
(6) |
15:10-15:30 |
Recognition of Basic Planar Objects Using Computational Geometry Methods COMP2010-52 |
Yoshihiro Hirashiki, Tetsuo Asano (JAIST) |
(7) |
15:30-16:05 |
Algorithms for Covering Digraphs by Length-Bounded Paths COMP2010-53 |
Kenji Sejima, Takuro Fukunaga, Hiroshi Nagamochi (Kyoto Univ.) |
(8) |
16:05-16:40 |
Reconfiguration of List Edge-Colorings in a Tree COMP2010-54 |
Kazuto Kawamura, Takehiro Ito, Xiao Zhou (Tohoku Univ.) |
Announcement for Speakers |
General Talk | Each speech will have 25 minutes for presentation and 10 minutes for discussion. |
General Talk (ショートトーク) | Each speech will have 15 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: 2011-02-16 15:34:47
|