| 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: Koichi Wada (Hosei Univ.) Vice Chair: Toshimitsu Masuzawa (Osaka Univ.) Secretary: Sayaka Kamei (Hiroshima Univ.), Hisashi Koga (Univ. of Electro-Comm.) DATE: Mon, Mar 9, 2015 09:40 - 17:00 PLACE: TOPICS: ---------------------------------------- Mon, Mar 9 AM (09:40 - 11:40) ---------------------------------------- (1) 09:40 - 10:10 On a Gathering Problem for Large size Fat Robots in a Grid Yoshinobu Ito, Yoshiaki Katayama (NIT), Koichi Wada (Hosei) (2) 10:10 - 10:40 A Note on Irreversible 2-Conversion Sets in Subcubic Graphs Asahi Takaoka, Shuichi Ueno (Tokyo Tech) (3) 10:40 - 11:10 Node Overlap Removal with Basis Nodes Noboru Abe, Hiroaki Oh, Kouhei Inoue (Osaka Electro-Communication Univ.) (4) 11:10 - 11:40 ZDD Construction for Maximal Independent Set Enumeration on Hypergraph Teruji Sugaya (OUJ), Takahisa Toda (UEC), Shin-ichi Minato (HU) ----- Lunck Break ( 80 min. ) ----- ---------------------------------------- Mon, Mar 9 PM (13:00 - 14:00) ---------------------------------------- (5) 13:00 - 14:00 [Invited Talk] Algorithms in natural computing : a parallel Exhaustive search and an optimization technique using biological behaviors Akihiro Fujiwara (Kyutech) ----- Break ( 15 min. ) ----- ---------------------------------------- Mon, Mar 9 PM (14:15 - 17:00) ---------------------------------------- (6) 14:15 - 14:45 Maximum Supply Rate and Minimum Supply Increase Rate of Supply and Demand Networks Hironori Yoshihara, Takao Nishizeki (KGU) (7) 14:45 - 15:15 Efficient Algorithms for Parametric Supply-Demand Tree Networks Naoki Takahashi, Takao Nishizeki (Kwansei Gakuin Univ) (8) 15:15 - 15:45 NP-hardness of Finding Minimum Test Set for Detecting Stuck-at and/or Bridging Faults in a Reversible Circuit Hibiki Takakura, Toshinori Yamada (Saitama Univ.) ----- Break ( 15 min. ) ----- (9) 16:00 - 16:30 On a 2-approximation Self-stabilizing Algorithm for the Maximum Leaf Spanning Tree Keisuke Okamoto, Yoshiaki Katayama (NIT) (10) 16:30 - 17:00 Tangle and ideal Koichi Yamazaki (Gunma 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: Thu, Apr 23, 2015: [Mon, Feb 16] Fri, Jun 12, 2015 - Sat, Jun 13, 2015: [Fri, Apr 10] # SECRETARY: Hisashi Koga Graduate School of Information Systems, University of Electro-Communications, 1-5-1 Chofugaoka, Chofu, Tokyo 182-8585, Japan E-mail:    is  c Last modified: 2015-01-16 10:47:44 |
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 | / | [HTML] / [HTML(simple)] / [TEXT] | [Japanese] / [English] |
[Return to Top Page]