 | 2009 |
|---|
| 81 |       | Che-Nan Kuo,
Sun-Yuan Hsieh:
Fault-Free Cycles in Conditional Faulty Folded Hypercubes.
ICA3PP 2009: 439-448 |
| 80 | | Sun-Yuan Hsieh,
Yi-Ru Cian:
Fault-Tolerant Hamiltonicity of Augmented Cubes under the Conditional Fault Model.
ICA3PP 2009: 673-683 |
| 79 | | 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) |
| 78 | | 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) |
| 77 | | Sun-Yuan Hsieh,
Chia-Wei Lee:
Conditional Edge-Fault Hamiltonicity of Matching Composition Networks.
IEEE Trans. Parallel Distrib. Syst. 20(4): 581-592 (2009) |
| 76 | | Tsong-Jie Lin,
Sun-Yuan Hsieh,
Hui-Ling Huang:
Cycle and Path Embedding on 5-ary N-cubes.
ITA 43(1): 133-144 (2009) |
| 75 | | Sun-Yuan Hsieh,
Chang-Jen Tu:
Constructing edge-disjoint spanning trees in locally twisted cubes.
Theor. Comput. Sci. 410(8-10): 926-932 (2009) |
| 2008 |
|---|
| 74 | | Sun-Yuan Hsieh,
Chia-Wei Lee:
Diagnosability of Two-Matching Composition Networks.
COCOON 2008: 478-486 |
| 73 | | Sun-Yuan Hsieh,
Wen-Hao Pi:
On the Partial-Terminal Steiner Tree Problem.
ISPAN 2008: 173-177 |
| 72 | | Sun-Yuan Hsieh,
Chia-Wei Lee:
Hamiltonicity of Matching Composition Networks with Conditional Edge Faults.
TAMC 2008: 160-169 |
| 71 | | 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) |
| 70 | | 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) |
| 69 | | Sun-Yuan Hsieh,
Tzu-Hsiung Shen:
Edge-bipancyclicity of a hypercube with faulty vertices and edges.
Discrete Applied Mathematics 156(10): 1802-1808 (2008) |
| 68 | | Sun-Yuan Hsieh,
Yu-Shu Chen:
Strongly Diagnosable Systems under the Comparison Diagnosis Model.
IEEE Trans. Computers 57(12): 1720-1725 (2008) |
| 67 | | Sun-Yuan Hsieh,
Yu-Shu Chen:
Strongly Diagnosable Product Networks Under the Comparison Diagnosis Model.
IEEE Trans. Computers 57(6): 721-732 (2008) |
| 66 | | 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) |
| 65 | | Sun-Yuan Hsieh:
A note on cycle embedding in folded hypercubes with faulty elements.
Inf. Process. Lett. 108(2): 81 (2008) |
| 64 | | Sun-Yuan Hsieh:
Some edge-fault-tolerant properties of the folded hypercube.
Networks 51(2): 92-101 (2008) |
| 2007 |
|---|
| 63 | | 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 |
| 62 | | Sun-Yuan Hsieh,
Tsong-Jie Lin:
Embedding cycles and paths in a k-ary n-cube.
ICPADS 2007: 1-7 |
| 61 | | Sun-Yuan Hsieh,
Chang-De Wu,
Chao-Wen Huang:
Conditional edge-fault-tolerant Hamiltonian cycle embedding of star graphs.
ICPADS 2007: 1-8 |
| 60 | | 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 |
| 59 | | Sun-Yuan Hsieh,
Huang-Ming Gao,
Shih-Cheng Yang:
On the Internal Steiner Tree Problem.
TAMC 2007: 274-283 |
| 58 | | Sun-Yuan Hsieh:
Path Embedding on Folded Hypercubes.
TAMC 2007: 750-759 |
| 57 | | Sun-Yuan Hsieh:
A faster parallel connectivity algorithm on cographs.
Appl. Math. Lett. 20(3): 341-344 (2007) |
| 56 | | Sun-Yuan Hsieh,
Jung-Yiau Shiu:
Cycle embedding of augmented cubes.
Applied Mathematics and Computation 191(2): 314-319 (2007) |
| 55 | | 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) |
| 54 | | Sun-Yuan Hsieh:
The interval-merging problem.
Inf. Sci. 177(2): 519-524 (2007) |
| 53 | | 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) |
| 52 | | 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) |
| 51 | | Sun-Yuan Hsieh,
Huang-Ming Gao:
On the partial terminal Steiner tree problem.
The Journal of Supercomputing 41(1): 41-52 (2007) |
| 50 | | 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) |
| 49 | | 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) |
| 48 | | Sun-Yuan Hsieh,
Shih-Cheng Yang:
Approximating the selected-internal Steiner tree.
Theor. Comput. Sci. 381(1-3): 288-291 (2007) |
| 2006 |
|---|
| 47 | | Sun-Yuan Hsieh:
Fault-Free Pairwise Independent Hamiltonian Paths on Faulty Hypercubes.
Asia-Pacific Computer Systems Architecture Conference 2006: 373-379 |
| 46 | | Sun-Yuan Hsieh,
Shih-Cheng Yang:
MAX-SNP Hardness and Approximation of Selected-Internal Steiner Trees.
COCOON 2006: 449-458 |
| 45 |  | Sun-Yuan Hsieh,
Che-Nan Kuo:
Hamiltonian-Connectivity and Related Property on Folded Hypercubes.
FCS 2006: 48-50 |
| 44 | | Sun-Yuan Hsieh:
Linear-Time Algorithms for Two Subtree-Comparison Problems on Phylogenetic Trees with Different Species.
FSTTCS 2006: 164-175 |
| 43 | | Sun-Yuan Hsieh:
Fault-Tolerant Mutually Independent Hamiltonian Cycles Embedding on Hypercubes.
ICICIC (2) 2006: 288-292 |
| 42 | | Sun-Yuan Hsieh,
Pei-Yu Yu:
Cycle Embedding on Twisted Cubes.
PDCAT 2006: 102-104 |
| 41 | | Sun-Yuan Hsieh,
Huang-Ming Gao:
Hardness and Approximation of the Selected-Leaf-Terminal Steiner Tree Problem.
PDCAT 2006: 565-568 |
| 40 | | 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) |
| 39 | | 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) |
| 38 | | Sun-Yuan Hsieh,
Tien-Te Hsiao:
The k-degree Cayley graph and its topological properties.
Networks 47(1): 26-36 (2006) |
| 37 | | 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) |
| 2005 |
|---|
| 36 | | Sun-Yuan Hsieh:
Embedding of Cycles in the Faulty Hypercube.
Asia-Pacific Computer Systems Architecture Conference 2005: 229-235 |
| 35 | | 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 |
| 34 | | Sun-Yuan Hsieh,
Ting-Yu Chou:
Finding a Weight-Constrained Maximum-Density Subtree in a Tree.
ISAAC 2005: 944-953 |
| 33 | | Sun-Yuan Hsieh:
Efficiently parallelizable problems on a class of decomposable graphs.
J. Comput. Syst. Sci. 70(1): 140-156 (2005) |
| 32 | | 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) |
| 31 | | Sun-Yuan Hsieh:
Embedding longest fault-free paths onto star graphs with more vertex faults.
Theor. Comput. Sci. 337(1-3): 370-378 (2005) |
| 2004 |
|---|
| 30 | | Sun-Yuan Hsieh,
Tien-Te Hsiao:
The k-valent Graph: A New Family of Cayley Graphs for Interconnection.
ICPP 2004: 206-213 |
| 29 | | Sun-Yuan Hsieh,
Chun-Hua Chen:
Pancyclicity on Möbius Cubes with Edge Faults.
ISPAN 2004: 168-173 |
| 28 | | Sun-Yuan Hsieh:
Characterization of Efficiently Parallel Solvable Problems on a Class of Decomposable Graphs.
International Conference on Computational Science 2004: 223-230 |
| 27 | | Sun-Yuan Hsieh,
Zhe-Nan Guo:
Strongly Hyper-Hamiltonian-Laceability of Hypercubes.
PDPTA 2004: 1081-1083 |
| 26 | | 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) |
| 25 | | Sun-Yuan Hsieh,
Chun-Hua Chen:
Pancyclicity on Möbius cubes with maximal edge faults.
Parallel Computing 30(3): 407-421 (2004) |
| 2002 |
|---|
| 24 | | 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 |
| 23 | | 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) |
| 22 | | Sun-Yuan Hsieh:
On vertex ranking of a starlike graph.
Inf. Process. Lett. 82(3): 131-135 (2002) |
| 21 | | 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) |
| 2001 |
|---|
| 20 | | 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) |
| 19 | | 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 |
|---|
| 18 | | 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) |
| 17 | | Sun-Yuan Hsieh,
Gen-Huey Chen,
Chin-Wen Ho:
Hamiltonian-laceability of star graphs.
Networks 36(4): 225-232 (2000) |
| 1999 |
|---|
| 16 | | Sun-Yuan Hsieh:
Parallel Decomposition of Distance-Hereditary Graphs.
ACPC 1999: 417-426 |
| 15 | | 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) |
| 14 | | 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) |
| 13 | | 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) |
| 1998 |
|---|
| 12 | | 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 |
| 11 | | Sun-Yuan Hsieh,
Gen-Huey Chen,
Chin-Wen Ho:
Embed Longest Rings onto Star Graphs with Vertex Faults.
ICPP 1998: 140-147 |
| 10 | | 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 |
| 9 | | 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 |
| 8 | | 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) |
| 1997 |
|---|
| 7 | | Sun-Yuan Hsieh,
Gen-Huey Chen,
Chin-Wen Ho:
Fault-Tolerant Ring Embedding in Faulty Arrangement Graphs.
ICPADS 1997: 744-749 |
| 6 | | 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- |
| 5 | | 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 |
| 4 | | Maw-Shang Chang,
Sun-Yuan Hsieh,
Gen-Huey Chen:
Dynamic Programming on Distance-Hereditary Graphs.
ISAAC 1997: 344-353 |
| 3 | | Sun-Yuan Hsieh,
Gen-Huey Chen,
Chin-Wen Ho:
Hamiltonian-Laceability of Star Graphs.
ISPAN 1997: 112-117 |
| 2 | | Sun-Yuan Hsieh,
Chin-Wen Ho,
Gen-Huey Chen:
Parallel Decomposition of Generalized Series-Parallel Graphs.
PDPTA 1997: 890-896 |
| 1994 |
|---|
| 1 | | Sun-Yuan Hsieh,
Chin-Wen Ho:
An Efficient Parallel Strategy for Recognizing Series-Parallel Graphs.
ISAAC 1994: 496-504 |
