The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Sun-Yuan Hsieh: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Sun-Yuan Hsieh
    Fault-Free Pairwise Independent Hamiltonian Paths on Faulty Hypercubes. [Citation Graph (0, 0)][DBLP]
    Asia-Pacific Computer Systems Architecture Conference, 2006, pp:373-379 [Conf]
  2. Sun-Yuan Hsieh
    Embedding of Cycles in the Faulty Hypercube. [Citation Graph (0, 0)][DBLP]
    Asia-Pacific Computer Systems Architecture Conference, 2005, pp:229-235 [Conf]
  3. Sun-Yuan Hsieh
    Parallel Decomposition of Distance-Hereditary Graphs. [Citation Graph (0, 0)][DBLP]
    ACPC, 1999, pp:417-426 [Conf]
  4. Sun-Yuan Hsieh, Gen-Huey Chen, Chin-Wen Ho
    An Optimal Parallel Algorithm for the Perfect Dominating Set Problem on Distance-Hereditary Graphs. [Citation Graph (0, 0)][DBLP]
    ASIAN, 1998, pp:113-124 [Conf]
  5. Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko
    Efficient Algorithms for the Hamiltonian Problem on Distance-Hereditary Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:77-86 [Conf]
  6. Sun-Yuan Hsieh, Shih-Cheng Yang
    MAX-SNP Hardness and Approximation of Selected-Internal Steiner Trees. [Citation Graph (0, 0)][DBLP]
    COCOON, 2006, pp:449-458 [Conf]
  7. Sun-Yuan Hsieh, Che-Nan Kuo
    Hamiltonian-Connectivity and Related Property on Folded Hypercubes. [Citation Graph (0, 0)][DBLP]
    FCS, 2006, pp:48-50 [Conf]
  8. Sun-Yuan Hsieh
    Linear-Time Algorithms for Two Subtree-Comparison Problems on Phylogenetic Trees with Different Species. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2006, pp:164-175 [Conf]
  9. Sun-Yuan Hsieh
    Characterization of Efficiently Parallel Solvable Problems on a Class of Decomposable Graphs. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science, 2004, pp:223-230 [Conf]
  10. Sun-Yuan Hsieh, Nai-Wen Chang
    Cycle Embedding on the Möbius Cube with Both Faulty Nodes and Faulty Edges. [Citation Graph (0, 0)][DBLP]
    ICPADS (2), 2005, pp:620-624 [Conf]
  11. Sun-Yuan Hsieh, Gen-Huey Chen, Chin-Wen Ho
    Fault-Tolerant Ring Embedding in Faulty Arrangement Graphs. [Citation Graph (0, 0)][DBLP]
    ICPADS, 1997, pp:744-749 [Conf]
  12. Sun-Yuan Hsieh, Gen-Huey Chen, Chin-Wen Ho
    Embed Longest Rings onto Star Graphs with Vertex Faults. [Citation Graph (0, 0)][DBLP]
    ICPP, 1998, pp:140-147 [Conf]
  13. Sun-Yuan Hsieh, Tien-Te Hsiao
    The k-valent Graph: A New Family of Cayley Graphs for Interconnection. [Citation Graph (0, 0)][DBLP]
    ICPP, 2004, pp:206-213 [Conf]
  14. Sun-Yuan Hsieh, Chin-Wen Ho, Gen-Huey Chen, Tsan-sheng Hsu, Ming-Tat Ko
    . Efficient Parallel Algorithms on Distance-Hereditary Graphs. [Citation Graph (0, 0)][DBLP]
    ICPP, 1997, pp:20-0 [Conf]
  15. 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. [Citation Graph (0, 0)][DBLP]
    IPPS, 1997, pp:603-607 [Conf]
  16. 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. [Citation Graph (0, 0)][DBLP]
    IRREGULAR, 1998, pp:298-309 [Conf]
  17. Maw-Shang Chang, Sun-Yuan Hsieh, Gen-Huey Chen
    Dynamic Programming on Distance-Hereditary Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1997, pp:344-353 [Conf]
  18. Sun-Yuan Hsieh, Ting-Yu Chou
    Finding a Weight-Constrained Maximum-Density Subtree in a Tree. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:944-953 [Conf]
  19. Sun-Yuan Hsieh, Chin-Wen Ho
    An Efficient Parallel Strategy for Recognizing Series-Parallel Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:496-504 [Conf]
  20. Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Gen-Huey Chen
    Characterization of Efficiently Solvable Problems on Distance-Hereditary Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1998, pp:257-266 [Conf]
  21. Sun-Yuan Hsieh, Chun-Hua Chen
    Pancyclicity on Möbius Cubes with Edge Faults. [Citation Graph (0, 0)][DBLP]
    ISPAN, 2004, pp:168-173 [Conf]
  22. Sun-Yuan Hsieh, Gen-Huey Chen, Chin-Wen Ho
    Hamiltonian-Laceability of Star Graphs. [Citation Graph (0, 0)][DBLP]
    ISPAN, 1997, pp:112-117 [Conf]
  23. Sun-Yuan Hsieh, Pei-Yu Yu
    Cycle Embedding on Twisted Cubes. [Citation Graph (0, 0)][DBLP]
    PDCAT, 2006, pp:102-104 [Conf]
  24. Sun-Yuan Hsieh, Huang-Ming Gao
    Hardness and Approximation of the Selected-Leaf-Terminal Steiner Tree Problem. [Citation Graph (0, 0)][DBLP]
    PDCAT, 2006, pp:565-568 [Conf]
  25. Sun-Yuan Hsieh, Zhe-Nan Guo
    Strongly Hyper-Hamiltonian-Laceability of Hypercubes. [Citation Graph (0, 0)][DBLP]
    PDPTA, 2004, pp:1081-1083 [Conf]
  26. Sun-Yuan Hsieh, Chin-Wen Ho, Gen-Huey Chen
    Parallel Decomposition of Generalized Series-Parallel Graphs. [Citation Graph (0, 0)][DBLP]
    PDPTA, 1997, pp:890-896 [Conf]
  27. Sun-Yuan Hsieh
    Fault-Tolerant Mutually Independent Hamiltonian Cycles Embedding on Hypercubes. [Citation Graph (0, 0)][DBLP]
    ICICIC (2), 2006, pp:288-292 [Conf]
  28. Sun-Yuan Hsieh
    A faster parallel connectivity algorithm on cographs. [Citation Graph (0, 0)][DBLP]
    Appl. Math. Lett., 2007, v:20, n:3, pp:341-344 [Journal]
  29. Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko
    The Hamiltonian problem on distance-hereditary graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:3, pp:508-524 [Journal]
  30. Sun-Yuan Hsieh
    On vertex ranking of a starlike graph. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:82, n:3, pp:131-135 [Journal]
  31. Sun-Yuan Hsieh
    The interval-merging problem. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 2007, v:177, n:2, pp:519-524 [Journal]
  32. 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. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:35, n:1, pp:50-81 [Journal]
  33. Sun-Yuan Hsieh, Pei-Yu Yu
    Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2007, v:13, n:2, pp:153-162 [Journal]
  34. Sun-Yuan Hsieh
    Efficiently parallelizable problems on a class of decomposable graphs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2005, v:70, n:1, pp:140-156 [Journal]
  35. Chin-Wen Ho, Sun-Yuan Hsieh, Gen-Huey Chen
    Parallel Decomposition of Generalized Series-Parallel Graphs. [Citation Graph (0, 0)][DBLP]
    J. Inf. Sci. Eng., 1999, v:15, n:3, pp:407-417 [Journal]
  36. Sun-Yuan Hsieh, Che-Nan Kuo
    1-vertex-hamiltonian-laceability of Hypercubes with Maximal Edge Faults. [Citation Graph (0, 0)][DBLP]
    Journal of Interconnection Networks, 2005, v:6, n:4, pp:407-416 [Journal]
  37. 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. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1998, v:51, n:2, pp:89-113 [Journal]
  38. Sun-Yuan Hsieh
    An efficient parallel strategy for the two-fixed-endpoint Hamiltonian path problem on distance-hereditary graphs . [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2004, v:64, n:5, pp:662-685 [Journal]
  39. Sun-Yuan Hsieh, Gen-Huey Chen, Chin-Wen Ho
    Hamiltonian-laceability of star graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 2000, v:36, n:4, pp:225-232 [Journal]
  40. Sun-Yuan Hsieh, Tien-Te Hsiao
    The k-degree Cayley graph and its topological properties. [Citation Graph (0, 0)][DBLP]
    Networks, 2006, v:47, n:1, pp:26-36 [Journal]
  41. Sun-Yuan Hsieh
    Fault-tolerant cycle embedding in the hypercube with more both faulty vertices and faulty edges. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 2006, v:32, n:1, pp:84-91 [Journal]
  42. Sun-Yuan Hsieh, Chun-Hua Chen
    Pancyclicity on Möbius cubes with maximal edge faults. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 2004, v:30, n:3, pp:407-421 [Journal]
  43. Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Gen-Huey Chen
    Efficient Parallel Algorithms on Distance Hereditary Graphs. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1999, v:9, n:1, pp:43-52 [Journal]
  44. 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. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2002, v:15, n:4, pp:488-518 [Journal]
  45. Sun-Yuan Hsieh, Nai-Wen Chang
    Hamiltonian Path Embedding and Pancyclicity on the Möbius Cube with Faulty Nodes and Faulty Edges. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2006, v:55, n:7, pp:854-863 [Journal]
  46. Sun-Yuan Hsieh, Gen-Huey Chen, Chin-Wen Ho
    Longest Fault-Free Paths in Star Graphs with Edge Faults. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2001, v:50, n:9, pp:960-971 [Journal]
  47. Sun-Yuan Hsieh
    Embedding longest fault-free paths onto star graphs with more vertex faults. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:337, n:1-3, pp:370-378 [Journal]
  48. Sun-Yuan Hsieh, Gen-Huey Chen, Chin-Wen Ho
    Longest fault-free paths in star graphs with vertex faults. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:215-227 [Journal]
  49. Sun-Yuan Hsieh
    Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:370, n:1-3, pp:299-308 [Journal]
  50. Sun-Yuan Hsieh
    An efficient parallel strategy for the perfect domination problem on distance-hereditary graphs. [Citation Graph (0, 0)][DBLP]
    The Journal of Supercomputing, 2007, v:39, n:1, pp:39-57 [Journal]
  51. Sun-Yuan Hsieh
    An Efficient Parallel Algorithm for the Efficient Domination Problem on Distance-Hereditary Graphs. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2002, v:13, n:9, pp:985-993 [Journal]
  52. Sun-Yuan Hsieh, Gen-Huey Chen, Chin-Wen Ho
    Fault-Free Hamiltonian Cycles in Faulty Arrangement Graphs. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1999, v:10, n:3, pp:223-237 [Journal]
  53. Sun-Yuan Hsieh
    Path Embedding on Folded Hypercubes. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:750-759 [Conf]
  54. Sun-Yuan Hsieh, Huang-Ming Gao, Shih-Cheng Yang
    On the Internal Steiner Tree Problem. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:274-283 [Conf]
  55. Sun-Yuan Hsieh, Shih-Cheng Yang
    Approximating the selected-internal Steiner tree. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:381, n:1-3, pp:288-291 [Journal]
  56. Sun-Yuan Hsieh, Huang-Ming Gao
    On the partial terminal Steiner tree problem. [Citation Graph (0, 0)][DBLP]
    The Journal of Supercomputing, 2007, v:41, n:1, pp:41-52 [Journal]

  57. Diagnosability of Two-Matching Composition Networks. [Citation Graph (, )][DBLP]


  58. Fault-Tolerant Hamiltonicity of Augmented Cubes under the Conditional Fault Model. [Citation Graph (, )][DBLP]


  59. Fault-Free Cycles in Conditional Faulty Folded Hypercubes. [Citation Graph (, )][DBLP]


  60. Fault-free Hamiltonian cycles in locally twisted cubes under conditional edge faults. [Citation Graph (, )][DBLP]


  61. Conditional edge-fault-tolerant Hamiltonian cycle embedding of star graphs. [Citation Graph (, )][DBLP]


  62. Embedding cycles and paths in a k-ary n-cube. [Citation Graph (, )][DBLP]


  63. On the Partial-Terminal Steiner Tree Problem. [Citation Graph (, )][DBLP]


  64. Hamiltonicity of Matching Composition Networks with Conditional Edge Faults. [Citation Graph (, )][DBLP]


  65. Longest Fault-Free Paths in Hypercubes with both Faulty Nodes and Edges. [Citation Graph (, )][DBLP]


  66. Edge-bipancyclicity of a hypercube with faulty vertices and edges. [Citation Graph (, )][DBLP]


  67. 1-vertex-fault-tolerant cycles embedding on folded hypercubes. [Citation Graph (, )][DBLP]


Search in 0.061secs, Finished in 0.065secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002