| 2009 |
|---|
| 24 | EE | Hung-Chang Chan,
Jou-Ming Chang,
Yue-Li Wang,
Shi-Jinn Horng:
Geodesic-pancyclicity and fault-tolerant panconnectivity of augmented cubes.
Applied Mathematics and Computation 207(2): 333-339 (2009) |
| 23 | EE | Jinn-Shyong Yang,
Jou-Ming Chang,
Shyue-Ming Tang,
Yue-Li Wang:
On the independent spanning trees of recursive circulant graphs G(cdm, d) with d>2.
Theor. Comput. Sci. 410(21-23): 2001-2010 (2009) |
| 2008 |
|---|
| 22 | EE | Jou-Ming Chang,
Jinn-Shyong Yang:
Fault-tolerant cycle-embedding in alternating group graphs.
Applied Mathematics and Computation 197(2): 760-767 (2008) |
| 21 | EE | An-Hang Chen,
Jou-Ming Chang,
Yuwen Cheng,
Yue-Li Wang:
The existence and uniqueness of strong kings in tournaments.
Discrete Mathematics 308(12): 2629-2633 (2008) |
| 20 | EE | Kung-Jui Pai,
Jou-Ming Chang,
Yue-Li Wang:
A Note on "An improved upper bound on the queuenumber of the hypercube".
Inf. Process. Lett. 108(3): 107-109 (2008) |
| 2007 |
|---|
| 19 | EE | Hung-Chang Chan,
Jou-Ming Chang,
Yue-Li Wang,
Shi-Jinn Horng:
Geodesic-pancyclic graphs.
Discrete Applied Mathematics 155(15): 1971-1978 (2007) |
| 18 | | Jinn-Shyong Yang,
Jou-Ming Chang,
Shyue-Ming Tang,
Yue-Li Wang:
Reducing the Height of Independent Spanning Trees in Chordal Rings.
IEEE Trans. Parallel Distrib. Syst. 18(5): 644-657 (2007) |
| 17 | EE | Jinn-Shyong Yang,
Shyue-Ming Tang,
Jou-Ming Chang,
Yue-Li Wang:
Parallel construction of optimal independent spanning trees on hypercubes.
Parallel Computing 33(1): 73-79 (2007) |
| 2006 |
|---|
| 16 | | Jou-Ming Chang,
An-Hang Chen:
A Sufficient Condition for Quasi-Claw-Free Hamiltonian Graphs.
Ars Comb. 78: (2006) |
| 15 | EE | Fu-Hsing Wang,
Yue-Li Wang,
Jou-Ming Chang:
The lower and upper forcing geodetic numbers of block-cactus graphs.
European Journal of Operational Research 175(1): 238-245 (2006) |
| 14 | EE | Ro-Yu Wu,
Jou-Ming Chang,
Yue-Li Wang:
A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations.
Theor. Comput. Sci. 355(3): 303-314 (2006) |
| 2005 |
|---|
| 13 | EE | Ting-Yem Ho,
Jou-Ming Chang:
An efficient distributed algorithm for finding all hinge vertices in networks.
Int. J. Comput. Math. 82(7): 821-825 (2005) |
| 12 | EE | Yen-Ju Chen,
Jou-Ming Chang,
Yue-Li Wang:
An efficient algorithm for estimating rotation distance between two binary trees.
Int. J. Comput. Math. 82(9): 1095-1106 (2005) |
| 2004 |
|---|
| 11 | EE | Fu-Hsing Wang,
Yue-Li Wang,
Jou-Ming Chang:
Feedback vertex sets in star graphs.
Inf. Process. Lett. 89(4): 203-208 (2004) |
| 10 | EE | Jou-Ming Chang,
Jinn-Shyong Yang,
Yue-Li Wang,
Yuwen Cheng:
Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs.
Networks 44(4): 302-310 (2004) |
| 2003 |
|---|
| 9 | | Jou-Ming Chang,
Chin-Wen Ho,
Ming-Tat Ko:
Powers of Asteroidal Triple-free Graphs with Applications.
Ars Comb. 67: (2003) |
| 8 | EE | Jou-Ming Chang:
Induced matchings in asteroidal triple-free graphs.
Discrete Applied Mathematics 132(1-3): 67-78 (2003) |
| 7 | EE | Ting-Yem Ho,
Jou-Ming Chang:
Sorting a sequence of strong kings in a tournament.
Inf. Process. Lett. 87(6): 317-320 (2003) |
| 6 | EE | Fu-Hsing Wang,
Jou-Ming Chang,
Yue-Li Wang,
Sun-Jen Huang:
Distributed algorithms for finding the unique minimum distance dominating set in directed split-stars.
J. Parallel Distrib. Comput. 63(4): 481-487 (2003) |
| 2000 |
|---|
| 5 | EE | Ting-Yem Ho,
Jou-Ming Chang,
Yue-Li Wang:
On the powers of graphs with bounded asteroidal number.
Discrete Mathematics 223(1-3): 125-133 (2000) |
| 1999 |
|---|
| 4 | EE | Jou-Ming Chang,
Chin-Wen Ho,
Ming-Tat Ko:
LexBFS-Ordering in Asteroidal Triple-Free Graphs.
ISAAC 1999: 163-172 |
| 3 | EE | Chin-Wen Ho,
Jou-Ming Chang:
Solving the All-Pairs-Shortest-Lengt Problem on Chordal Bipartite Graphs.
Inf. Process. Lett. 69(2): 87-93 (1999) |
| 1998 |
|---|
| 2 | EE | Jou-Ming Chang,
Chin-Wen Ho:
The Recognition of Geodetically Connected Graphs.
Inf. Process. Lett. 65(2): 81-88 (1998) |
| 1997 |
|---|
| 1 | | Jou-Ming Chang,
Chiun-Chieh Hsu,
Yue-Li Wang,
Ting-Yem Ho:
Finding the Set of All Hinge Vertices for Strongly Chordal Graphs in Linear Time.
Inf. Sci. 99(3-4): 173-182 (1997) |
