PROGRAM

Saturday, May 14, 2016

15:00 – 16:00	Registration
16:00 – 17:30	Tutorial Talk Dr. Ke Yi: Random Sampling in Database Systems: Techniques and Applications
17:30 – 18:00	Break
18:00 – 20:00	Welcome Reception (14F, Howard Civil Service International House)

Sunday, May 15, 2016

08:30 – 08:55	Registration
08:55 – 09:00	Conference Opening
09:00 – 10:00	Keynote Speech Chair: Kazuo Iwama Dr. Fan Chung: Higher Cheeger Inequalities and Clustering Algorithms
10:00 – 10:20	Coffee/Tea Break
10:20 – 11:50	Long Talk Session L1 \| Long Talk Session L2 Chair: Hsu-Chun Yen \| Chair: Hee-Kap Ahn
12:00 – 13:20	Lunch
13:20 – 15:20	Session A1 Computational Geometry \| Session B1 Graph Algorithms Chair: San Won Bae \| Chair: Minming Li
15:20 – 15:40	Coffee/Tea Break
15:40 – 17:40	Session A2 Approximation Algorithms \| Session B2 Experimental Algorithms Chair: Louxin Zhang \| Chair: Takehiro Ito
18:30 – 21:00	Conference Banquet (Shin Yeh Taiwanese Cuisine Shuangcheng Restaurant.)

Monday, May 16, 2016

08:50 – 09:50	Keynote Speech Chair: DT Lee Dr. Dorothea Wagner: Route Planning Algorithms – New Results and Challenges
09:50 – 10:10	Coffee/Tea Break
10:10 – 11:10	Long Talk Session L3 \| Long Talk Session L4 Chair: Xin Han \| Chair: Ho-Lin Chen
11:10 – 12:10	Session A3 Fixed Parameter Algorithms \| Session B3 Auction, Anonymization, and Cryptography Chair: Xin Han \| Chair: Ho-Lin Chen
12:10 – 13:30	Lunch
13:30 – 15:00	Tutorial Talk Dr. Kai-Min Chung: Toward Cryptography for Modern Parallel Architecture
15:00 – 15:10	Conference Closing & Best Presentation Award Ceremony Chair: Siu-Wing Cheng
15:10 – 18:00	Short City Tour

Long Talk Session L1

Tetsuo Asano, Hirotaka Ono and Masafumi Yamashita. How Much Work Space Do We Need to Find a Closest Element in an Array in Sublinear Time?
Siu-Wing Cheng, Juyoung Yon, Sang Won Bae, Otfried Cheong and Bryan T. Wilkinson. Approximating Convex Shapes with respect to Symmetric Difference under Homotheties
Eunjin Oh, Sang Won Bae and Hee-Kap Ahn. Computing a Geodesic Two-Center of Points in a Simple Polygon

Long Talk Session L2

Yuichi Asahiro, Yuya Doi, Eiji Miyano and Hirotaka Shimizu. Approximation Algorithms to Find Maximum Distance-Bounded Subgraphs
Louxin Zhang. The Tree and Cluster Containment Problems in Phylogenetics
Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Chia-Wei Lee and Peter Rossmanith. Fixed-parameter Algorithms for a Class of Generalized Vetex Cover Problems

Long Talk Session L3

Chih-Kuan Yeh, Te-Li Wang and Ho-Lin Chen. An Improved Tax Scheme for Selfish Routing
Shengyu Zhang. A survey on logrank conjecture on communication complexity of composed functions

Long Talk Session L4

Fu-Hong Liu, Hsiang-Hsuan Liu and Prudence W.H. Wong. Optimal Nonpreemptive Scheduling in Smart Grid
Sho Toyooka and Kunihiko Sadakane. Estimating L0 norm in non-strict turnstile stream

Session A1 Computational Geometry

Eunjin Oh, Luis Barba and Hee-Kap Ahn. An Improved Algorithm for Computing the Farthest-point Geodesic Voronoi Diagram
Sang Won Bae, Ji-Won Park and Sang Duk Yoon. Nearest Beacon Covering of Rectilinear Polygons
Prosenjit Bose, Jean-Lou De Carufel and André van Renssen. Constrained Generalized Delaunay Graphs Are Plane Spanners
Tsunehiko Nagayama and Kunihiko Sadakane. Faster Max-flow Algorithms using SPQR-trees
Atsushi Koike. A Tree-based Labeling Algorithm for Shortest Path Queries in Road Networks
Ferran Roure, Xavier Lladó, Joaquim Salvi and Yago Díez. Range Searching Data Structures for point Cloud Matching

Session B1 Graph Algorithms
Hiroshi Eto, Zhilong Liu and Eiji Miyano. Simple approximation algorithms for the distance-3 independent set problem on cubic graphs
Haruka Mizuta, Takehiro Ito and Xiao Zhou. Reachability between Steiner Trees in a Graph
Boting Yang. Fast-Mixed Searching and Related Problems on Graphs
Shuhei Denzumi. Finding Approximate Median Strings Using Directed Acyclic Graphs
Wei-Lin Wang and Sheung-Hung Poon. On Complexity of Total Vertex Cover on Subcubic Graphs
Hsuan-Wei Wang, Wen-Yen Lin and Pao-Lien Lai. A construction of independent spanning trees in hierarchical crossed cubes

Session A2 Approximation Algorithms

Yuko Kuroki and Tomomi Matsui. Approximation Algorithms for Hub Location Problems
Kai Wang, Hong-Jyun Wang and Ho-Lin Chen. Routing Games with Priorities
Yi-Hua Yang and Chung-Shou Liao. Online Buffer Management for Packets with Constant Density
Xiao Zhang. Barrier Coverage by Wireless Sensors
I-Hsuan Wu and Chung-Shou Liao. Online Dynamic Power Management
Ren-Ce Luo, Mong-Jen Kao and Der-Tsai Lee. Multi-Core Coherent Speed Scaling to Minimize Energy Consumption

Session B2 Experimental Algorithms

Shao-Chieh Lin and Chung-Shou Liao. Fast Route Planning with Geographical Information
Jean-François Baffier, Yago Diez Donoso and Matias Korman. Implementation of Stack Structure with Limited Memory
Nuwan Ganganath, Chi-Tsun Cheng and Chi K. Tse. Yet Another Path Replanner
Jheng-Nan Huang, Tzung-Pei Hong and Ming-Chao Chiang. An Effective Method for Approximate Representation of Frequent Itemsets
Yi-Chun Yao and Cheng-Hung Wu. Dynamic Production Scheduling of Inequivalent Machines with Real-Time Machine Health Information
Wen-Yu Chung, Chun-Wei Liang and Hong-Wei Huang. Feature extraction and selection in image retrieval

Session A3 Fixed Parameter Algorithms

Mohd Shahrizan Bin Othman, Aleksandar Shurbevski and Hiroshi Nagamochi. Exact Algorithms for the Bipartite Traveling Salesman Problem
Norhazwani Md Yunos, Aleksandar Shurbevski and Hiroshi Nagamochi. A Polynomial-space Exact Algorithm for the TSP in Degree-7 Graphs
Tesshu Hanaka and Hirotaka Ono. Maximum Weighted Minimal Vertex Separator

Session B3 Auction, Anonymization, and Cryptography

Jun Takita, Yasushi Kawase and Tomomi Matsui. Auction Algorithm for Weighted Matroid Partitioning Problem
Fu-Hong Liu and Hsiang-Hsuan Liu. Bipartite Degree Anonymization by Edge Addition
Yu-Chi Chen, Sherman S. M. Chow, Kai-Min Chung, Russell W. F. Lai, Wei-Kai Lin and Hong-Sheng Zhou. Cryptography for Parallel RAM from Indistinguishability Obfuscation

Saturday, May 14, 2016

Sunday, May 15, 2016

Monday, May 16, 2016

Long Talk Session L1

Tetsuo Asano, Hirotaka Ono and Masafumi Yamashita. How Much Work Space Do We Need to Find a Closest Element in an Array in Sublinear Time?

Siu-Wing Cheng, Juyoung Yon, Sang Won Bae, Otfried Cheong and Bryan T. Wilkinson. Approximating Convex Shapes with respect to Symmetric Difference under Homotheties

Eunjin Oh, Sang Won Bae and Hee-Kap Ahn. Computing a Geodesic Two-Center of Points in a Simple Polygon

Long Talk Session L2

Yuichi Asahiro, Yuya Doi, Eiji Miyano and Hirotaka Shimizu. Approximation Algorithms to Find Maximum Distance-Bounded Subgraphs

Louxin Zhang. The Tree and Cluster Containment Problems in Phylogenetics

Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Chia-Wei Lee and Peter Rossmanith. Fixed-parameter Algorithms for a Class of Generalized Vetex Cover Problems

Long Talk Session L3

Chih-Kuan Yeh, Te-Li Wang and Ho-Lin Chen. An Improved Tax Scheme for Selfish Routing

Shengyu Zhang. A survey on logrank conjecture on communication complexity of composed functions

Long Talk Session L4

Fu-Hong Liu, Hsiang-Hsuan Liu and Prudence W.H. Wong. Optimal Nonpreemptive Scheduling in Smart Grid

Sho Toyooka and Kunihiko Sadakane. Estimating L0 norm in non-strict turnstile stream

Session A1 Computational Geometry

Eunjin Oh, Luis Barba and Hee-Kap Ahn. An Improved Algorithm for Computing the Farthest-point Geodesic Voronoi Diagram

Sang Won Bae, Ji-Won Park and Sang Duk Yoon. Nearest Beacon Covering of Rectilinear Polygons

Prosenjit Bose, Jean-Lou De Carufel and André van Renssen. Constrained Generalized Delaunay Graphs Are Plane Spanners

Tsunehiko Nagayama and Kunihiko Sadakane. Faster Max-flow Algorithms using SPQR-trees

Atsushi Koike. A Tree-based Labeling Algorithm for Shortest Path Queries in Road Networks

Ferran Roure, Xavier Lladó, Joaquim Salvi and Yago Díez. Range Searching Data Structures for point Cloud Matching

Session B1 Graph Algorithms

Hiroshi Eto, Zhilong Liu and Eiji Miyano. Simple approximation algorithms for the distance-3 independent set problem on cubic graphs

Haruka Mizuta, Takehiro Ito and Xiao Zhou. Reachability between Steiner Trees in a Graph

Boting Yang. Fast-Mixed Searching and Related Problems on Graphs

Shuhei Denzumi. Finding Approximate Median Strings Using Directed Acyclic Graphs

Wei-Lin Wang and Sheung-Hung Poon. On Complexity of Total Vertex Cover on Subcubic Graphs

Hsuan-Wei Wang, Wen-Yen Lin and Pao-Lien Lai. A construction of independent spanning trees in hierarchical crossed cubes

Session A2 Approximation Algorithms

Yuko Kuroki and Tomomi Matsui. Approximation Algorithms for Hub Location Problems

Kai Wang, Hong-Jyun Wang and Ho-Lin Chen. Routing Games with Priorities

Yi-Hua Yang and Chung-Shou Liao. Online Buffer Management for Packets with Constant Density

Xiao Zhang. Barrier Coverage by Wireless Sensors

I-Hsuan Wu and Chung-Shou Liao. Online Dynamic Power Management

Ren-Ce Luo, Mong-Jen Kao and Der-Tsai Lee. Multi-Core Coherent Speed Scaling to Minimize Energy Consumption

Session B2 Experimental Algorithms

Shao-Chieh Lin and Chung-Shou Liao. Fast Route Planning with Geographical Information

Jean-François Baffier, Yago Diez Donoso and Matias Korman. Implementation of Stack Structure with Limited Memory

Nuwan Ganganath, Chi-Tsun Cheng and Chi K. Tse. Yet Another Path Replanner

Jheng-Nan Huang, Tzung-Pei Hong and Ming-Chao Chiang. An Effective Method for Approximate Representation of Frequent Itemsets

Yi-Chun Yao and Cheng-Hung Wu. Dynamic Production Scheduling of Inequivalent Machines with Real-Time Machine Health Information

Wen-Yu Chung, Chun-Wei Liang and Hong-Wei Huang. Feature extraction and selection in image retrieval

Session A3 Fixed Parameter Algorithms

Mohd Shahrizan Bin Othman, Aleksandar Shurbevski and Hiroshi Nagamochi. Exact Algorithms for the Bipartite Traveling Salesman Problem

Norhazwani Md Yunos, Aleksandar Shurbevski and Hiroshi Nagamochi. A Polynomial-space Exact Algorithm for the TSP in Degree-7 Graphs

Tesshu Hanaka and Hirotaka Ono. Maximum Weighted Minimal Vertex Separator

Session B3 Auction, Anonymization, and Cryptography

Jun Takita, Yasushi Kawase and Tomomi Matsui. Auction Algorithm for Weighted Matroid Partitioning Problem

Fu-Hong Liu and Hsiang-Hsuan Liu. Bipartite Degree Anonymization by Edge Addition

Yu-Chi Chen, Sherman S. M. Chow, Kai-Min Chung, Russell W. F. Lai, Wei-Kai Lin and Hong-Sheng Zhou. Cryptography for Parallel RAM from Indistinguishability Obfuscation