|
|
| Chair |
|
Koichi Wada (Hosei Univ.) |
| Vice Chair |
|
Toshimitsu Masuzawa (Osaka Univ.) |
| Secretary |
|
Sayaka Kamei (Hiroshima Univ.), Hisashi Koga (Univ. of Electro-Comm.) |
|
| Conference Date |
Fri, Jun 13, 2014 13:05 - 17:45
Sat, Jun 14, 2014 09:00 - 14:45 |
| Topics |
|
| Conference Place |
|
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) |
Fri, Jun 13 PM
13:00 - 17:45 |
| (1) |
13:05-13:30 |
|
| (2) |
13:30-13:55 |
|
(3)
COMP |
13:55-14:20 |
The Independent Feedback Vertex Set Problem  COMP2014-8 |
Yuma Tamura, Takehiro Ito, Xiao Zhou (Tohoku Univ.) |
| |
14:20-14:35 |
Break ( 15 min. ) |
| (4) |
14:35-15:00 |
|
(5)
COMP |
15:00-15:25 |
Algorithmic construction of track layouts of graph subdivisions COMP2014-9 |
Miki Miyauchi (NTT) |
| (6) |
15:25-15:50 |
|
| |
15:50-16:05 |
Break ( 15 min. ) |
| (7) |
16:05-16:30 |
|
| (8) |
16:30-16:55 |
|
(9)
COMP |
16:55-17:20 |
A Gathering Problem for Mobile Fat Robots in a Grid without the Global Coodinate System COMP2014-10 |
Yoshinobu Ito, Yoshiaki Katayama (Nagoya Inst. of Tech.), Koichi Wada (hosei Univ.) |
| (10) |
17:20-17:45 |
|
Sat, Jun 14 AM
09:00 - 14:45 |
(11)
COMP |
09:00-09:25 |
role of mixedness in MBQC |
Tomoyuki Morimae (Gunma Univ.) |
(12)
COMP |
09:25-09:50 |
Computational Complexity of Irredundancy of Local Hamiltonian COMP2014-11 |
Ryo Kawasaki, Harumichi Nishimura (Nagoya Univ.) |
| (13) |
09:50-10:15 |
|
| |
10:15-10:30 |
Break ( 15 min. ) |
(14)
COMP |
10:30-10:55 |
On Characterizations of Randomized Computation Using Plain Kolmogorov Complexity COMP2014-12 |
Shuichi Hirahara, Akitoshi Kawamura (Univ. of Tokyo) |
(15)
COMP |
10:55-11:20 |
A Further Improved Extended Result on Polynomial-Time Solvability of the Maximum Clique Problem COMP2014-13 |
Hiroaki Nakanishi (Waseda Univ.), Etsuji Tomita, Mitsuo Wakatsuki, Tetsuro Nishino (UEC) |
| (16) |
11:20-11:45 |
|
| (17) |
11:45-12:10 |
|
| |
12:10-13:30 |
Lunch ( 80 min. ) |
| (18) |
13:30-13:55 |
|
(19)
COMP |
13:55-14:20 |
Enumeration of Polyominoes for pmg Tiling COMP2014-14 |
Jun Nishioka, Takashi Horiyama (Saitama Univ.) |
| (20) |
14:20-14:45 |
|
| Announcement for Speakers |
| General Talk | Each speech will have 20 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 |
Hisashi Koga
Graduate School of Information Systems,
University of Electro-Communications,
1-5-1 Chofugaoka, Chofu-si,
Tokyo 182-8585, Japan
E- :    is  c |
| IPSJ-AL |
Special Interest Group on Algorithms (IPSJ-AL) [Latest Schedule]
|
| Contact Address |
|
Last modified: 2014-05-08 21:07:40
|