| 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: Toshimitsu Masuzawa (Osaka Univ.) Vice Chair: Hirotaka Ono (Nagoya Univ) Secretary: Fukuhito Ooshita (NAIST), Ei Ando (Senshu Univ.) Assistant: Yota Otachi (Nagoya Univ) DATE: Fri, Dec 4, 2020 09:30 - 17:30 PLACE: Online(Prof. Yasuyuki Kawamura) TOPICS: ---------------------------------------- Fri, Dec 4 AM (09:30 - 11:40) ---------------------------------------- (1) 09:30 - 10:00 Counting Weave Diagrams Tomio Hirata (Nagoya Univ.), Isamu Matsuura (Aichi Center for Industry and Science Technology) (2) 10:00 - 10:30 A Fast ZDD-Based Method for Enumerating All Solutions of Cost-Bounded Combinatorial Problems Shin-ichi Minato (Kyoto Univ.), Mutsunori Banbara (Nagoya Univ.), Takashi Horiyama (Hokkaido Univ.), Jun Kawahara (Kyoto Univ.), Ichigaku Takigawa (Hokkaido Univ.), Yutaro Yamaguchi (Kyushu Univ.) ----- Break ( 10 min. ) ----- (3) 10:40 - 11:10 Efficient Construction of Cryptarithm Catalogues over DFA Koya Watanabe, Diptarama Hendrian, Ryo Yoshinaka (Tohoku Univ.), Takashi Horiyama (Hokkaido Univ.), Ayumi Shinohara (Tohoku Univ.) (4) 11:10 - 11:40 Capacitated Network Design Games on a Generalized Fair Allocation Model Toshiyuki Hirose (Nagoya Univ.), Tesshu Hanaka (Chuo Univ.), Hirotaka Ono (Nagoya Univ.) ----- Break ( 70 min. ) ----- ---------------------------------------- Fri, Dec 4 PM (12:50 - 13:50) ---------------------------------------- (5) 12:50 - 13:50 [Invited Talk] A Blossom Algorithm for Maximum Edge-Disjoint T-Paths Satoru Iwata (Univ. of Tokyo), Yu Yokoi (NII) ----- Break ( 10 min. ) ----- ---------------------------------------- Fri, Dec 4 PM (14:00 - 15:00) ---------------------------------------- (6) 14:00 - 15:00 [Invited Talk] How many vertices does a random walk miss in a network with moderately increasing the number of vertices? Shuji Kijima (Kyushu Univ.), Nobutaka Shimizu (The Univ. of Tokyo), Takeharu Shiraga (Chuo Univ.) ----- Break ( 20 min. ) ----- ---------------------------------------- Fri, Dec 4 PM (15:20 - 17:30) ---------------------------------------- (7) 15:20 - 15:50 Fixed Parameter Algorithms for L(p,1)-labeling Kazuma Kawai (Nagoya Univ), Tesshu Hanaka (Chuo Univ), Hirotaka Ono (Nagoya Univ) (8) 15:50 - 16:20 An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion Yuuki Aoike (Yokohama City Univ.), Tatsuya Gima (Nagoya Univ.), Tesshu Hanaka (Chuo Univ.), Masashi Kiyomi (Yokohama City Univ.), Yasuaki Kobayashi, Yusuke Kobayashi (Kyoto Univ.), Kazuhiro Kurita (NII), Yota Otachi (Nagoya Univ.) ----- Break ( 10 min. ) ----- (9) 16:30 - 17:00 Approximation algorithms for the maximum happy set problem Yuichi Asahiro (Kyushu Sangyo Univ), Hiroshi Eto (Kyushu Univ), Tesshu Hanaka (Chuo Univ), Guohui Lin (U. Alberta), Eiji Miyano, Ippei Terabaru (Kyutech) (10) 17:00 - 17:30 Quantum sampling verification with offline quantum communication Taiga Hiroka (Kyoto Univ), Yuki Takeuchi (NTT CS Lab.), Tomoyuki Morimae (Kyoto Univ) # Information for speakers General Talk will have 25 minutes for presentation and 5 minutes for discussion. # CONFERENCE ANNOUNCEMENT: - Please register to join the meeting. https://forms.gle/az2BfJ1SGPLKbG7F8 === Technical Committee on Theoretical Foundations of Computing (COMP) === # FUTURE SCHEDULE: Mon, Mar 8, 2021: Online [Wed, Jan 13] # SECRETARY: Fukuhito Ooshita Nara Institute of Science and Technology Address: Takayama 8916-5, Ikoma, Nara 630-0192, Japan E-mail: f-oosi   is  ist Last modified: 2020-11-20 17:16:33 |
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]