| 國立成功大學 |
2009-03-01 |
Constructing edge-disjoint spanning trees in locally twisted cubes
|
Hsieh, Sun-Yuan; Tu, Chang-Jen |
| 國立成功大學 |
2009-03 |
The Strong Diagnosability of Regular Networks and Product Networks under the PMC Model
|
Hsieh, Sun-Yuan; Chuang, Tsung-Yen |
| 國立成功大學 |
2009-01 |
CYCLE AND PATH EMBEDDING ON 5-ARY N-CUBES
|
Lin, Tsong-Jie; Hsieh, Sun-Yuan; Huang, Hui-Ling |
| 國立成功大學 |
2008-12 |
Strongly Diagnosable Systems under the Comparison Diagnosis Model
|
Hsieh, Sun-Yuan; Chen, Yu-Shu |
| 國立成功大學 |
2008-09-30 |
A note on cycle embedding in folded hypercubes with faulty elements
|
Hsieh, Sun-Yuan |
| 國立成功大學 |
2008-09-15 |
A DNA-based graph encoding scheme with its applications to graph isomorphism problems
|
Hsieh, Sun-Yuan; Huang, Chao-Wen; Chou, Hsin-Hung |
| 國立成功大學 |
2008-06 |
Strongly diagnosable product networks under the comparison diagnosis model
|
Hsieh, Sun-Yuan; Chen, Yu-Shu |
| 國立成功大學 |
2008-05-28 |
Edge-bipancyclicity of a hypercube with faulty vertices and edges
|
Hsieh, Sun-Yuan; Shen, Tzu-Hsiung |
| 國立成功大學 |
2008-04-01 |
A DNA-based solution to the graph isomorphism problem using Adleman-Lipton model with stickers
|
Hsieh, Sun-Yuan; Chen, Ming-Yu |
| 國立成功大學 |
2008-03 |
Some edge-fault-tolerant properties of the folded hypercube
|
Hsieh, Sun-Yuan |
| 國立成功大學 |
2008-02-29 |
Finding a maximum-density path in a tree under the weight and length constraints
|
Hsieh, Sun-Yuan; Cheng, Chih-Sheng |
| 國立成功大學 |
2007-11-01 |
An effcient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation
|
Hsieh, Sun-Yuan; Huang, Chao-Wen |
| 國立成功大學 |
2007-11 |
Panconnectivity and edge-pancyclicity of 3-ary N-cubes
|
Hsieh, Sun-Yuan; Lin, Tsong-Jie; Huang, Hui-Ling |
| 國立成功大學 |
2007-08-22 |
Approximating the selected-internal Steiner tree
|
Hsieh, Sun-Yuan; Yang, Shih-Cheng |
| 國立成功大學 |
2007-08-15 |
Cycle embedding of augmented cubes
|
Hsieh, Sun-Yuan; Shiu, Jung-Yiau |
| 國立成功大學 |
2007-07 |
On the partial terminal Steiner tree problem
|
Hsieh, Sun-Yuan; Gao, Huang-Ming |
| 國立成功大學 |
2007-04 |
Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes
|
Hsieh, Sun-Yuan; Kuo, Che-Nan |
| 國立成功大學 |
2007-03 |
A faster parallel connectivity algorithm on cographs
|
Hsieh, Sun-Yuan |
| 國立成功大學 |
2007-02-12 |
Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species
|
Hsieh, Sun-Yuan |
| 國立成功大學 |
2007-02 |
Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
|
Hsieh, Sun-Yuan; Yu, Pei-Yu |
| 國立成功大學 |
2007-01-15 |
The interval-merging problem
|
Hsieh, Sun-Yuan |
| 國立成功大學 |
2007-01 |
An efficient parallel strategy for the perfect domination problem on distance-hereditary graphs
|
Hsieh, Sun-Yuan |
| 國立成功大學 |
2006-07 |
Hamiltonian path embedding and pancyclicity on the Mobius cube with faulty nodes and faulty edges
|
Hsieh, Sun-Yuan; Chang, Nai-Wen |
| 國立成功大學 |
2006-03-01 |
The Hamiltonian problem on distance-hereditary graphs
|
Hsieh, Sun-Yuan; Ho, Chin-Wen; Hsu, Tsan-Sheng; Ko, Ming-Tat |
| 國立成功大學 |
2006-01 |
The k-degree Cayley graph and its topological properties
|
Hsieh, Sun-Yuan; Hsiao, Tien-Te |
| 國立成功大學 |
2006-01 |
Fault-tolerant cycle embedding in the hypercube with more both faulty vertices and faulty edges
|
Hsieh, Sun-Yuan |
| 國立成功大學 |
2006 |
Fault-free pairwise independent Hamiltonian paths on faulty hypercubes
|
Hsieh, Sun-Yuan |
| 國立成功大學 |
2006 |
MAX-SNP hardness and approximation of selected-internal steiner trees
|
Hsieh, Sun-Yuan; Yang, Shih-Cheng |
| 國立成功大學 |
2005-07-09 |
Embedding longest fault-free paths onto star graphs with more vertex faults
|
Hsieh, Sun-Yuan |
| 國立成功大學 |
2005-02 |
Efficiently parallelizable problems on a class of decomposable graphs
|
Hsieh, Sun-Yuan |
| 國立成功大學 |
2005 |
Finding a weight-constrained maximum-density subtree in a tree
|
Hsieh, Sun-Yuan; Chou, Ting-Yu |
| 國立成功大學 |
2005 |
Embedding of cycles in the faulty hypercube
|
Hsieh, Sun-Yuan |
| 國立成功大學 |
2004-05 |
An efficient parallel strategy for the two-fixed-endpoint Hamiltonian path problem on distance-hereditary graphs
|
Hsieh, Sun-Yuan |
| 國立成功大學 |
2004-03 |
Pancyclicity on Mobius cubes with maximal edge faults
|
Hsieh, Sun-Yuan; Chen, Chun-Hua |
| 國立成功大學 |
2004 |
Characterization of efficiently parallel solvable problems on a class of decomposable graphs
|
Hsieh, Sun-Yuan |
| 國立成功大學 |
2003-12 |
A simple and fast parallel coloring algorithm for distance-hereditary graphs
|
Hsieh, Sun-Yuan |
| 國立成功大學 |
2002-09 |
An efficient parallel algorithm for the efficient domination problem on distance-hereditary graphs
|
Hsieh, Sun-Yuan |
| 國立成功大學 |
2002 |
Characterization of efficiently parallel solvable problems on distance-hereditary graphs
|
Hsieh, Sun-Yuan; Ho, Chin-Wen; Hsu, Tsan-Sheng; Ko, Ming-Tat; Chen, Gen-Huey |
| 國立臺灣大學 |
2001 |
Longest fault-free paths in star graphs with vertex faults
|
Hsieh, Sun-Yuan; Chen, Gen-Huey; Ho, Chin-Wen |
| 臺大學術典藏 |
2001 |
Longest fault-free paths in star graphs with vertex faults
|
Hsieh, Sun-Yuan; Chen, Gen-Huey; Ho, Chin-Wen; Hsieh, Sun-Yuan; Chen, Gen-Huey; Ho, Chin-Wen |
| 臺大學術典藏 |
2001 |
Longest Fault-Free Paths in Star Graphs with Edge Faults.
|
Hsieh, Sun-Yuan; Chen, Gen-Huey; Ho, Chin-Wen; GEN-HUEY CHEN |
| 臺大學術典藏 |
2001 |
Longest fault-free paths in star graphs with vertex faults.
|
Hsieh, Sun-Yuan; Chen, Gen-Huey; Ho, Chin-Wen; GEN-HUEY CHEN |
| 國立臺灣大學 |
2000-01 |
Embed a Longest Path between Arbitrary Two Vertices of a Faulty Star Graph
|
Hsieh, Sun-Yuan; Chen, Gen-Huey; Ho, Chin-Wen |
| 臺大學術典藏 |
2000-01 |
Embed a Longest Path between Arbitrary Two Vertices of a Faulty Star Graph
|
Hsieh, Sun-Yuan; Chen, Gen-Huey; Ho, Chin-Wen; Hsieh, Sun-Yuan; Chen, Gen-Huey; Ho, Chin-Wen |
| 國立臺灣大學 |
2000 |
A Faster Implementation of a Parallel Tree Contraction Scheme and Its Application on Distance-Hereditary Graphs
|
Hsieh, Sun-yuan; Ho, Chin-Wen; Hsu, Tsan-sheng; Ko, Ming-Tat; Chen, Gen-Huey |
| 國立臺灣大學 |
1999-12-07 |
Fault-Tolerant Embedding of Longest Paths in Star Graphs with Edge Faults
|
Hsieh, Sun-Yuan; Chen, Gen-Huey; Ho, Chin-Wen |
| 國立臺灣大學 |
1998-08 |
Embed longest rings onto star graphs with vertex faults
|
Hsieh, Sun-Yuan; Chen, Gen-Huey; Ho, Chin-Wen |
| 臺大學術典藏 |
1998-08 |
Embed longest rings onto star graphs with vertex faults
|
Hsieh, Sun-Yuan; Chen, Gen-Huey; Ho, Chin-Wen; Hsieh, Sun-Yuan; Chen, Gen-Huey; Ho, Chin-Wen |
| 國立臺灣大學 |
1998 |
An Efficient Parallel Strategy for ComputingK-Terminal Reliability and Finding Most Vital Edges in 2-Trees and Partial 2-Trees
|
Ho, Chin-Wen; Hsieh, Sun-Yuan; Chen, Gen-Huey |
| 臺大學術典藏 |
1998 |
Embed Longest Rings onto Star Graphs with Vertex Faults.
|
Hsieh, Sun-Yuan; Chen, Gen-Huey; Ho, Chin-Wen; GEN-HUEY CHEN |
