|
|
| Chair |
|
Takeshi Tokuyama (Tohoku Univ.) |
| Vice Chair |
|
Satoru Iwata (Kyoto Univ.) |
| Secretary |
|
Takashi Horiyama (Saitama Univ.), Yoshio Okamoto (Tokyo Inst. of Tech.) |
|
| Conference Date |
Thu, Sep 11, 2008 09:00 - 17:10 |
| Topics |
|
| Conference Place |
Nagoya Institute of Technology |
| Address |
Gokiso-cho, Showa-ku, Nagoya, Aichi, 466-8555 Japan |
| Transportation Guide |
http://www.nitech.ac.jp/campus/index.htm |
Contact
Person |
Prof. Koichi Wada |
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) |
Thu, Sep 11 AM
09:00 - 17:10 |
| (1) |
09:00-09:30 |
Polygons Folding to Plural Incongruent Orthogonal Boxes  COMP2008-23 |
Jun Mitani (Univ. of Tsukuba/JST), Ryuhei Uehara (JAIST) |
| (2) |
09:30-10:00 |
Counting Connected Spanning Subgraphs with at Most p+q+1 Edges in a Complete Bipartite Graph Kp,q COMP2008-24 |
Peng Cheng (Nagoya Gakuin Univ.), Shigeru Masuyama (Toyohashi Univ. of Technology) |
| |
10:00-10:15 |
Break ( 15 min. ) |
| (3) |
10:15-10:45 |
Average-case Analysis of Spectral Method for Clustering COMP2008-25 |
Ryo Sakaguchi (Tokyo Inst.Tech.) |
| (4) |
10:45-11:15 |
Analysis of a spectral method for random satisfiable 3CNF formulas COMP2008-26 |
Tomonri Ando (Tokyo Inst. Tech.) |
| (5) |
11:15-11:45 |
On presortedness measures of inputs for block sorting COMP2008-27 |
Shin'ichi Nakayama, Kojiro Kobayashi (Soka Univ.) |
| |
11:45-13:00 |
Lunch Break ( 75 min. ) |
| (6) |
13:00-14:00 |
[Invited Talk]
On the hardness of reoptimization of NP-hard problems COMP2008-28 |
Juraj Hromkovic (ETH Zurich) |
| |
14:00-14:20 |
Break ( 20 min. ) |
| (7) |
14:20-14:50 |
Convergence problem of Mobile Robots with Uniformly-Inaccurate Sensors COMP2008-29 |
Kenta Yamamoto, Taisuke Izumi, Yoshiaki Katayama, Nobuhiro Inuzuka, Koichi Wada (NIT) |
| (8) |
14:50-15:20 |
On Gathering Problem in a Ring for 2n Autonomous Mobile Robots COMP2008-30 |
Kotaro Haba, Taisuke Izumi, Yoshiaki Katayama, Nobuhiro Inuzuka, Koichi Wada (NIT) |
| (9) |
15:20-15:50 |
On Circle Formation by Four Autonomous Mobile Robots COMP2008-31 |
Keita Hashimoto, Taisuke Izumi, Yoshiaki Katayama, Nobuhiro Inuzuka, Koichi Wada (NIT) |
| |
15:50-16:10 |
Break ( 20 min. ) |
| (10) |
16:10-16:40 |
An analysis of a generalized multi-organization scheduling on unrelated parallel machines COMP2008-32 |
Fukuhito Ooshita (Osaka Univ.), Tomoko Izumi, Taisuke Izumi (Nagoya Inst. of Tech.) |
| (11) |
16:40-17:10 |
Improved Competitive Ratios of Online Buffer Management Algorithms for Multi-Queue Switches in QoS Networks COMP2008-33 |
Koji Kobayashi, Shuichi Miyazaki, Yasuo Okabe (Kyoto Univ.) |
| Contact Address and Latest Schedule Information |
| COMP |
Technical Committee on Theoretical Foundations of Computing (COMP) [Latest Schedule]
|
| Contact Address |
Takashi Horiyama
Division of Mathematics, Electronics and Informatics,
Graduate School of Science and Engineering, Saitama Univeristy
255 Shimo-Ohkubo, Sakura, Saitama 338-8570, Japan.
Phone/Fax: +81-48-858-3957
Email:      al i  i -u |
Last modified: 2008-07-25 19:53:05
|