|
|
| Chair |
|
Shin-ichi Nakano (Gunma Univ.) |
| Secretary |
|
Ryuhei Uehara (JAIST), Katsuhisa Yamanaka (Iwate Univ.), Shuji Kijima (Kyushu Univ.) |
|
|
|
| Chair |
|
Tetsuo Asano (JAIST) |
| Vice Chair |
|
Kazuhisa Makino (Univ. of Tokyo) |
| Secretary |
|
Takehiro Ito (Tohoku Univ.), Akinori Kawachi (Tokyo Inst. of Tech.) |
|
| Conference Date |
Mon, May 14, 2012 10:00 - 17:00 |
| Topics |
|
| Conference Place |
Center for Information Technology, Ehime University |
| Address |
Matsuyama City, Ehime 790-8577 |
| Transportation Guide |
Please see the following website.
http://www.ehime-u.ac.jp/english/about/location/johoku.html |
Contact
Person |
Prof. Yasuyuki KAWAMURA (Ehime Univ.) |
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, May 14
10:00 - 17:00 |
| (1) |
10:00-10:35 |
Compact Codes for L-drawings
Md. Rezaul Karim (Univ. of Dhaka), Shin-ichi Nakano (Gunma Univ.), Md. Saidur Rahman (BUET) |
(2)
COMP |
10:35-11:10 |
Algorithms for Uniform Deployment of Mobile Agents on Synchronous Rings  COMP2012-8 |
Toshiya Mega, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ.) |
(3)
COMP |
11:10-11:45 |
Algorithms for partial rendezvous of mobile agents in asynchronous rings COMP2012-9 |
Masahiro Shibata, Shinji Kawai, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ) |
| |
11:45-13:15 |
Lunch Break ( 90 min. ) |
| (4) |
13:15-13:50 |
Constant Amortized Time Enumeration of Bounded-Size Subtrees in Trees
Kunihiro Wasa (Hokkaido Univ.)，Takeaki Uno (NII)，Hiroki
Arimura (Hokkaido Univ.) |
| (5) |
13:50-14:25 |
Sufficient Conditions for Completely Independent Spanning Trees
Toru Araki (Gunma Univ.) |
(6)
COMP |
14:25-15:00 |
Dijkstra Algorithm Viewed from Discrete Convex Analysis COMP2012-10 |
Kazuo Murota (Univ. of Tokyo), Akiyoshi Shioura (Tohoku Univ.) |
| |
15:00-15:15 |
Break ( 15 min. ) |
(7)
COMP |
15:15-15:50 |
On Context-free Languages That Cannot Be Recognized by Limited Backtrack Top-down Parsers COMP2012-11 |
Shunichi Matsubara (Aoyama Gakuin Univ.) |
| (8) |
15:50-16:25 |
Non-overlapping random dot pattern generation using nonlinear optimization
Takashi Imamichi, Hidetoshi Numata, Tsuyoshi Ide (IBM) |
| (9) |
16:25-17:00 |
The Number of Different Unfoldings of Polyhedra
Takashi Horiyama, Wataru Shoji (Saitama Univ.) |
| Announcement for Speakers |
| General Talk | Each speech will have 25 minutes for presentation and 10 minutes for discussion. |
| Contact Address and Latest Schedule Information |
| IPSJ-AL |
Special Interest Group on Algorithms (IPSJ-AL) [Latest Schedule]
|
| Contact Address |
Katsuhisa YAMANAKA
Faculty of Engineering,
Iwate University
Ueda 4-3-5, Morioka, Iwate
020-8551, Japan
     cis i  -u |
| COMP |
Technical Committee on Theoretical Foundations of Computing (COMP) [Latest Schedule]
|
| Contact Address |
Takehiro ITO
Graduate School of Information Sciences,
Tohoku University.
Aramaki aza Aoba 6-6-05, Aoba-ku Sendai
980-8579, Japan
Email:     ecei   |
Last modified: 2012-04-06 14:39:21
|