- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j75 |      | Chao-Wen Huang, Chia-Wei Lee, Huang-Ming Gao, Sun-Yuan Hsieh: The internal Steiner tree problem: Hardness and approximations. J. Complexity 29(1): 27-43 (2013) |
| j74 | | Nai-Wen Chang, Sun-Yuan Hsieh: {2, 3}{2, 3}-Extraconnectivities of hypercube-like networks. J. Comput. Syst. Sci. 79(5): 669-688 (2013) |
| j73 | | Sun-Yuan Hsieh, Chi-Ya Kao: The Conditional Diagnosability of k-Ary n-Cubes under the Comparison Diagnosis Model. IEEE Trans. Computers 62(4): 839-843 (2013) |
| j72 | | Chun-An Chen, Sun-Yuan Hsieh: Component-Composition Graphs: (t, k)-Diagnosability and Its Application. IEEE Trans. Computers 62(6): 1097-1110 (2013) |
| j71 | | Che-Nan Kuo, Hsin-Hung Chou, Nai-Wen Chang, Sun-Yuan Hsieh: Fault-tolerant path embedding in folded hypercubes with both node and edge faults. Theor. Comput. Sci. 475: 82-91 (2013) |
| j70 | | Chun-An Chen, Sun-Yuan Hsieh: t/t-Diagnosability of regular graphs under the PMC model. ACM Trans. Design Autom. Electr. Syst. 18(2): 20 (2013) |
| 2012 | ||
| j69 | | Chia-Wei Lee, Sun-Yuan Hsieh: Pancyclicity of Matching Composition Networks under the Conditional Fault Model. IEEE Trans. Computers 61(2): 278-183 (2012) |
| j68 | | Sun-Yuan Hsieh, Ying-Chi Yang: A Classified Multisuffix Trie for IP Lookup and Update. IEEE Trans. Computers 61(5): 726-731 (2012) |
| j67 | | Sun-Yuan Hsieh, Ying-Hsuan Chang: Extraconnectivity of k-ary n-cube networks. Theor. Comput. Sci. 443: 63-69 (2012) |
| j66 | | Nai-Wen Chang, Sun-Yuan Hsieh: Conditional Diagnosability of Augmented Cubes under the PMC Model. IEEE Trans. Dependable Sec. Comput. 9(1): 46-60 (2012) |
| j65 | | Nai-Wen Chang, Tzu-Yin Lin, Sun-Yuan Hsieh: Conditional Diagnosability of k-Ary n-Cubes under the PMC Model. ACM Trans. Design Autom. Electr. Syst. 17(4): 46 (2012) |
| j64 | | Tsong-Jie Lin, Sun-Yuan Hsieh, Justie Su-tzu Juan: Embedding Cycles and Paths in Product Networks and Their Applications to Multiprocessor Systems. IEEE Trans. Parallel Distrib. Syst. 23(6): 1081-1089 (2012) |
| j63 | | Won-Sin Hong, Sun-Yuan Hsieh: Strong Diagnosability and Conditional Diagnosability of Augmented Cubes Under the Comparison Diagnosis Model. IEEE Transactions on Reliability 61(1): 140-148 (2012) |
| 2011 | ||
| j62 | | Sun-Yuan Hsieh, Yi-Ling Huang, Ying-Chi Yang: Multiprefix Trie: A New Data Structure for Designing Dynamic Router-Tables. IEEE Trans. Computers 60(5): 693-706 (2011) |
| j61 | | Chun-An Chen, Sun-Yuan Hsieh: (t, k)-Diagnosis for Component-Composition Graphs under the MM* Model. IEEE Trans. Computers 60(12): 1704-1717 (2011) |
| j60 | | Chao-Wen Huang, Wun-Shiun Lee, Sun-Yuan Hsieh: An Improved Heuristic Algorithm for Finding Motif Signals in DNA Sequences. IEEE/ACM Trans. Comput. Biology Bioinform. 8(4): 959-975 (2011) |
| j59 | | Nai-Wen Chang, Sun-Yuan Hsieh: Fault-Tolerant Bipancyclicity of Faulty Hypercubes Under the Generalized Conditional-Fault Model. IEEE Transactions on Communications 59(12): 3400-3409 (2011) |
| j58 | | |
| j57 | | Chao-Wen Huang, Hui-Ling Huang, Sun-Yuan Hsieh: Edge-bipancyclicity of star graphs with faulty elements. Theor. Comput. Sci. 412(50): 6938-6947 (2011) |
| j56 | | Sun-Yuan Hsieh, Chia-Wei Lee: Diagnosability of Two-Matching Composition Networks under the MMast Model. IEEE Trans. Dependable Sec. Comput. 8(2): 246-255 (2011) |
| j55 | | Chia-Wei Lee, Sun-Yuan Hsieh: Determining the Diagnosability of (1, 2)-Matching Composition Networks and Its Applications. IEEE Trans. Dependable Sec. Comput. 8(3): 353-362 (2011) |
| c42 | | Sun-Yuan Hsieh, Chi-Ya Kao: Determining the Conditional Diagnosability of k-Ary n-Cubes Under the MM* Model. SIROCCO 2011: 78-88 |
| 2010 | ||
| j54 | | Sun-Yuan Hsieh, Yi-Ru Cian: Conditional edge-fault Hamiltonicity of augmented cubes. Inf. Sci. 180(13): 2596-2617 (2010) |
| j53 | | Che-Nan Kuo, Sun-Yuan Hsieh: Pancyclicity and bipancyclicity of conditional faulty folded hypercubes. Inf. Sci. 180(15): 2904-2914 (2010) |
| j52 | | Sun-Yuan Hsieh, Chang-Yu Wu: Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults. J. Comb. Optim. 19(1): 16-30 (2010) |
| j51 | | Sun-Yuan Hsieh, Chia-Wei Lee: Pancyclicity of Restricted Hypercube-Like Networks under the Conditional Fault Model. SIAM J. Discrete Math. 23(4): 2100-2119 (2010) |
| j50 | | Sun-Yuan Hsieh, Ting-Yu Chou: The weight-constrained maximum-density subtree problem and related problems in trees. The Journal of Supercomputing 54(3): 366-380 (2010) |
| c41 | | Sun-Yuan Hsieh, Chun-An Chen: Computing the (t, k)-Diagnosability of Component-Composition Graphs and Its Application. ISAAC (2) 2010: 363-374 |
| c40 | | Sun-Yuan Hsieh, Tsong-Jie Lin: Super Fault-Tolerant Hamiltonicity of Product Networks. ISPA 2010: 236-243 |
| c39 |  | Sun-Yuan Hsieh, Tsong-Jie Lin, Justie Su-tzu Juan: Path Embeddings and Related Properties in Cartesian Product Graphs. PDPTA 2010: 508-514 |
| 2009 | ||
| j49 | | Sun-Yuan Hsieh, Che-Nan Kuo, Hui-Ling Huang: 1-vertex-fault-tolerant cycles embedding on folded hypercubes. Discrete Applied Mathematics 157(14): 3094-3098 (2009) |
| j48 | | Sun-Yuan Hsieh, Che-Nan Kuo, Hsin-Hung Chou: A further result on fault-free cycles in faulty folded hypercubes. Inf. Process. Lett. 110(2): 41-43 (2009) |
| j47 | | Tsong-Jie Lin, Sun-Yuan Hsieh, Hui-Ling Huang: Cycle and Path Embedding on 5-ary N-cubes. ITA 43(1): 133-144 (2009) |
| j46 | | Sun-Yuan Hsieh, Yu-Fen Weng: Fault-Tolerant Embedding of Pairwise Independent Hamiltonian Paths on a Faulty Hypercube with Edge Faults. Theory Comput. Syst. 45(2): 407-425 (2009) |
| j45 | | Sun-Yuan Hsieh, Tsong-Jie Lin: Panconnectivity and edge-pancyclicity of k-ary n-cubes. Networks 54(1): 1-11 (2009) |
| j44 | | Sun-Yuan Hsieh, Chang-Jen Tu: Constructing edge-disjoint spanning trees in locally twisted cubes. Theor. Comput. Sci. 410(8-10): 926-932 (2009) |
| j43 | | Sun-Yuan Hsieh, Chang-De Wu: Optimal fault-tolerant Hamiltonicity of star graphs with conditional edge faults. The Journal of Supercomputing 49(3): 354-372 (2009) |
| j42 | | Sun-Yuan Hsieh, Tsung-Yen Chuang: The Strong Diagnosability of Regular Networks and Product Networks under the PMC Model. IEEE Trans. Parallel Distrib. Syst. 20(3): 367-378 (2009) |
| j41 | | Sun-Yuan Hsieh, Chia-Wei Lee: Conditional Edge-Fault Hamiltonicity of Matching Composition Networks. IEEE Trans. Parallel Distrib. Syst. 20(4): 581-592 (2009) |
| j40 | | Sun-Yuan Hsieh, Nai-Wen Chang: Extended Fault-Tolerant Cycle Embedding in Faulty Hypercubes. IEEE Transactions on Reliability 58(4): 702-710 (2009) |
| c38 | | Che-Nan Kuo, Sun-Yuan Hsieh: Fault-Free Cycles in Conditional Faulty Folded Hypercubes. ICA3PP 2009: 439-448 |
| c37 | | Sun-Yuan Hsieh, Yi-Ru Cian: Fault-Tolerant Hamiltonicity of Augmented Cubes under the Conditional Fault Model. ICA3PP 2009: 673-683 |
| 2008 | ||
| j39 | | Sun-Yuan Hsieh, Ming-Yu Chen: A DNA-based solution to the graph isomorphism problem using Adleman-Lipton model with stickers. Applied Mathematics and Computation 197(2): 672-686 (2008) |
| j38 | | Sun-Yuan Hsieh, Chao-Wen Huang, Hsin-Hung Chou: A DNA-based graph encoding scheme with its applications to graph isomorphism problems. Applied Mathematics and Computation 203(2): 502-512 (2008) |
| j37 | | Sun-Yuan Hsieh, Tzu-Hsiung Shen: Edge-bipancyclicity of a hypercube with faulty vertices and edges. Discrete Applied Mathematics 156(10): 1802-1808 (2008) |
| j36 | | Sun-Yuan Hsieh, Chih-Sheng Cheng: Finding a maximum-density path in a tree under the weight and length constraints. Inf. Process. Lett. 105(5): 202-205 (2008) |
| j35 | | Sun-Yuan Hsieh: A note on cycle embedding in folded hypercubes with faulty elements. Inf. Process. Lett. 108(2): 81 (2008) |
| j34 | | Sun-Yuan Hsieh: Some edge-fault-tolerant properties of the folded hypercube. Networks 51(2): 92-101 (2008) |
| j33 | | Sun-Yuan Hsieh, Yu-Shu Chen: Strongly Diagnosable Product Networks Under the Comparison Diagnosis Model. IEEE Trans. Computers 57(6): 721-732 (2008) |
| j32 | | Sun-Yuan Hsieh, Yu-Shu Chen: Strongly Diagnosable Systems under the Comparison Diagnosis Model. IEEE Trans. Computers 57(12): 1720-1725 (2008) |
| c36 | | Sun-Yuan Hsieh, Chia-Wei Lee: Diagnosability of Two-Matching Composition Networks. COCOON 2008: 478-486 |
| c35 | | |
| c34 | | Sun-Yuan Hsieh, Chia-Wei Lee: Hamiltonicity of Matching Composition Networks with Conditional Edge Faults. TAMC 2008: 160-169 |
| 2007 | ||
| j31 | | Sun-Yuan Hsieh, Jung-Yiau Shiu: Cycle embedding of augmented cubes. Applied Mathematics and Computation 191(2): 314-319 (2007) |
| j30 | | Sun-Yuan Hsieh, Chao-Wen Huang: An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation. Applied Mathematics and Computation 193(2): 408-418 (2007) |
| j29 | | Sun-Yuan Hsieh: A faster parallel connectivity algorithm on cographs. Appl. Math. Lett. 20(3): 341-344 (2007) |
| j28 | | Sun-Yuan Hsieh, Che-Nan Kuo: Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes. Computers & Mathematics with Applications 53(7): 1040-1044 (2007) |
| j27 | | |
| j26 | | Sun-Yuan Hsieh, Pei-Yu Yu: Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges. J. Comb. Optim. 13(2): 153-162 (2007) |
| j25 | | Sun-Yuan Hsieh: Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species. Theor. Comput. Sci. 370(1-3): 299-308 (2007) |
| j24 | | Sun-Yuan Hsieh, Shih-Cheng Yang: Approximating the selected-internal Steiner tree. Theor. Comput. Sci. 381(1-3): 288-291 (2007) |
| j23 | | Sun-Yuan Hsieh: An efficient parallel strategy for the perfect domination problem on distance-hereditary graphs. The Journal of Supercomputing 39(1): 39-57 (2007) |
| j22 | | Sun-Yuan Hsieh, Huang-Ming Gao: On the partial terminal Steiner tree problem. The Journal of Supercomputing 41(1): 41-52 (2007) |
| j21 | | Sun-Yuan Hsieh, Tsong-Jie Lin, Hui-Ling Huang: Panconnectivity and edge-pancyclicity of 3-ary N -cubes. The Journal of Supercomputing 42(2): 225-233 (2007) |
| c33 | | Sun-Yuan Hsieh, Che-Nan Kuo, Hui-Ling Huang: Longest Fault-Free Paths in Hypercubes with both Faulty Nodes and Edges. FGCN (2) 2007: 605-608 |
| c32 | | |
| c31 | | Sun-Yuan Hsieh, Chang-De Wu, Chao-Wen Huang: Conditional edge-fault-tolerant Hamiltonian cycle embedding of star graphs. ICPADS 2007: 1-8 |
| c30 | | Sun-Yuan Hsieh, Chang-Yu Wu, Chia-Wei Lee: Fault-free Hamiltonian cycles in locally twisted cubes under conditional edge faults. ICPADS 2007: 1-8 |
| c29 | | Sun-Yuan Hsieh, Huang-Ming Gao, Shih-Cheng Yang: On the Internal Steiner Tree Problem. TAMC 2007: 274-283 |
| c28 | | |
| 2006 | ||
| j20 | | Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko: The Hamiltonian problem on distance-hereditary graphs. Discrete Applied Mathematics 154(3): 508-524 (2006) |
| j19 | | Sun-Yuan Hsieh, Tien-Te Hsiao: The k-degree Cayley graph and its topological properties. Networks 47(1): 26-36 (2006) |
| j18 | | Sun-Yuan Hsieh: Fault-tolerant cycle embedding in the hypercube with more both faulty vertices and faulty edges. Parallel Computing 32(1): 84-91 (2006) |
| j17 | | Sun-Yuan Hsieh, Nai-Wen Chang: Hamiltonian Path Embedding and Pancyclicity on the Möbius Cube with Faulty Nodes and Faulty Edges. IEEE Trans. Computers 55(7): 854-863 (2006) |
| c27 | | Sun-Yuan Hsieh: Fault-Free Pairwise Independent Hamiltonian Paths on Faulty Hypercubes. Asia-Pacific Computer Systems Architecture Conference 2006: 373-379 |
| c26 | | Sun-Yuan Hsieh, Shih-Cheng Yang: MAX-SNP Hardness and Approximation of Selected-Internal Steiner Trees. COCOON 2006: 449-458 |
| c25 | | Sun-Yuan Hsieh, Che-Nan Kuo: Hamiltonian-Connectivity and Related Property on Folded Hypercubes. FCS 2006: 48-50 |
| c24 | | Sun-Yuan Hsieh: Linear-Time Algorithms for Two Subtree-Comparison Problems on Phylogenetic Trees with Different Species. FSTTCS 2006: 164-175 |
| c23 | | Sun-Yuan Hsieh: Fault-Tolerant Mutually Independent Hamiltonian Cycles Embedding on Hypercubes. ICICIC (2) 2006: 288-292 |
| c22 | | |
| c21 | | Sun-Yuan Hsieh, Huang-Ming Gao: Hardness and Approximation of the Selected-Leaf-Terminal Steiner Tree Problem. PDCAT 2006: 565-568 |
| 2005 | ||
| j16 | | Sun-Yuan Hsieh: Efficiently parallelizable problems on a class of decomposable graphs. J. Comput. Syst. Sci. 70(1): 140-156 (2005) |
| j15 | | Sun-Yuan Hsieh, Che-Nan Kuo: 1-vertex-hamiltonian-laceability of Hypercubes with Maximal Edge Faults. Journal of Interconnection Networks 6(4): 407-416 (2005) |
| j14 | | Sun-Yuan Hsieh: Embedding longest fault-free paths onto star graphs with more vertex faults. Theor. Comput. Sci. 337(1-3): 370-378 (2005) |
| c20 | | Sun-Yuan Hsieh: Embedding of Cycles in the Faulty Hypercube. Asia-Pacific Computer Systems Architecture Conference 2005: 229-235 |
| c19 | | Sun-Yuan Hsieh, Nai-Wen Chang: Cycle Embedding on the Möbius Cube with Both Faulty Nodes and Faulty Edges. ICPADS (2) 2005: 620-624 |
| c18 | | Sun-Yuan Hsieh, Ting-Yu Chou: Finding a Weight-Constrained Maximum-Density Subtree in a Tree. ISAAC 2005: 944-953 |
| 2004 | ||
| j13 | | Sun-Yuan Hsieh: An efficient parallel strategy for the two-fixed-endpoint Hamiltonian path problem on distance-hereditary graphs . J. Parallel Distrib. Comput. 64(5): 662-685 (2004) |
| j12 | | Sun-Yuan Hsieh, Chun-Hua Chen: Pancyclicity on Möbius cubes with maximal edge faults. Parallel Computing 30(3): 407-421 (2004) |
| c17 | | Sun-Yuan Hsieh: Characterization of Efficiently Parallel Solvable Problems on a Class of Decomposable Graphs. International Conference on Computational Science 2004: 223-230 |
| c16 | | Sun-Yuan Hsieh, Tien-Te Hsiao: The k-valent Graph: A New Family of Cayley Graphs for Interconnection. ICPP 2004: 206-213 |
| c15 | | |
| c14 | | Sun-Yuan Hsieh, Zhe-Nan Guo: Strongly Hyper-Hamiltonian-Laceability of Hypercubes. PDPTA 2004: 1081-1083 |
| 2002 | ||
| j11 | | |
| j10 | | Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Gen-Huey Chen: Characterization of Efficiently Parallel Solvable Problems on Distance-Hereditary Graphs. SIAM J. Discrete Math. 15(4): 488-518 (2002) |
| j9 | | Sun-Yuan Hsieh: An Efficient Parallel Algorithm for the Efficient Domination Problem on Distance-Hereditary Graphs. IEEE Trans. Parallel Distrib. Syst. 13(9): 985-993 (2002) |
| c13 | | Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko: Efficient Algorithms for the Hamiltonian Problem on Distance-Hereditary Graphs. COCOON 2002: 77-86 |
| 2001 | ||
| j8 | | Sun-Yuan Hsieh, Gen-Huey Chen, Chin-Wen Ho: Longest Fault-Free Paths in Star Graphs with Edge Faults. IEEE Trans. Computers 50(9): 960-971 (2001) |
| j7 | | Sun-Yuan Hsieh, Gen-Huey Chen, Chin-Wen Ho: Longest fault-free paths in star graphs with vertex faults. Theor. Comput. Sci. 262(1): 215-227 (2001) |
| 2000 | ||
| j6 | | Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Gen-Huey Chen: A Faster Implementation of a Parallel Tree Contraction Scheme and Its Application on Distance-Hereditary Graphs. J. Algorithms 35(1): 50-81 (2000) |
| j5 | | Sun-Yuan Hsieh, Gen-Huey Chen, Chin-Wen Ho: Hamiltonian-laceability of star graphs. Networks 36(4): 225-232 (2000) |
| 1999 | ||
| j4 | | Chin-Wen Ho, Sun-Yuan Hsieh, Gen-Huey Chen: Parallel Decomposition of Generalized Series-Parallel Graphs. J. Inf. Sci. Eng. 15(3): 407-417 (1999) |
| j3 | | Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Gen-Huey Chen: Efficient Parallel Algorithms on Distance Hereditary Graphs. Parallel Processing Letters 9(1): 43-52 (1999) |
| j2 | | Sun-Yuan Hsieh, Gen-Huey Chen, Chin-Wen Ho: Fault-Free Hamiltonian Cycles in Faulty Arrangement Graphs. IEEE Trans. Parallel Distrib. Syst. 10(3): 223-237 (1999) |
| c12 | | |
| 1998 | ||
| j1 | | Chin-Wen Ho, Sun-Yuan Hsieh, Gen-Huey Chen: An Efficient Parallel Strategy for Computing K-Terminal Reliability and Finding Most Vital Edges in 2-Trees and Partial 2-Trees. J. Parallel Distrib. Comput. 51(2): 89-113 (1998) |
| c11 | | Sun-Yuan Hsieh, Gen-Huey Chen, Chin-Wen Ho: An Optimal Parallel Algorithm for the Perfect Dominating Set Problem on Distance-Hereditary Graphs. ASIAN 1998: 113-124 |
| c10 | | Sun-Yuan Hsieh, Gen-Huey Chen, Chin-Wen Ho: Embed Longest Rings onto Star Graphs with Vertex Faults. ICPP 1998: 140-147 |
| c9 | | Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Gen-Huey Chen: A New Simple Parallel Tree Contraction Scheme and Its Application on Distance-Hereditary Graphs. IRREGULAR 1998: 298-309 |
| c8 | | Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Gen-Huey Chen: Characterization of Efficiently Solvable Problems on Distance-Hereditary Graphs. ISAAC 1998: 257-266 |
| 1997 | ||
| c7 | | Sun-Yuan Hsieh, Gen-Huey Chen, Chin-Wen Ho: Fault-Tolerant Ring Embedding in Faulty Arrangement Graphs. ICPADS 1997: 744-749 |
| c6 | | Sun-Yuan Hsieh, Chin-Wen Ho, Gen-Huey Chen, Tsan-sheng Hsu, Ming-Tat Ko: . Efficient Parallel Algorithms on Distance-Hereditary Graphs. ICPP 1997: 20- |
| c5 | | Chin-Wen Ho, Sun-Yuan Hsieh, Gen-Huey Chen: An Efficient Parallel Strategy for Computing K-terminal Reliability and Finding Most Vital Edge in 2-trees and Partial 2-trees. IPPS 1997: 603-607 |
| c4 | | Maw-Shang Chang, Sun-Yuan Hsieh, Gen-Huey Chen: Dynamic Programming on Distance-Hereditary Graphs. ISAAC 1997: 344-353 |
| c3 | | Sun-Yuan Hsieh, Gen-Huey Chen, Chin-Wen Ho: Hamiltonian-Laceability of Star Graphs. ISPAN 1997: 112-117 |
| c2 | | Sun-Yuan Hsieh, Chin-Wen Ho, Gen-Huey Chen: Parallel Decomposition of Generalized Series-Parallel Graphs. PDPTA 1997: 890-896 |
| 1994 | ||
| c1 | | Sun-Yuan Hsieh, Chin-Wen Ho: An Efficient Parallel Strategy for Recognizing Series-Parallel Graphs. ISAAC 1994: 496-504 |
Colors in the list of coauthors
Last update Sat May 25 14:41:25 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page