| 國立成功大學 |
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 |
