|
|
| Chair |
|
Hiro Ito (Univ. of Electro-Comm.) |
| Vice Chair |
|
Yushi Uno (Osaka Pref. Univ.) |
| Secretary |
|
Kazuhisa Seto (Seikei Univ.), Toshiki Saito (Kyushu Inst. of Tech.) |
|
| Conference Date |
Mon, Mar 5, 2018 10:00 - 17:30 |
| Topics |
|
| Conference Place |
Nakamozu Campus, Osaka Prefecture University |
| Address |
1-1 Gakuen-cho, Naka-ku, Sakai, Osaka 599-8531, Japan |
| Transportation Guide |
https://www.osakafu-u.ac.jp/en/info/access/ |
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, Mar 5 AM
10:00 - 17:30 |
| (1) |
10:00-10:25 |
Relationship between Retweet and Structure of the Twitter Network  COMP2017-45 |
Tatsuya Fukushima (Waseda Univ.) |
| (2) |
10:25-10:50 |
The Growth of Non-Giant Component in Preferentially-Attached Networks COMP2017-46 |
Takahiro Shimomura, Hiroshi Toyoizumi (Waseda Univ.) |
| |
10:50-11:00 |
Break ( 10 min. ) |
| (3) |
11:00-11:50 |
[Invited Talk]
Stochastic Packing Integer Programs with Few Queries COMP2017-47 |
Takanori Maehara (RIKEN), Yutaro Yamaguchi (Osaka Univ./RIKEN) |
| |
11:50-13:20 |
Break ( 90 min. ) |
| (4) |
13:20-14:10 |
[Invited Talk]
Space-Efficient Algorithms for Longest Increasing Subsequence COMP2017-48 |
Masashi Kiyomi (Yokohama City Univ.), Hirotaka Ono (Nagoya Univ.), Yota Otachi (Kumamoto Univ.), Pascal Schweitzer (TU Kaiserslautern), Jun Tarui (UEC) |
| |
14:10-14:25 |
Break ( 15 min. ) |
| (5) |
14:25-14:50 |
Analysis of Polynomial-time Learnability with Membership Queries COMP2017-49 |
Mikito Nanashima (Tokyo Inst. of Tech.) |
| (6) |
14:50-15:15 |
A recognition algorithm for simple-triangle graphs COMP2017-50 |
Asahi Takaoka (Kanagawa Univ.) |
| |
15:15-15:30 |
Break ( 15 min. ) |
| (7) |
15:30-15:55 |
Efficient Computation of Betweenness Centrality by Graph Decompositions and their Applications to Real-world Networks COMP2017-51 |
Tatsuya Inoha (Osaka Pref. Univ.), Kunihiko Sadakane (Univ. of Tokyo), Yushi Uno (Osaka Pref. Univ.), Yuuma Yonebayashi (Univ. of Tokyo) |
| (8) |
15:55-16:20 |
Implementation of global partition algorithm and verification of hyperfiniteness for property testing of real-world networks COMP2017-52 |
Yutaro Honda (Osaka Pref. Univ.), Hiro Ito (UEC), Munehiko Sasajima (Univ. of Hyogo), Yushi Uno (Osaka Pref. Univ.) |
| (9) |
16:20-16:45 |
On Settlement Fund Circulation Problem COMP2017-53 |
Hitoshi Hayakawa, Toshimasa Ishii (Hokkaido Univ.), Hirotaka Ono (Nagoya Univ.), Yushi Uno (Osaka Pref. Univ.) |
| |
16:45-17:00 |
Break ( 15 min. ) |
| (10) |
17:00-17:30 |
|
| 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 |
Kazuhisa Seto
Faculty of Science and Technology, Seikei University
Address: 3-3-1 Kichijoji-Kitamachi, Musashino-shi, Tokyo 180-8633, Japan
E- :    st i i |
Last modified: 2018-03-02 16:15:54
|