| 2008 |
|---|
| 46 | EE | David B. Chandler,
Maw-Shang Chang,
Ton Kloks,
Van Bang Le,
Sheng-Lung Peng:
Probe Ptolemaic Graphs.
COCOON 2008: 468-477 |
| 45 | EE | Maw-Shang Chang,
Chuang-Chieh Lin,
Peter Rossmanith:
New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem.
IWPEC 2008: 66-77 |
| 44 | EE | Chuan-Min Lee,
Maw-Shang Chang:
Variations of Y-dominating functions on graphs.
Discrete Mathematics 308(18): 4185-4204 (2008) |
| 43 | EE | David B. Chandler,
Maw-Shang Chang,
Ton Kloks,
Jiping Liu,
Sheng-Lung Peng:
Partitioned probe comparability graphs.
Theor. Comput. Sci. 396(1-3): 212-222 (2008) |
| 2007 |
|---|
| 42 | EE | Maw-Shang Chang,
Ming-Tat Ko:
The 3-Steiner Root Problem.
WG 2007: 109-120 |
| 41 | EE | Ruo-Wei Hung,
Maw-Shang Chang:
Finding a minimum path cover of a distance-hereditary graph in polynomial time.
Discrete Applied Mathematics 155(17): 2242-2256 (2007) |
| 2006 |
|---|
| 40 | EE | David B. Chandler,
Maw-Shang Chang,
Ton Kloks,
Jiping Liu,
Sheng-Lung Peng:
Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs.
AAIM 2006: 267-278 |
| 39 | EE | Maw-Shang Chang,
Ming-Tat Ko,
Hsueh-I Lu:
Linear-Time Algorithms for Tree Root Problems.
SWAT 2006: 411-422 |
| 38 | EE | David B. Chandler,
Maw-Shang Chang,
Antonius J. J. Kloks,
Jiping Liu,
Sheng-Lung Peng:
On Probe Permutation Graphs.
TAMC 2006: 494-504 |
| 37 | EE | David B. Chandler,
Maw-Shang Chang,
Ton Kloks,
Jiping Liu,
Sheng-Lung Peng:
Partitioned Probe Comparability Graphs.
WG 2006: 179-190 |
| 36 | EE | Ruo-Wei Hung,
Maw-Shang Chang:
Solving the path cover problem on circular-arc graphs by using an approximation algorithm.
Discrete Applied Mathematics 154(1): 76-105 (2006) |
| 35 | EE | Chuan-Min Lee,
Maw-Shang Chang:
Distance-hereditary graphs are clique-perfect.
Discrete Applied Mathematics 154(3): 525-536 (2006) |
| 2005 |
|---|
| 34 | EE | Maw-Shang Chang,
Ton Kloks,
Dieter Kratsch,
Jiping Liu,
Sheng-Lung Peng:
On the Recognition of Probe Graphs of Some Self-Complementary Classes of Perfect Graphs.
COCOON 2005: 808-817 |
| 33 | EE | Chuan-Min Lee,
Ling-Ju Hung,
Maw-Shang Chang,
Chia-Ben Shen,
Chuan Yi Tang:
An improved algorithm for the maximum agreement subtree problem.
Inf. Process. Lett. 94(5): 211-216 (2005) |
| 32 | EE | Ruo-Wei Hung,
Maw-Shang Chang:
Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs, .
Theor. Comput. Sci. 341(1-3): 411-440 (2005) |
| 2004 |
|---|
| 31 | EE | Chuan-Min Lee,
Ling-Ju Hung,
Maw-Shang Chang,
Chuan Yi Tang:
An Improved Algorithm for the Maximum Agreement Subtree Problem.
BIBE 2004: 533-536 |
| 30 | EE | Hsin-Fu Chen,
Maw-Shang Chang:
An Efficient Exact Algorithm for the Minimum Ultrametric Tree Problem.
ISAAC 2004: 282-293 |
| 29 | EE | Maw-Shang Chang,
Chin-Hua Lin,
Chuan-Min Lee:
New upper bounds on feedback vertex numbers in butterflies.
Inf. Process. Lett. 90(6): 279-285 (2004) |
| 2003 |
|---|
| 28 | EE | Ruo-Wei Hung,
Shaur-Ching Wu,
Maw-Shang Chang:
Hamiltonian Cycle Problem on Distance-Hereditary Graphs.
J. Inf. Sci. Eng. 19(5): 827-838 (2003) |
| 2002 |
|---|
| 27 | | Maw-Shang Chang,
Shaur-Ching Wu,
Gerard J. Chang,
Hong-Gwa Yeh:
Domination in distance-hereditary graphs.
Discrete Applied Mathematics 116(1-2): 103-113 (2002) |
| 2001 |
|---|
| 26 | EE | Maw-Shang Chang,
Ton Kloks,
Chuan-Min Lee:
Maximum Clique Transversals.
WG 2001: 32-43 |
| 25 | EE | Maw-Shang Chang,
Haiko Müller:
On the Tree-Degree of Graphs.
WG 2001: 44-54 |
| 24 | EE | Venkatesan Guruswami,
C. Pandu Rangan,
Maw-Shang Chang,
Gerard J. Chang,
C. K. Wong:
The Kr-Packing Problem.
Computing 66(1): 79-89 (2001) |
| 1999 |
|---|
| 23 | EE | Maw-Shang Chang,
Sheng-Lung Peng,
Jenn-Liang Liaw:
Deferred-query: An efficient approach for some problems on interval graphs.
Networks 34(1): 1-10 (1999) |
| 1998 |
|---|
| 22 | | Venkatesan Guruswami,
C. Pandu Rangan,
Maw-Shang Chang,
Gerard J. Chang,
C. K. Wong:
The Vertex-Disjoint Triangles Problem.
WG 1998: 26-37 |
| 21 | EE | Maw-Shang Chang,
P. Nagavamsi,
C. Pandu Rangan:
Weighted Irredundance of Interval Graphs.
Inf. Process. Lett. 66(2): 65-70 (1998) |
| 20 | EE | Maw-Shang Chang:
Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs.
SIAM J. Comput. 27(6): 1671-1694 (1998) |
| 1997 |
|---|
| 19 | | Maw-Shang Chang,
Sun-Yuan Hsieh,
Gen-Huey Chen:
Dynamic Programming on Distance-Hereditary Graphs.
ISAAC 1997: 344-353 |
| 18 | | Y. Daniel Liang,
Maw-Shang Chang:
Minimum Feedback Vertex Sets in Comparability Graphs and Convex Bipartite Graphs.
Acta Inf. 34(5): 337-346 (1997) |
| 17 | EE | Maw-Shang Chang,
Chung-Chang Hsu:
On Minimum Intersection of Two Minimum Dominating Sets of Interval Graphs.
Discrete Applied Mathematics 78(1-3): 41-50 (1997) |
| 16 | EE | Maw-Shang Chang:
Weighted Domination of Cocomparability Graphs.
Discrete Applied Mathematics 80(2-3): 135-148 (1997) |
| 1996 |
|---|
| 15 | | Maw-Shang Chang:
Algorithms for Maximum Matching and Minimum Fill-in on Chordal Bipartite Graphs.
ISAAC 1996: 146-155 |
| 14 | EE | Maw-Shang Chang,
Yi-Hua Chen,
Gerard J. Chang,
Jing-Ho Yan:
Algorithmic Aspects of the Generalized Clique-transversal Problem on Chordal Graphs.
Discrete Applied Mathematics 66(3): 189-203 (1996) |
| 1995 |
|---|
| 13 | | Maw-Shang Chang:
Weighted Domination on Cocomparability Graphs.
ISAAC 1995: 122-131 |
| 12 | EE | Anand Srinivasan,
K. Madhukar,
P. Nagavamsi,
C. Pandu Rangan,
Maw-Shang Chang:
Edge Domination on Bipartite Permutation Graphs and Cotriangulated Graphs.
Inf. Process. Lett. 56(3): 165-171 (1995) |
| 1994 |
|---|
| 11 | | C. Pandu Rangan,
Maw-Shang Chang:
Weighted Irredundance of Interval Graphs.
ISAAC 1994: 567-574 |
| 10 | EE | Maw-Shang Chang,
Yi-Chang Liu:
Polynomial Algorithms for Weighted Perfect Domination Problems on Interval and Circular-Arc Graphs.
J. Inf. Sci. Eng. 11(4): 549-568 (1994) |
| 1993 |
|---|
| 9 | | Maw-Shang Chang,
Sheng-Lung Peng,
Jenn-Liang Liaw:
Deferred-Query - An Efficient Approach for Problems on interval and Circular-Arc Graphs (Extended Abstract).
WADS 1993: 222-233 |
| 8 | | Maw-Shang Chang,
Yi-Chang Liu:
Polynomial Algorithms for the Weighted Perfect Domination Problems on Chordal Graphs and Split Graphs.
Inf. Process. Lett. 48(4): 205-210 (1993) |
| 1992 |
|---|
| 7 | | Maw-Shang Chang:
Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs.
IFIP Congress (1) 1992: 402-408 |
| 6 | | Maw-Shang Chang,
Chuan Yi Tang,
Richard C. T. Lee:
Solving the Euclidean Bottleneck Matching Problem by k-Relative Neighborhood Graphs.
Algorithmica 8(3): 177-194 (1992) |
| 5 | EE | Maw-Shang Chang,
Chuan Yi Tang,
Richard C. T. Lee:
Solving the Euclidean Bottleneck Biconnected Edge Subgraph Problem by 2-Relative Neighborhood Graphs.
Discrete Applied Mathematics 39(1): 1-12 (1992) |
| 4 | | Maw-Shang Chang,
Fu-Hsing Wang:
Efficient Algorithms for the Maximum Weight Clique and Maximum Weight Independent Set Problems on Permutation Graphs.
Inf. Process. Lett. 43(6): 293-295 (1992) |
| 3 | EE | Sheng-Lung Peng,
Maw-Shang Chang:
A Simple Linear Time Algorithm for the Domatic Partition Problem on Strongly Chordal Graphs.
Inf. Process. Lett. 43(6): 297-300 (1992) |
| 1990 |
|---|
| 2 | | Maw-Shang Chang,
Chuan Yi Tang,
Richard C. T. Lee:
20-Relative Neighborhood Graphs Are Hamiltonian.
SIGAL International Symposium on Algorithms 1990: 53-65 |
| 1 | | Maw-Shang Chang,
Nen-Fu Huang,
Chuan Yi Tang:
An Optimal Algorithm for Constructing Oriented Voronoi Diagrams and Geographic Neighborhood Graphs.
Inf. Process. Lett. 35(5): 255-260 (1990) |
