The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Maw-Shang Chang: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  42. Probe Ptolemaic Graphs. [Citation Graph (, )][DBLP]


  43. Certifying Algorithms for the Path Cover and Related Problems on Interval Graphs. [Citation Graph (, )][DBLP]


  44. New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem. [Citation Graph (, )][DBLP]


  45. Block-Graph Width. [Citation Graph (, )][DBLP]


  46. The 3-Steiner Root Problem. [Citation Graph (, )][DBLP]


  47. On probe permutation graphs. [Citation Graph (, )][DBLP]


  48. Variations of Y-dominating functions on graphs. [Citation Graph (, )][DBLP]


Search in 0.054secs, Finished in 0.058secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002