Maw-Shang Chang

Publication Activity (10 Years)

Years Active: 1990-2018
Publications (10 Years): 3

Top Topics

Graph Clustering

Exact Algorithms

Top Venues

Inf. Process. Lett.

Discret. Appl. Math.

J. Inf. Sci. Eng.

Publications

Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung, Yi-Zhi Liu, Peter Rossmanith, Somnath Sikdar
Moderately exponential time algorithms for the maximum bounded-degree-1 set problem. Discret. Appl. Math. 251 (2018)
Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung
-packing in cubic graphs. J. Comb. Optim. 32 (2) (2016)
Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung, Peter Rossmanith, Ping-Chen Su
. Discret. Optim. 19 (2016)
Maw-Shang Chang, Ming-Tat Ko, Hsueh-I Lu
Linear-Time Algorithms for Tree Root Problems. Algorithmica 71 (2) (2015)
Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung
Moderately exponential time algorithms for the maximum induced matching problem. Optim. Lett. 9 (5) (2015)
Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung, Peter Rossmanith, Guan-Han Wu
Exact algorithms for problems related to the densest k-set problem. Inf. Process. Lett. 114 (9) (2014)
Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung
An efficient exact algorithm for P2-packing in cubic graphs. ICS (2014)
Li-Hsuan Chen, Maw-Shang Chang, Chun-Chieh Wang, Bang Ye Wu
On the Min-Max 2-Cluster Editing Problem. J. Inf. Sci. Eng. 29 (6) (2013)
Maw-Shang Chang, Ling-Ju Hung, Chih-Ren Lin, Ping-Chen Su
Finding large k-clubs in undirected graphs. Computing 95 (9) (2013)
Maw-Shang Chang, Chuang-Chieh Lin, Peter Rossmanith
Testing consistency of quartet topologies: a parameterized approach. Inf. Process. Lett. 113 (22-24) (2013)
Maw-Shang Chang, Ling-Ju Hung, Peter Rossmanith
Recognition of probe distance-hereditary graphs. Discret. Appl. Math. 161 (3) (2013)
Ching-Hao Liu, Maw-Shang Chang, Ton Kloks, Sheung-Hung Poon
Independent sets in edge-clique graphs II CoRR (2012)
Maw-Shang Chang, Ton Kloks, Ching-Hao Liu
Independent sets in edge-clique graphs CoRR (2012)
Maw-Shang Chang, Ling-Ju Hung, Ton Kloks, Sheng-Lung Peng
On the threshold-width of graphs CoRR (2012)
Maw-Shang Chang, Ton Kloks, Ching-Hao Liu
Edge-clique graphs of cocktail parties have unbounded rankwidth CoRR (2012)
Wu Hsiung Wu, Feng Sheng Wang, Maw-Shang Chang
Multi-objective optimization of enzyme manipulations in metabolic networks considering resilience effects. BMC Syst. Biol. 5 (2011)
Ruo-Wei Hung, Maw-Shang Chang
Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs. Appl. Math. Lett. 24 (5) (2011)
Maw-Shang Chang, Ling-Ju Hung, Ton Kloks, Sheng-Lung Peng
On the threshold-width of graphs. J. Graph Algorithms Appl. 15 (2) (2011)
Maw-Shang Chang, Ling-Ju Hung, Ton Kloks, Sheng-Lung Peng
Block-graph width. Theor. Comput. Sci. 412 (23) (2011)
Ruo-Wei Hung, Maw-Shang Chang
An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs. Theor. Comput. Sci. 412 (39) (2011)
Maw-Shang Chang, Chuang-Chieh Lin, Peter Rossmanith
A Property Tester for Tree-Likeness of Quartet Topologies. Theory Comput. Syst. 49 (3) (2011)
Ruo-Wei Hung, Maw-Shang Chang
Certifying Algorithms for the Path Cover and Related Problems on Interval Graphs. ICCSA (2) (2010)
Maw-Shang Chang, Chuang-Chieh Lin, Peter Rossmanith
New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem. Theory Comput. Syst. 47 (2) (2010)
Maw-Shang Chang, Ling-Ju Hung, Peter Rossmanith
Probe Distance-Hereditary Graphs. CATS (2010)
Maw-Shang Chang, Ling-Ju Hung
Recognition of Probe Ptolemaic Graphs - (Extended Abstract). IWOCA (2010)
Maw-Shang Chang, Hsiao-Han Chung, Chuang-Chieh Lin
An improved algorithm for the red-blue hitting set problem with the consecutive ones property. Inf. Process. Lett. 110 (20) (2010)
Chuan-Min Lee, Maw-Shang Chang
Signed and minus clique-transversal functions on graphs. Inf. Process. Lett. 109 (8) (2009)
David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng
On probe permutation graphs. Discret. Appl. Math. 157 (12) (2009)
Maw-Shang Chang, Ling-Ju Hung, Ton Kloks, Sheng-Lung Peng
Block-Graph Width. TAMC (2009)
David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng
Partitioned probe comparability graphs. Theor. Comput. Sci. 396 (1-3) (2008)
Wu Hsiung Wu, Feng Sheng Wang, Maw-Shang Chang
Dynamic sensitivity analysis of biological systems. BMC Bioinform. 9 (S-12) (2008)
Chuan-Min Lee, Maw-Shang Chang
Variations of Y-dominating functions on graphs. Discret. Math. 308 (18) (2008)
David B. Chandler, Maw-Shang Chang, Ton Kloks, Van Bang Le, Sheng-Lung Peng
Probe Ptolemaic Graphs. COCOON (2008)
Maw-Shang Chang, Chuang-Chieh Lin, Peter Rossmanith
New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem. IWPEC (2008)
Ruo-Wei Hung, Maw-Shang Chang
Finding a minimum path cover of a distance-hereditary graph in polynomial time. Discret. Appl. Math. 155 (17) (2007)
Maw-Shang Chang, Ming-Tat Ko
The 3-Steiner Root Problem. WG (2007)
Chuan-Min Lee, Maw-Shang Chang
Distance-hereditary graphs are clique-perfect. Discret. Appl. Math. 154 (3) (2006)
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)
David B. Chandler, Maw-Shang Chang, Antonius J. J. Kloks, Jiping Liu, Sheng-Lung Peng
On Probe Permutation Graphs. TAMC (2006)
Maw-Shang Chang, Ming-Tat Ko, Hsueh-I Lu
Linear-Time Algorithms for Tree Root Problems. SWAT (2006)
Ruo-Wei Hung, Maw-Shang Chang
Solving the path cover problem on circular-arc graphs by using an approximation algorithm. Discret. Appl. Math. 154 (1) (2006)
David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng
Partitioned Probe Comparability Graphs. WG (2006)
Ruo-Wei Hung, Maw-Shang Chang
. Theor. Comput. Sci. 341 (1-3) (2005)
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) (2005)
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)
Maw-Shang Chang, Ruo-Wei Hung
A simple linear algorithm for the connected domination problem in circular-arc graphs. Discuss. Math. Graph Theory 24 (1) (2004)
Chuan-Min Lee, Ling-Ju Hung, Maw-Shang Chang, Chuan Yi Tang
An Improved Algorithm for the Maximum Agreement Subtree Problem. BIBE (2004)
Maw-Shang Chang, Chin-Hua Lin, Chuan-Min Lee
New upper bounds on feedback vertex numbers in butterflies. Inf. Process. Lett. 90 (6) (2004)
Hsin-Fu Chen, Maw-Shang Chang
An Efficient Exact Algorithm for the Minimum Ultrametric Tree Problem. ISAAC (2004)
Ruo-Wei Hung, Shaur-Ching Wu, Maw-Shang Chang
Hamiltonian Cycle Problem on Distance-Hereditary Graphs. J. Inf. Sci. Eng. 19 (5) (2003)
Maw-Shang Chang, Shaur-Ching Wu, Gerard J. Chang, Hong-Gwa Yeh
Domination in distance-hereditary graphs. Discret. Appl. Math. 116 (1-2) (2002)
Maw-Shang Chang, Haiko Müller
On the Tree-Degree of Graphs. WG (2001)
Maw-Shang Chang, Ton Kloks, Chuan-Min Lee
Maximum Clique Transversals. WG (2001)
Venkatesan Guruswami, C. Pandu Rangan, Maw-Shang Chang, Gerard J. Chang, C. K. Wong
-Packing Problem. Computing 66 (1) (2001)
Maw-Shang Chang, Sheng-Lung Peng, Jenn-Liang Liaw
Deferred-query: An efficient approach for some problems on interval graphs. Networks 34 (1) (1999)
Maw-Shang Chang, P. Nagavamsi, C. Pandu Rangan
Weighted Irredundance of Interval Graphs. Inf. Process. Lett. 66 (2) (1998)
Maw-Shang Chang
Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs. SIAM J. Comput. 27 (6) (1998)
Venkatesan Guruswami, C. Pandu Rangan, Maw-Shang Chang, Gerard J. Chang, C. K. Wong
The Vertex-Disjoint Triangles Problem. WG (1998)
Y. Daniel Liang, Maw-Shang Chang
Minimum Feedback Vertex Sets in Cocomparability Graphs and Convex Bipartite Graphs. Acta Informatica 34 (5) (1997)
Maw-Shang Chang, Chung-Chang Hsu
On Minimum Intersection of Two Minimum Dominating Sets of Interval Graphs. Discret. Appl. Math. 78 (1-3) (1997)
Maw-Shang Chang, Sun-Yuan Hsieh, Gen-Huey Chen
Dynamic Programming on Distance-Hereditary Graphs. ISAAC (1997)
Maw-Shang Chang
Weighted Domination of Cocomparability Graphs. Discret. Appl. Math. 80 (2-3) (1997)
Maw-Shang Chang, Yi-Hua Chen, Gerard J. Chang, Jing-Ho Yan
Algorithmic Aspects of the Generalized Clique-transversal Problem on Chordal Graphs. Discret. Appl. Math. 66 (3) (1996)
Maw-Shang Chang
Algorithms for Maximum Matching and Minimum Fill-in on Chordal Bipartite Graphs. ISAAC (1996)
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) (1995)
Maw-Shang Chang
Weighted Domination on Cocomparability Graphs. ISAAC (1995)
C. Pandu Rangan, Maw-Shang Chang
Weighted Irredundance of Interval Graphs. ISAAC (1994)
Maw-Shang Chang, Yi-Chang Liu
Polynomial Algorithms for Weighted Perfect Domination Problems on Interval and Circular-Arc Graphs. J. Inf. Sci. Eng. 10 (4) (1994)
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)
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) (1993)
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) (1992)
Maw-Shang Chang, Chuan Yi Tang, Richard C. T. Lee
Solving the Euclidean Bottleneck Biconnected Edge Subgraph Problem by 2-Relative Neighborhood Graphs. Discret. Appl. Math. 39 (1) (1992)
Maw-Shang Chang
Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs. IFIP Congress (1) (1992)
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) (1992)
Maw-Shang Chang, Chuan Yi Tang, Richard C. T. Lee
Solving the Euclidean Bottleneck Matching Problem by k-Relative Neighborhood Graphs. Algorithmica 8 (3) (1992)
Maw-Shang Chang, Chuan Yi Tang, Richard C. T. Lee
A unified approach for solving bottleneck k-bipartition problems. ACM Conference on Computer Science (1991)
Maw-Shang Chang, Chuan Yi Tang, Richard C. T. Lee
20-relative neighborhood graphs are hamiltonian. J. Graph Theory 15 (5) (1991)
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) (1990)
Maw-Shang Chang, Chuan Yi Tang, Richard C. T. Lee
20-Relative Neighborhood Graphs Are Hamiltonian. SIGAL International Symposium on Algorithms (1990)