 | 2011 |
| 42 |  | Kuo-Hua Kao,
Jou-Ming Chang,
Yue-Li Wang,
Justie Su-tzu Juan:
A Quadratic Algorithm for Finding Next-to-Shortest Paths in Graphs.
Algorithmica 61(2): 402-418 (2011) |
| 41 |  | Jinn-Shyong Yang,
Hung-Chang Chan,
Jou-Ming Chang:
Broadcasting secure messages via optimal independent spanning trees in folded hypercubes.
Discrete Applied Mathematics 159(12): 1254-1263 (2011) |
| 40 |  | Ro-Yu Wu,
Jou-Ming Chang,
Yue-Li Wang:
Ranking and Unranking of t-Ary Trees Using RD-Sequences.
IEICE Transactions 94-D(2): 226-232 (2011) |
| 39 |  | Ro-Yu Wu,
Jou-Ming Chang,
Chir-Ho Chang:
Ranking and unranking of non-regular trees with a prescribed branching sequence.
Mathematical and Computer Modelling 53(5-6): 1331-1335 (2011) |
| 38 |  | Ro-Yu Wu,
Jou-Ming Chang,
Kung-Jui Pai,
Yue-Li Wang:
Amortized efficiency of generating planar paths in convex position.
Theor. Comput. Sci. 412(35): 4504-4512 (2011) |
| 2010 |
| 37 |  | Ro-Yu Wu,
Jou-Ming Chang,
Yue-Li Wang:
Loopless Generation of Non-regular Trees with a Prescribed Branching Sequence.
Comput. J. 53(6): 661-666 (2010) |
| 36 |  | Kung-Jui Pai,
Jou-Ming Chang,
Yue-Li Wang:
Restricted power domination and fault-tolerant power domination on grids.
Discrete Applied Mathematics 158(10): 1079-1089 (2010) |
| 35 |  | Kung-Jui Pai,
Jou-Ming Chang,
Yue-Li Wang:
Erratum to "A new upper bound on the queuenumber of hypercubes" [Discrete Mathematics 310 (2010) 935-939].
Discrete Mathematics 310(13-14): 2059 (2010) |
| 34 |  | Kung-Jui Pai,
Jou-Ming Chang,
Yue-Li Wang:
A new upper bound on the queuenumber of hypercubes.
Discrete Mathematics 310(4): 935-939 (2010) |
| 33 |  | Shyue-Ming Tang,
Jinn-Shyong Yang,
Yue-Li Wang,
Jou-Ming Chang:
Independent Spanning Trees on Multidimensional Torus Networks.
IEEE Trans. Computers 59(1): 93-102 (2010) |
| 32 |  | Jia-Cian Lin,
Jinn-Shyong Yang,
Chiun-Chieh Hsu,
Jou-Ming Chang:
Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes.
Inf. Process. Lett. 110(10): 414-419 (2010) |
| 31 |  | Jinn-Shyong Yang,
Jou-Ming Chang,
Shyue-Ming Tang,
Yue-Li Wang:
Constructing Multiple Independent Spanning Trees on Recursive circulant Graphs G(2M, 2).
Int. J. Found. Comput. Sci. 21(1): 73-90 (2010) |
| 30 |  | Jinn-Shyong Yang,
Jou-Ming Chang:
Independent spanning trees on folded hyper-stars.
Networks 56(4): 272-281 (2010) |
| 2009 |
| 29 |  | Ro-Yu Wu,
Jou-Ming Chang,
Chir-Ho Chang:
A Developed Restricted Rotation for Binary Trees Transformation.
HIS (1) 2009: 78-83 |
| 28 |  | Jinn-Shyong Yang,
Jou-Ming Chang,
Hung Chan:
Independent Spanning Trees on Folded Hypercubes.
ISPAN 2009: 601-605 |
| 27 |  | 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) |
| 26 |  | An-Hang Chen,
Jou-Ming Chang,
Yue-Li Wang:
The Interchange Graphs of Tournaments with Minimum Score Vectors Are Exactly Hypercubes.
Graphs and Combinatorics 25(1): 27-34 (2009) |
| 25 |  | Jou-Ming Chang,
Ro-Yu Wu:
On the diameter of geometric path graphs of points in convex position.
Inf. Process. Lett. 109(8): 409-413 (2009) |
| 24 |  | Kung-Jui Pai,
Jou-Ming Chang,
Yue-Li Wang:
Upper bounds on the queuenumber of k-ary n-cubes.
Inf. Process. Lett. 110(2): 50-56 (2009) |
| 23 |  | 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 |  | Jou-Ming Chang,
Jinn-Shyong Yang:
Fault-tolerant cycle-embedding in alternating group graphs.
Applied Mathematics and Computation 197(2): 760-767 (2008) |
| 21 |  | 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 |  | 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 |  | 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 |  | 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 |  | 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 |  | 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 |  | 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 |  | 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 |  | Fu-Hsing Wang,
Yue-Li Wang,
Jou-Ming Chang:
Feedback vertex sets in star graphs.
Inf. Process. Lett. 89(4): 203-208 (2004) |
| 10 |  | 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 |  | Jou-Ming Chang:
Induced matchings in asteroidal triple-free graphs.
Discrete Applied Mathematics 132(1-3): 67-78 (2003) |
| 7 |  | Ting-Yem Ho,
Jou-Ming Chang:
Sorting a sequence of strong kings in a tournament.
Inf. Process. Lett. 87(6): 317-320 (2003) |
| 6 |  | 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 |  | 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 |  | Jou-Ming Chang,
Chin-Wen Ho,
Ming-Tat Ko:
LexBFS-Ordering in Asteroidal Triple-Free Graphs.
ISAAC 1999: 163-172 |
| 3 |  | 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 |  | 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) |