===============================================
Technical Committee on Theoretical Foundations of Computing (COMP)
Chair: Tetsuo Asano (JAIST) Vice Chair: Kazuhisa Makino (Univ. of Tokyo)
Secretary: Takehiro Ito (Tohoku Univ.), Akinori Kawachi (Tokyo Inst. of Tech.)
===============================================
Special Interest Group on Algorithms (IPSJ-AL)
Chair: Shin-ichi Nakano (Gunma Univ.)
Secretary: Ryuhei Uehara (JAIST), Shuji Kijima (Kyushu Univ.), Katsuhisa Yamanaka (Iwate Univ.)
DATE:
Tue, Sep 6, 2011 10:00 - 17:10
PLACE:
Hakodate City Central Library(Prof. Hiroyuki Kawai)
TOPICS:
----------------------------------------
Tue, Sep 6 AM (10:00 - 11:40)
----------------------------------------
(1) 10:00 - 10:25
A Compact Encoding of Rectangular Drawings with Edge Lengths
Shin-ichi Nakano(Gunma Univ.), Katsuhisa Yamanaka(Iwate Univ.)
(2)/COMP 10:25 - 10:50
A PTAS for the Subset Sum Reconfiguration Problem
Takehiro Ito (Tohoku Univ.), Erik D. Demaine (MIT)
(3) 10:50 - 11:15
Complexity of Minimum Certicifate Dispersal Problem with Tree Structure
Taisuke Izumi(Nitech), Tomoko Izumi(Ritsumeikan Univ.), Hirotaka Ono(Kyushu Univ.), Koichi Wada(Nitech)
(4)/COMP 11:15 - 11:40
On A DAG Constructing Self-stabilizing Protocol for GeoCast in MANET
Koichi Ito, Yoshiaki Katayama, Koichi Wada, Naohisa Takahashi (Nitech)
----- Lunch Break ( 90 min. ) -----
----------------------------------------
Tue, Sep 6 PM (13:10 - 17:10)
----------------------------------------
----- IPSJ Computer Science Award Ceremony ( 10 min. ) -----
(5) 13:20 - 13:45
Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem
Yoshio Okamoto(JAIST), Yota Otachi(Tohoku Univ.), Ryuhei Uehara(JAIST), Takeaki Uno(NII)
(6)/COMP 13:45 - 14:10
Experimental Evaluation of Algorithm for Minimum-Weight Rooted Not-Necessarily-Spanning Arborescence Problem
Yusuke Abe, Eishi Chiba (Hosei Univ.)
(7) 14:10 - 14:35
The Complexity of Free Flood Filling Games
Hiroyuki Fukui(JAIST), Akihiro Nakanishi(JAIST), Ryuhei Uehara(JAIST), Takeaki Uno(NII), Yushi Uno(OPU)
----- Break ( 15 min. ) -----
(8)/COMP 14:50 - 15:15
Extended Pseudo-tree Pattern Matching with labels of strings
Hiroaki Yamamoto (Shinshu Univ.), Takashi Miyazaki (Nagano NCT)
(9) 15:15 - 15:40
On Totally Unimodularity in Edge-Edge Adjacency Relationships
Yusuke Matsumoto(IBM/Chuo Univ.), Naoyuki Kamiyama(Chuo Univ.), Keiko Imai(Chuo Univ.)
(10)/COMP 15:40 - 16:05
Lower Bounds for Linear Decision Trees via An Energy Complexity Argument
Kei Uchizawa (Tohoku Univ.), Eiji Takimoto (Kyushu Univ.)
----- Break ( 15 min. ) -----
(11) 16:20 - 16:45
Common Developments of Several Different Orthogonal Boxes
Zachary Abel(MIT), Erik D. Demaine(MIT), Martin L. Demaine(MIT), Hiroaki Matsui(JAIST), Guenter Rote(FUB), Ryuhei Uehara(JAIST)
(12)/COMP 16:45 - 17:10
Unfoldings of Platonic Solids with Minimum/Maximum Diameter, Width, and Enclosing-Rectangle
Takashi Horiyama, Wataru Shoji (Saitama Univ.)
# 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:
Fri, Oct 21, 2011: Tohoku Univ. [Wed, Aug 17]
Fri, Dec 16, 2011: Nagoya Univ. [Tue, Oct 11]
# SECRETARY:
Takehiro ITO
Graduate School of Information Sciences,
Tohoku University.
Aramaki aza Aoba 6-6-05, Aoba-ku Sendai
980-8579, Japan
Email: ecei
=== Special Interest Group on Algorithms (IPSJ-AL) ===
# SECRETARY:
Katsuhisa YAMANAKA
Faculty of Engineering,
Iwate University
Ueda 4-3-5, Morioka, Iwate
020-8551, Japan
Email: cisi-u
Last modified: 2011-08-09 18:40:45
|
Notification: Mail addresses are partially hidden against SPAM.
|