Accepted Papers

• Jinil Kim, Peter Eades, Rudolf Fleischer, Seok-Hee Hong, Costas S. Iliopoulos, Kunsoo Park, Simon J. Puglisi and Takeshi Tokuyama. Order Preserving Matching
• Hiro Ito, Stefan Langerman and Yuichi Yoshida. On A Generalization of River Crossing Problems
• Takao Inoshita, Robert Irving, Kazuo Iwama, Shuichi Miyazaki and Takashi Nagase. Improving Man-Optimal Stable Matchings by Minimum Change of Preference Lists
• Meng-Ling Tsai and Yi-Jung Chen. An Algorithm for the Automatic Design of Memory Resource and Data Allocation in MPSoCs with Reconfigurable 3D-stacked SRAMs
• Akira Suzuki, Kei Uchizawa and Xiao Zhou. Energy-Efficient Threshold Circuits Detecting Global Pattern in 1-Dimensional Arrays
• Xiaojie Deng, Bingkai Lin and Chihao Zhang. Multi-Multiway Cut Problem on Graphs of Bounded Branch Width
• Kai-Siou Wu and Justie Su-Tzu Juan. The Mutually Independent Hamiltonianicity of Cartesian Product Graphs
• Yamming Huang and Chung-Shou Liao. Online Route Planning: The Canadian Traveller Problem Revisited
• Shang-Hung Lu and Chung-Shou Liao. The Electric Vehicle Touring Problem
• Chih-Wei Liang, Hung-Yu Huang and Chung-Shou Liao. Dynamic Point Labeling with Rectangular Labels
• Vorapong Suppakitpaisarn and Hiroshi Imai. Yet Another Proof for Optimal Joint Average Hamming Weight of Width-3 Joint Sparse Form
• Arno Pauly. A new introduction to the theory of represented spaces
• Xujin Chen, Xiaodong Hu, Weidong Ma and Changjun Wang. Reducing Price of Anarchy of Selfish Load Balancing with More Selfishness
• Suguru Tamaki. The Complexity of Robust Satisfiability of the Constraint Satisfaction Problem
• Yuya Higashikawa, Naoki Katoh and Yuki Kobayashi. Enumerating Minimally Rigid Body-Hinge Graphs
• Ei Ando. Approximating the Minimum Spanning Tree Weight Distribution Function in Treewidth k Graph Using Taylor Polynomials
• Hee-Kap Ahn, Sang Won Bae and Wanbin Son. Group Nearest Neighbor Queries in the $L_1$ Plane
• Yuichi Asahiro, Yuya Doi, Eiji Miyano and Hirotaka Shimizu. Maximum Diameter-Bounded Subgraphs in Graphs Without Long Induced Cycles
• Otfried Cheong, Sariel Har-Peled, Heuna Kim and Hyo-Sil Kim. On the Number of Edges of a Fan-Crossing Free Graph
• Hee-Kap Ahn, Jessica Sherette and Sang Duk Yoon. Realistic Roofs over a Rectilinear Polygon Revisited
• Luis Barba, Jean Lou De Carufel, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, Yuan Tang, Takeshi Tokuyama, Sander Verdonschot and Tianhao Wang. Geometric Weight Balancing
• Taku Okada, Akira Suzuki, Takehiro Ito and Xiao Zhou. Algorithm for the Minimum Caterpillar Problem with Terminals
• Atsushi Koike and Kunihiko Sadakane. Abstract Computation Model for Analyzing Complexity of GPU-based Algorithms
• Jinhee Chun, Natsuda Kaothanthong and Takeshi Tokuyama. Shape Description using Classified Distances
• Alexander Bowe, Taku Onodera, Kunihiko Sadakane and Tetsuo Shibuya. A New Implementation of Succinct de Bruijn Graphs
• Ricardo Gonzaro and Takeshi Tokuyama. Space-efficient polygon reconstruction from visibility angle information
• Takahiro Fujita, Kohei Hatano and Eiji Takimoto. Combinatorial Online Prediction Using Oine Approximation Algorithms
• Yuki Hagiwara, Takashi Horiyama and Yushi Uno. ZDD-Based Approach to Solving Tantrix
• Lin Chen, Deshi Ye and Guochuan Zhang. Parallel Machine Scheduling with Speed-Up Resources
• Jie Zhou, Tianming Bu and Hong Zhu. Vehicle Scheduling on a Graph to Maximize Value
• Leizhen Cai. FPT and Exact Algorithms for Maximum Weight-k 2SAT