| 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: Toshihiro Fujito (Toyohashi Univ. of Tech.) Vice Chair: Shinichi Nakano (Gunma Univ.) Secretary: Suguru Tamaki (Kyoto Univ.), Yota Otachi (Kumamoto Univ) Assistant: Kazuhisa Seto (Seikei Univ.) DATE: Wed, Dec 12, 2018 10:00 - 17:45 PLACE: Main lecture hall, Graduate School of Information Sciences, Tohoku University (Building G01 in the map below) <br /> https://www.eng.tohoku.ac.jp/english/map/?menu=campus&area=g(Aramaki Aza Aoba 6-3-09, Aoba-ku, Sendai. Sendai Station Tozai (east-west) Subway Line toward Yagiyama Zoo, "Aobayama Station" Exit North1・South1, One min on foot.https://www.is.tohoku.ac.jp/en/introduction/access.html. Jinhee Chun, Graduate School of Information Sciences, Tohoku University) TOPICS: ---------------------------------------- Wed, Dec 12 (10:00 - 17:45) ---------------------------------------- (1) 10:00 - 10:25 Max-Min Dispersion Problems Takashi Horiyama (Saitama Univ.), Shin-ichi Nakano (Gunma Univ.), Toshiki Saitoh (KIT), Koki Suetsugu (Kyoto Univ.), Akira Suzuki (Tohoku Univ.), Ryuhei Uehara (JAIST), Takeaki Uno, Kunihiro Wasa (NII) (2) 10:25 - 10:50 Linear-Time Algorithms for the Generalized Coloring Reconfiguration Problem Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou (Tohoku Univ.) (3) 10:50 - 11:15 Minimization of an M-convex Function under L1-distance Constraint Akiyoshi Shioura (Tokyo Inst. Tech.) ----- Break ( 15 min. ) ----- (4) 11:30 - 12:30 [Invited Talk] A weighted linear matroid parity algorithm Satoru Iwata (Univ. Tokyo), Yusuke Kobayashi (Kyoto Univ.) ----- Lunch ( 60 min. ) ----- (5) 13:30 - 14:30 [Invited Talk] 0/1/all CSPs, Half-Integral A-path Packing, and Linear-Time FPT Algorithms Yoichi Iwata (NII), Yutaro Yamaguchi (Osaka Univ.), Yuichi Yoshida (NII) ----- Break ( 15 min. ) ----- (6) 14:45 - 15:10 Unpopularity Factor in the Marriage and Roommates Problems Suthee Ruangwises, Toshiya Itoh (TokyoTech) (7) 15:10 - 15:35 AND Protocols Using Only Uniform Shuffles Suthee Ruangwises, Toshiya Itoh (TokyoTech) (8) 15:35 - 16:00 A Millionaire Protocol Using a Standard Deck of Cards Daiki Miyahara (Tohoku Univ./AIST), Takaaki Mizuki, Hideaki Sone (Tohoku Univ.) ----- Break ( 15 min. ) ----- (9) 16:15 - 16:40 Self-stabilizing exploration of a graph by a mobile agent Yuki Hara, Yuichi Sudo, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ.) (10) 16:40 - 17:05 Enumerating Floorplans with Columns Katsuhisa Yamanaka (Iwate Univ.), Md.Saidur Rahman (BUET), Shin-ichi Nakano (Gunma Univ.) (11) 17:05 - 17:25 Experimental evaluation of an approach based on de Bruijn graphs for Order/Degree problem Tamami Okada, Hiroki Kanda, Yosuke Kikuchi (NIT, Tsuyama College) (12) 17:25 - 17:45 Distance 2-domination number of Hypercubes Nana Kawamura, Yosuke Kikuchi (NIT, Tsuyama College) # Information for speakers General Talk will have 20 minutes for presentation and 5 minutes for discussion. === Technical Committee on Theoretical Foundations of Computing (COMP) === # FUTURE SCHEDULE: Mon, Mar 18, 2019: The University of Tokyo [Thu, Jan 10] # SECRETARY: Suguru Tamaki School of Informatics, Kyoto University Address: Yoshida Honmachi, Sakyo-ku, Kyoto 606-8501, Japan E-mail:   k  is k  -u Last modified: 2018-10-14 10:57:59 |
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]