|
|
| Chair |
|
Toshimitsu Masuzawa (Osaka Univ.) |
| Vice Chair |
|
Hirotaka Ono (Nagoya Univ) |
| Secretary |
|
Fukuhito Ooshita (NAIST), Ei Ando (Senshu Univ.) |
| Assistant |
|
Yota Otachi (Nagoya Univ) |
|
| Conference Date |
Sat, Oct 23, 2021 10:00 - 17:05 |
| Topics |
|
| Conference Place |
|
| Announcement |
Please register to join the meeting.
https://forms.gle/faYESZBZnNDTnNoY9 |
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) |
| Registration Fee |
This workshop will be held as the IEICE workshop in fully electronic publishing. Registration fee will be necessary except the speakers and participants other than the participants to workshop(s) in non-electronic publishing. See the registration fee page. We request the registration fee or presentation fee to participants who will attend the workshop(s) on COMP. |
Sat, Oct 23
10:00 - 17:05 |
| (1) |
10:00-10:35 |
Finding a Route without an Intersection  COMP2021-13 |
Momo Tosue, Kazuko Takahashi (Kwansei Gakuin Univ.) |
| (2) |
10:35-11:10 |
COMP2021-14 |
|
| (3) |
11:10-11:45 |
Multifold tiles of polyominoes and convex lattice polygons COMP2021-15 |
Kota Chida (UEC), Erik Demaine, Martin Demaine (MIT), David Eppstein (UCI), Adam Hesterberg (Harvard Univ.), Takashi Horiyama (Hokkaido Univ.), John Iacono (ULB), Hiro Ito (UEC), Stefan Langerman (ULB), Ryuhei Uehara (JAIST), Yushi Uno (Osaka Pref. Univ.) |
| |
11:45-13:15 |
Lunch Break ( 90 min. ) |
| (4) |
13:15-14:15 |
[Invited Talk]
Optimal-Time Queries on BWT-runs Compressed Indexes COMP2021-16 |
Takaaki Nishimoto, Yasuo Tabei (RIKEN) |
| |
14:15-14:30 |
Break ( 15 min. ) |
| (5) |
14:30-15:05 |
Algorithms for Graph Class Identification Problems in the Population Protocol Model COMP2021-17 |
Hiroto Yasumi, Fukuhito Ooshita, Michiko Inoue (NAIST) |
| (6) |
15:05-15:40 |
On an Algorithm to form a Triangle from a Line Using Pairbot Model COMP2021-18 |
Yuya Taguchi, Yonghwan Kim, Yoshiaki Katayama (NIT) |
| |
15:40-15:55 |
Break ( 15 min. ) |
| (7) |
15:55-16:30 |
Sequentially Swapping Colored Tokens on King's Graphs COMP2021-19 |
Yuto Okada, Hironori Kiya, Yota Otachi, Hirotaka Ono (Nagoya Univ.) |
| (8) |
16:30-17:05 |
Computing the Longest Path Length Distribution Function of DAGs with Small Treewidth and Random Edge Lengths COMP2021-20 |
Ei Ando (Senshu 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 |
Ei Ando
Senshu University
Address: 2-1-1, Tama-Ku, Kawasaki, Kanagawa, 214-8580
E- : an  ei isc nshu-u |
Last modified: 2021-10-21 11:55:22
|