April 19(Fri), 2013
13:30-13:40 Opening
13:40-14:40 Session 1: Invited Talk I
14:40-15:10 Coffee break
15:10-17:10 Session 2: Long Talk I

April 20(Sat), 2013
9:00-10:00 Session 3: Invited Talk II
10:00-10:30 Coffee break
10:30-11:50 Session 4: Long Talk II
11:50-13:30 Lunch
13:30-15:10 Session 5A Session 5B
15:10-15:40 Coffee break
15:40-17:00 Session 6A Session 6B
18:00-20:00 Banquet

April 21(Sun), 2013
9:00-10:00 Session 7: Long Talk III
10:00-11:30 Coffee break
11:30-11:20 Session 8: Long Talk IV
11:20-11:30 Closing

Friday, April 19, 2013
Session 1: Invited talk I
13:30-13:40 Opnening
13:40-14:40 Algorithmic Models for Wireless Networks
Magnus Halldorsson
11:40-15:10 Coffee break
Session 2: Long Talk I
15:10-15:40 On A Generalization of River Crossing Problems
Hiro Ito, Stefan Langerman and Yuichi Yoshida
15:40-16:10 Reducing Price of Anarchy of Selfish Load Balancing with More Selfishness
Xujin Chen, Xiaodong Hu, Weidong Ma and Changjun Wang
16:10-16:40 Parallel Machine Scheduling with Speed-Up Resources
Lin Chen, Deshi Ye and Guochuan Zhang
16:40-17:10 Order Preserving Matching
Jinil Kim, Peter Eades, Rudolf Fleischer, Seok-Hee Hong, Costas S. Iliopoulos, Kunsoo Park, Simon J. Puglisi and Takeshi Tokuyama

Saturday April 20, 2013
Session 3: Invited Talk II
9:00-10:00 A Survey of Algorithmic Problems and Solutions in Medical Informatics
Danny Chen
10:00-10:30 Coffee break
Session 4: Long Talk II
10:30-10:50 The Electric Vehicle Touring Problem
Shang-Hung Lu and Chung-Shou Liao
10:50-11:10 Vehicle Scheduling on a Graph to Maximize Value
Jie Zhou, Tianming Bu and Hong Zhu
11:10-11:30 Multi-Multiway Cut Problem on Graphs of Bounded Branch Width
Xiaojie Deng, Bingkai Lin and Chihao Zhang
11:30-11:50 Approximating the Minimum Spanning Tree Weight Distribution Function in Treewidth k Graph Using Taylor Polynomials
Ei Ando
11:50-13:30 Lunch

Session 5A
13:30-13:50 Abstract Computation Model for Analyzing Complexity of GPU-based Algorithms
Atsushi Koike and Kunihiko Sadakane
13:50-14:10 An Algorithm for the Automatic Design of Memory Resource and Data Allocation in MPSoCs with Reconfigurable 3D-stacked SRAMs
Meng-Ling Tsai and Yi-Jung Chen
14:10-14:30 ZDD-Based Approach to Solving Tantrix
Yuki Hagiwara, Takashi Horiyama and Yushi Uno
14:30-14:50 A new introduction to the theory of represented spaces
Arno Pauly
14:50-15:10 Energy-Efficient Threshold Circuits Detecting Global Pattern in 1-Dimensional Arrays
Akira Suzuki, Kei Uchizawa and Xiao Zhou
15:10-15:40 Coffee break
Session 6A
15:40-16:00 The Mutually Independent Hamiltonianicity of Cartesian Product Graphs
Kai-Siou Wu and Justie Su-Tzu Juan
16:00-16:20 Maximum Diameter-Bounded Subgraphs in Graphs Without Long Induced Cycles
Yuichi Asahiro, Yuya Doi, Eiji Miyano and Hirotaka Shimizu
16:20-16:40 Algorithm for the Minimum Caterpillar Problem with Terminals
Taku Okada, Akira Suzuki, Takehiro Ito and Xiao Zhou
16:40-17:00 Combinatorial Online Prediction Using Offline Approximation Algorithms
Takahiro Fujita, Kohei Hatano and Eiji Takimoto

Session 5B
13:30-13:50 Improving Man-Optimal Stable Matchings by Minimum Change of Preference Lists
Takao Inoshita, Robert Irving, Kazuo Iwama, Shuichi Miyazaki and Takashi Nagase
13:50-14:10 Dynamic Point Labeling with Rectangular Labels
Chih-Wei Liang, Hung-Yu Huang and Chung-Shou Liao
14:10-14:30 Yet Another Proof for Optimal Joint Average Hamming Weight of Width-3 Joint Sparse Form
Vorapong Suppakitpaisarn and Hiroshi Imai
14:30-14:50 Enumerating Minimally Rigid Body-Hinge Graphs
Yuya Higashikawa, Naoki Katoh and Yuki Kobayashi
14:50-15:10 Realistic Roofs over a Rectilinear Polygon Revisited
Hee-Kap Ahn, Jessica Sherette and Sang Duk Yoon
15:10-15:40 Coffee break
Session 6B
15:40-16:00 A New Implementation of Succinct de Bruijn Graphs
Alexander Bowe, Taku Onodera,Kunihiko Sadakane and Tetsuo Shibuya
16:00-16:20 Group Nearest Neighbor Queries in the $L_1$ Plane
Hee-Kap Ahn, Sang Won Bae and Wanbin Son
16:20-16:40 Shape Description using Classified Distances
Jinhee Chun, Natsuda Kaothanthong and Takeshi Tokuyama
16:40-17:00 Online Route Planning: The Canadian Traveller Problem Revisited
Yamming Huang and Chung-Shou Liao

Sunday, April 21, 2013
Session 7: Long Talk III
9:00-9:30 Geometric Weight Balancing
Luis Barba, Jean Lou De Carufel, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, Yuan Tang, Takeshi Tokuyama, Sander Verdonschot and Tianhao Wang
9:30-10:00 The Complexity of Robust Satisfiability of the Constraint Satisfaction Problem
Suguru Tamaki
10:00-10:30 Coffee break
Session 8: Long Talk IV
10:30-11:00 On the Number of Edges of a Fan-Crossing Free Graph
Otfried Cheong, Sariel Har-Peled, Heuna Kim and Hyo-Sil Kim
11:00-11:20 Space-efficient polygon reconstruction from visibility angle information (*Short Talk)
Ricardo Gonzaro and Takeshi Tokuyama
11:20-11:30 Closing