| Efficient algorithms for the domination problems on interval and circular-arc graphs MS Chang SIAM Journal on computing 27 (6), 1671-1694, 1998 | 158 | 1998 |
| Minimum feedback vertex sets in cocomparability graphs and convex bipartite graphs. Y Daniel Liang, MS Chang Acta Informatica 34 (5), 1997 | 97 | 1997 |
| Dynamic programming on distance-hereditary graphs MS Chang, S Hsieh, GH Chen Algorithms and Computation: 8th International Symposium, ISAAC'97 Singapore …, 1997 | 90 | 1997 |
| Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs MS Chang, FH Wang Information Processing Letters 43 (6), 293-295, 1992 | 67 | 1992 |
| Dynamic sensitivity analysis of biological systems WH Wu, FS Wang, MS Chang BMC bioinformatics 9, 1-17, 2008 | 60 | 2008 |
| Finding large-clubs in undirected graphs MS Chang, LJ Hung, CR Lin, PC Su Computing 95 (9), 739-758, 2013 | 58 | 2013 |
| Weighted domination of cocomparability graphs C Maw-Shang Discrete applied mathematics 80 (2-3), 135-148, 1997 | 55* | 1997 |
| Edge domination on bipartite permutation graphs and cotriangulated graphs A Srinivasan, K Madhukar, P Nagavamsi, CP Rangan, MS Chang Information Processing Letters 56 (3), 165-171, 1995 | 54 | 1995 |
| Maximum clique transversals MS Chang, T Kloks, CM Lee International Workshop on Graph-Theoretic Concepts in Computer Science, 32-43, 2001 | 51 | 2001 |
| Distance-hereditary graphs are clique-perfect CM Lee, MS Chang Discrete Applied Mathematics 154 (3), 525-536, 2006 | 50 | 2006 |
| Algorithmic aspects of the generalized clique-transversal problem on chordal graphs C Maw-Shang, C Yi-Hua, GJ Chang, Y Jing-Ho Discrete Applied Mathematics 66 (3), 189-203, 1996 | 47 | 1996 |
| Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs MS Chang Algorithms and Computation: 7th International Symposium, ISAAC'96 Osaka …, 1996 | 47 | 1996 |
| Solving the Euclidean bottleneck matching problem byk-relative neighborhood graphs MS Chang, CY Tang, RCT Lee Algorithmica 8, 177-194, 1992 | 47 | 1992 |
| Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs MS Chang, YC Liu Information Processing Letters 48 (4), 205-210, 1993 | 45 | 1993 |
| Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs RW Hung, MS Chang Theoretical Computer Science 341 (1-3), 411-440, 2005 | 43 | 2005 |
| Variations of Y-dominating functions on graphs CM Lee, MS Chang Discrete Mathematics 308 (18), 4185-4204, 2008 | 41 | 2008 |
| A simple linear time algorithm for the domatic partition problem on strongly chordal graphs SL Peng, MS Chang Information processing letters 43 (6), 297-300, 1992 | 41 | 1992 |
| Fixed-parameter algorithms for vertex cover P3 MS Chang, LH Chen, LJ Hung, P Rossmanith, PC Su Discrete Optimization 19, 12-22, 2016 | 39 | 2016 |
| Domination in distance-hereditary graphs MS Chang, SC Wu, GJ Chang, HG Yeh Discrete Applied Mathematics 116 (1-2), 103-113, 2002 | 38 | 2002 |
| On the recognition of probe graphs of some self-complementary classes of perfect graphs MS Chang, T Kloks, D Kratsch, J Liu, SL Peng International Computing and Combinatorics Conference, 808-817, 2005 | 36 | 2005 |
Ling-Ju HungNational Taipei University of BusinessВерификована је имејл адреса на ntub.edu.tw
