|
|
| Chair |
|
Toshihiro Fujito (Toyohashi Univ. of Tech.) |
| Vice Chair |
|
Shinichi Nakano (Gunma Univ.) |
| Secretary |
|
Yota Otachi (Kumamoto Univ), Suguru Tamaki (Univ. of Hyogo) |
| Assistant |
|
Kazuhisa Seto (Seikei Univ.) |
|
| Conference Date |
Mon, Sep 2, 2019 10:50 - 17:10 |
| 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) |
| 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. |
Mon, Sep 2 AM
10:50 - 17:10 |
| (1) |
10:50-11:25 |
Shortest Universal Sequences of Adjacent Transpositions  COMP2019-10 |
Takehiro Ito (Tohoku Univ.), Jun Kawahara, Shin-ichi Minato (Kyoto Univ.), Yota Otachi (Kumamoto Univ.), Toshiki Saitoh (Kyutech), Akira Suzuki (Tohoku Univ.), Ryuhei Uehara (JAIST), Takeaki Uno (NII), Katsuhisa Yamanaka (Iwate Univ.), Ryo Yoshinaka (Tohoku Univ.) |
| (2) |
11:25-12:00 |
Speeding-up of Construction Algorithms for the Graph Coloring Problem COMP2019-11 |
Kazuho Kanahara, Kengo Katayama (OUS), Etsuji Tomita (UEC), Takeshi Okano, Takahumi Miyake, Noritaka Nishihara (OUS) |
| |
12:00-13:00 |
Break ( 60 min. ) |
| (3) |
13:00-14:00 |
[Invited Talk]
New Polynomial Delay Bounds for Maximal Subgraph Enumeration by Proximity Search COMP2019-12 |
Alessio Conte, Takeaki Uno (NII) |
| |
14:00-14:15 |
Break ( 15 min. ) |
| (4) |
14:15-14:50 |
Space efficient separator algorithms for planar graphs COMP2019-13 |
Osamu Watanabe (Tokyo Inst. of Tech.) |
| (5) |
14:50-15:25 |
Fine-grained quantum computational supremacy COMP2019-14 |
Tomoyuki Morimae (Kyoto Univ.), Suguru Tamaki (Univ. Hyogo) |
| (6) |
15:25-15:45 |
On the number of complete k-ary trees of height h COMP2019-15 |
Yosuke Kikuchi (NIT, Tsuyama College), Yume Ikeda (NTTEast-Minamikanto) |
| |
15:45-16:00 |
Break ( 15 min. ) |
| (7) |
16:00-16:35 |
Enumeration of Chordal and Interval Subgraphs Using Binary Decision Diagrams COMP2019-16 |
Jun Kawahara (NAIST), Toshiki Saitoh (Kyutech), Hirofumi Suzuki (Hokkaido Univ.), Ryo Yoshinaka (Tohoku Univ.) |
| (8) |
16:35-17:10 |
COMP2019-17 |
|
| 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 |
Yota Otachi
Faculty of Advanced Science and Technology, Kumamoto University
Address: 2-39-1 Kurokami, Chuo-ku, Kumamoto, 860-8555, Japan
E- : o         -u |
Last modified: 2019-07-18 12:52:23
|