| IEICE Technical Committee Submission System Advance Program |
Online Proceedings [Sign in] Tech. Rep. Archives |
| Go Top | Go Back | / | [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.) =============================================== Special Interest Group on Algorithms (IPSJ-AL) Chair: Ryuhei Uehara Secretary: Yoshio Okamoto, Yukiko Yamauchi, Kei Uchizawa DATE: Fri, Jun 24, 2016 13:20 - 20:30 Sat, Jun 25, 2016 09:30 - 16:50 PLACE: TOPICS: ---------------------------------------- Fri, Jun 24 (13:20 - 20:30) ---------------------------------------- (1) 13:20 - 13:45 (2)/COMP 13:45 - 14:10 On completeness of polynomial-time counting hierarchy under relaxed subtractive reductions Shunichi Matsubara (Aoyama Gakuin Univ.) (3) 14:10 - 14:35 ----- Break ( 10 min. ) ----- (4) 14:45 - 15:10 Dispersion on the Line ○Akagi Toshihiro, Nakano Shin-ichi (Gunma Univ.) (5) 15:10 - 15:35 ----- Break ( 10 min. ) ----- (6)/COMP 15:45 - 16:10 Enumerating Letter Graphs by Zero-suppressed Decision Diagrams Jun Kawahara (NAIST), Toshiki Saitoh (Kobe Univ.), Ryo Yoshinaka (Tohoku Univ.) (7)/COMP 16:10 - 16:35 Improving the lower bounds of the number of tilings for Ls in L and Sphinxes in Sphinx -- Enumerating tilings by frontier-based search -- Itsuki Kanemoto, Toshiki Saitoh (Kobe Univ.) ----- Banquet ( 120 min. ) ----- ---------------------------------------- Sat, Jun 25 (09:30 - 16:50) ---------------------------------------- (8) 09:30 - 09:55 (9) 09:55 - 10:20 (10) 10:20 - 10:45 ----- Break ( 10 min. ) ----- (11) 10:55 - 11:20 (12) 11:20 - 11:45 On the maximum weight minimal separator ○Hanaka Tesshu (Kyushu Univ.), Bodlaender Hans L. (Utrecht Univ.), van der Zanden Tom (Utrecht Univ.), Ono Hirotaka (Kyushu Univ.) ----- Lunch break ( 90 min. ) ----- (13)/COMP 13:15 - 13:40 An algorithm for 3-SAT problems Hiroshi Tsukimoto (Tokyo Denki Univ.) (14)/COMP 13:40 - 14:05 Contractive graph-minor embedding for CMOS Ising computer Takuya Okuyama, Chihiro Yoshimura, Masato Hayashi, Saki Tanaka, Masanao Yamaoka (Hitachi) (15)/COMP 14:05 - 14:30 A dual descent algorithm for node-capacitated multiflow problems and its applications Hiroshi Hirai (Univ. Tokyo) ----- Break ( 10 min. ) ----- (16) 14:40 - 15:05 Reachability between Steiner Trees in a Graph ○Mizuta Haruka，Ito Takehiro，Zhou Xiao（Tohoku Univ.） (17)/COMP 15:05 - 15:30 Computational Complexity of Sequential Token Swapping Problem Katsuhisa Yamanaka (Iwate Univ.), Erik D. Demaine (MIT), Takashi Horiyama (Saitama Univ.), Akitoshi Kawamura (Univ. of Tokyo), Shin-ichi Nakano (Gunma Univ.), Yoshio Okamoto (UEC), Toshiki Saitoh (Kobe Univ.), Akira Suzuki (Tohoku Univ.), Ryuhei Uehara (JAIST), Takeaki Uno (NII) ----- Break ( 10 min. ) ----- (18) 15:40 - 16:05 (19) 16:05 - 16:25 (20) 16:25 - 16:50 # Information for speakers General Talk will have 20 minutes for presentation and 5 minutes for discussion. General Talk (ショート) will have 15 minutes for presentation and 5 minutes for discussion. === Technical Committee on Theoretical Foundations of Computing (COMP) === # FUTURE SCHEDULE: Tue, Sep 6, 2016: Toyama Prefectural University [Mon, Jul 18] # 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 === Special Interest Group on Algorithms (IPSJ-AL) === Last modified: 2016-06-01 14:30:06 |
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] / [Return to IPSJ-AL Schedule Page] /
| Go Top | Go Back | / | [HTML] / [HTML(simple)] / [TEXT] | [Japanese] / [English] |
[Return to Top Page]