Session A1：Best Papers

1. Balancing a Complete Signed Graph by Changing Minimum Number of Edge Signs     (P.1)

   Po-Sun Wei, Bang Ye Wu

2. A New Domination Relation for Points in the Plane     (P.9)

   Yue-Li Wang, Jou-Ming Chang, Shyue-Ming Tang, Ro-Yu Wu

3. Exact Circular Pattern Matchings Using Bit-Parallelism and q-Gram Technique     (P.18)

   Kuei-Hao Chen, Guan-Shieng Huang, Richard Chia-Tung Lee

4. New Lower Bounds for the Three-dimensional Orthogonal Bin Packing Problem     (P.28)

   Chia-Hong Hsu, Chung-Shou Liao

5. Finding the Maximum Balanced Vertex Set on Complete Graphs     (P.42)

   Chun-Hsiang Bai, Bang Ye Wu

6. A New Filtration Method Based on the Locality Property for Approximate String Matching     (P.52)

   Chia Wei Lu, Richard Chia-Tung Lee

Session B1：Interconnection networks

1. A Longest Fault-free Cycle in Conditional Faulty Folded Hypercubes     (P.60)

   Wen-Yin Huang, Jia-Jie Liu, Jou-Ming Chang

2. A Note on "on The Power Dominating Sets of Hypercubes"     (P.65)

   Kung-Jui Pai, Wei-Jai Chiu

3. Upper Bounds on the 2-rainbow Domination Number of Grids     (P.69)

   Kung-Jui Pai, Yuan-Ching Jhou

4. Rainbow Connection Number in Triangular Pyramids     (P.73)

   Fu-Hsing Wang, Guo-Shi Sung

5. The Transformation of Optimal Independent Spanning Trees in Hypercubes     (P.77)

   Shyue-Ming Tang, Yu-Ting Li, Yue-Li Wang

6. Independent Spanning Trees on Cartesian Product of Hybrid Graphs     (P.82)

   Jinn-Shyong Yang, Jou-Ming Chang

Session C1：Experimental algorithms

1. A High Dynamic Range Imaging Algorithm Based on Moving Objects Processing     (P.89)

   Jiun-You Chen, Chen-Chung Liu

2. A Region-of-Interest Segmentation Algorithm for Palmprint Images     (P.96)

   Kai-Wen Chuang, Chen-Chung Liu, Sheng-Wen Zheng

3. Visual Cryptography for Gray-level Image by Random Grids     (P.103)

   Hui-Yu Hsu, Justie Su-Tzu Juan

4. Two-Secret Image Sharing Scheme by Shifting Random Grids     (P.109)

   Joy Jo-Yi Chang, Justie Su-Tzu Juan

5. Sequential Utility Mining with the Maximum Measure     (P.115)

   Guo-Cheng Lan, Tzung-Pei Hong, Vincent S. Tseng

Session A2：Algorithms

1. The Mixed Dominating Set Problem Is MAX SNP-hard     (P.120)

   Yen Hung Chen

2. Natural SNP-RFLP Primer Design Using Memetic Algorithm     (P.124)

   Yu-Huei Cheng, Li-Yeh Chuang, Cheng-Hong Yang

3. On the Repeating Group Finding Problem     (P.130)

   Bo-Ren Kung, Wen-Hsien Chen, Richard Chia-Tung Lee

4. Measure and Conquer: Analysis of a Branch-and-Reduce Algorithm for the Maximum Bounded-degree-1 Set Problem     (P.136)

   Maw-Shang Chang, Ling-Ju Hung, Ping-Chen Su

5. Performances of Protein Structure Alignment Algorithms under the MapReduce Framework     (P.146)

   Chen-En Hsien, Guan-Jie Hua, Yaw-Ling Lin, Che-Lun Hung

Session B2：Interconnection networks

1. A Cycle Embedding Problem for Cube-Connected Cycles Graphs     (P.154)

   Yen-Hsun Ho, Chey-Woei Tsay, Lih-Hsing Hsu, Tung-Yang Ho

2. Completely Conditional-fault Edge-bipancyclicity of Hypercubes     (P.160)

   Chao-Min Sun, Yue-Dar Jou, Chuen-Chyi Hung

3. Mutually Independent Hamiltonian Cycles of Cm * Cn when m, n Are Odd     (P.165)

   Kai-Siou Wu, Justie Su-Tzu Juan

4. Mutually Independent Hamiltonian Cycles of Double Loop Graphs     (P.171)

   Yung-Ling Lai, Sheng-Yu Xie

5. The Adjacent Vertices Fault-tolerance for Two-spannability of Star Graphs     (P.175)

   Chun-Nan Hung, Bo-Syun Tu

Session C2：Graph theory

1. A Note on the Structure of Locally Outerplanar Graphs     (P.182)

   Chun-Yu Tseng, Hung-Lung Wang

2. A Simple Research of Divisor Graphs     (P.186)

   Yu-Ping Tsao

3. Antibandwidth of Bipartite Graphs     (P.191)

   Wei-Yin Lin, An-Chiang Chu

4. The 2-Center Problem in Chordal Graphs     (P.196)

   Yu-Wei Chang, Hung-Lung Wang

5. On Power Domination of Generalized Petersen Graphs     (P.202)

   Yung-Ling Lai, Pei-Kang Chien, Sheng-Chieh Chou, Yi-Kai Kao

Session A3：String algorithms

1. A Bit-Parallel Algorithm to Solve the k-Nearest Neighbor String Matching Problem     (P.208)

   Chia-Shin Ou, Richard Chia-Tung Lee

2. The Efficiency of Discrete Convolution Method on Solving Exact String Matching Problem     (P.217)

   Kuan-Wei Hou, Richard Chia-Tung Lee

3. Finding a Longest Increasing Subsequence from the Paths in a Complete Bipartite Graph     (P.224)

   Guan-Yu Lin, Jia-Jie Liu, Yue-Li Wang

4. Computing the Longest Common Subsequence of Multiple RLE Strings     (P.228)

   Ling-Chih Yao, Kuan-Yu Chen

5. Volatility on Stock Exchanges and Exchange Rates Based on Pairwise Alignment     (P.235)

   Sheng-Lung Peng, Tzu-Chun Sheng, Yu-Wei Tsay

Session B3：Combinatorics

1. An Efficient Ranking Algorithm of t-ary Trees in Gray-code Order     (P.239)

   Ro-Yu Wu, Jou-Ming Chang, An-Hang Chen, Chun-Liang Liu

2. Selection Search for Mean and Temperature of Multi-Branch Combinatorial Games     (P.246)

   Kuo-Yuan Kao

3. Involution Binary Relations     (P.254)

   Chen-Ming Fan, Jen-Tse Wang, Cheng-Chih Huang

4. Dismantlable Digraphs and the Fixed Point Property     (P.259)

   Rueiher Tsaur

5. Trees of the Same Status Sequence     (P.264)

   Jen-Ling Shang

Session C3：Graph algorithms

1. A Heuristic Algorithm for the Selected-internal Minimum Spanning Tree Problem     (P.267)

   Chan-Shuo Liu, Yu Ting Kuo, Chung Wen Ma

2. Diagnosable Evaluation of General Biswapped Networks     (P.272)

   Jheng-Cheng Chen, Chang-Hsiung Tsai

3. A Study on Scalable Parallelism in Spider-Web Networks     (P.277)

   Li-Yen Hsu

4. MapReduce架構下的平行化局部診斷設計與模擬     (P.287)

   林泰毅、賴寶蓮、許弘駿

5. The Longest Path Problem on Permutation Graphs     (P.294)

   Ruei-Yuan Chang, Cheng-Hsien Hsu, Sheng-Lung Peng