| IEICE Technical Committee Submission System Advance Program |
Online Proceedings [Sign in] Tech. Rep. Archives |
| Go Top | Go Back | Prev COMP Conf / Next COMP Conf | [HTML] / [HTML(simple)] / [TEXT] | [Japanese] / [English] |
|
=============================================== Technical Committee on Theoretical Foundations of Computing (COMP) Chair: Hiroo Itoh (Univ. of Electro-Comm.) Vice Chair: Yuushi Uno (Osaka Pref. Univ.) Secretary: Kazuhisa Seto (Seikei Univ.), Toshiki Saito (Kobe Univ.) DATE: Tue, Sep 6, 2016 10:30 - 16:50 PLACE: Toyama Prefectural University, L205(Prof. Taishin Y. Nishida) TOPICS: ---------------------------------------- Tue, Sep 6 AM (10:30 - 16:50) ---------------------------------------- (1) 10:30 - 11:00 Counting the number of solutions for peg solitaire Itsuki Kanemoto, Toshiki Saitoh (Kobe Univ.), Masashi Kiyomi (Yokohama City Univ.), Ryuhei Uehara (JAIST) (2) 11:00 - 11:30 Gathering of mobile agents in Byzantine environments with authenticated whiteboards Masashi Tsuchida, Fukuhito Ooshita, Michiko Inoue (NAIST) (3) 11:30 - 12:00 On the inapproximability of the Frobenius problem and its relationship with the covering radius problem Shunichi Matsubara (Aoyama Gakuin Univ.) ----- Lunch ( 90 min. ) ----- (4) 13:30 - 14:00 Games with a Single Pile of Stones and Number Theoretic Problems Yoshihiro Tsukamura (SONY), Yoshihide Igarashi, Yuta Urabe, Koichi Yamazaki (Gunma Univ.) (5) 14:00 - 14:30 (See Japanese page.) (6) 14:30 - 15:00 On Enumeration of Spatial Proximity Patterns by Rectangle of Fixed Range in two Dimensions Tomoaki Ogasawara, Hiroshi Imai (Univ. of Tokyo), Takuya Kida (Hokkaido Univ.) ----- Break ( 20 min. ) ----- (7) 15:20 - 15:50 An algorithm for an optimal sink location problem in dynamic tree networks on condition that minimize the total evacuation time Naoki Takahashi, Naoki Katoh (Kwansei Gakuin Univ), Yuya Higashikawa (Chuo Univ) (8) 15:50 - 16:20 A 2-dimensional topological representation theorem for rank 4 matroid polytopes Hiroyuki Miyata (Gunma Univ.) (9) 16:20 - 16:50 Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs Kenjiro Takazawa (Hosei Univ.) # Information for speakers General Talk will have 25 minutes for presentation and 5 minutes for discussion. === Technical Committee on Theoretical Foundations of Computing (COMP) === # FUTURE SCHEDULE: Fri, Oct 21, 2016: Tohoku University [Thu, Aug 18] Wed, Dec 21, 2016 - Thu, Dec 22, 2016: Hiroshima University [Fri, Oct 7] # SECRETARY: Toshiki Saitoh Graduate School of Engineering, Kobe University. Address: 1-1 Rokkodai, Nada, Kobe, 657-8501, Japan. E-mail:  i h eedept  be-u Last modified: 2016-08-19 14:06:17 |
Notification: Mail addresses are partially hidden against SPAM.
[Download Paper's Information (in Japanese)] <-- Press download button after click here.
[Cover and Index of IEICE Technical Report by Issue]
[Presentation and Participation FAQ] (in Japanese)
[Return to COMP Schedule Page] /
| Go Top | Go Back | Prev COMP Conf / Next COMP Conf | [HTML] / [HTML(simple)] / [TEXT] | [Japanese] / [English] |
[Return to Top Page]