Maw-Shang Chang

79 papers A 1B 11C 5Misc 2Journal 53Unranked 7
YearRankTypeTitle / Venue / Authors
2018 J jnl
Moderately exponential time algorithms for the maximum bounded-degree-1 set problem.
Discret. Appl. Math.
Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung, Yi-Zhi Liu, Peter Rossmanith, Somnath Sikdar
2016 J jnl
An O
J. Comb. Optim.
Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung
2016 J jnl
Fixed-parameter algorithms for vertex cover P
Discret. Optim.
Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung, Peter Rossmanith, Ping-Chen Su
2015 J jnl
Linear-Time Algorithms for Tree Root Problems.
Algorithmica
Maw-Shang Chang, Ming-Tat Ko, Hsueh-I Lu
2015 J jnl
Moderately exponential time algorithms for the maximum induced matching problem.
Optim. Lett.
Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung
2014 A conf
An efficient exact algorithm for P2-packing in cubic graphs.
ICS
Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung
2014 J jnl
Exact algorithms for problems related to the densest k-set problem.
Inf. Process. Lett.
Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung, Peter Rossmanith, Guan-Han Wu
2013 J jnl
Finding large k-clubs in undirected graphs.
Computing
Maw-Shang Chang, Ling-Ju Hung, Chih-Ren Lin, Ping-Chen Su
2013 J jnl
On the Min-Max 2-Cluster Editing Problem.
J. Inf. Sci. Eng.
Li-Hsuan Chen, Maw-Shang Chang, Chun-Chieh Wang, Bang Ye Wu
2013 J jnl
Recognition of probe distance-hereditary graphs.
Discret. Appl. Math.
Maw-Shang Chang, Ling-Ju Hung, Peter Rossmanith
2013 J jnl
Testing consistency of quartet topologies: a parameterized approach.
Inf. Process. Lett.
Maw-Shang Chang, Chuang-Chieh Lin, Peter Rossmanith
2012 J jnl
Edge-clique graphs of cocktail parties have unbounded rankwidth
CoRR
Maw-Shang Chang, Ton Kloks, Ching-Hao Liu
2012 J jnl
Independent sets in edge-clique graphs
CoRR
Maw-Shang Chang, Ton Kloks, Ching-Hao Liu
2012 J jnl
Independent sets in edge-clique graphs II
CoRR
Ching-Hao Liu, Maw-Shang Chang, Ton Kloks, Sheung-Hung Poon
2012 J jnl
On the threshold-width of graphs
CoRR
Maw-Shang Chang, Ling-Ju Hung, Ton Kloks, Sheng-Lung Peng
2011 J jnl
A Property Tester for Tree-Likeness of Quartet Topologies.
Theory Comput. Syst.
Maw-Shang Chang, Chuang-Chieh Lin, Peter Rossmanith
2011 J jnl
An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs.
Theor. Comput. Sci.
Ruo-Wei Hung, Maw-Shang Chang
2011 J jnl
Block-graph width.
Theor. Comput. Sci.
Maw-Shang Chang, Ling-Ju Hung, Ton Kloks, Sheng-Lung Peng
2011 J jnl
Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs.
Appl. Math. Lett.
Ruo-Wei Hung, Maw-Shang Chang
2011 J jnl
Multi-objective optimization of enzyme manipulations in metabolic networks considering resilience effects.
BMC Syst. Biol.
Wu Hsiung Wu, Feng Sheng Wang, Maw-Shang Chang
2011 J jnl
On the threshold-width of graphs.
J. Graph Algorithms Appl.
Maw-Shang Chang, Ling-Ju Hung, Ton Kloks, Sheng-Lung Peng
2010 J jnl
An improved algorithm for the red-blue hitting set problem with the consecutive ones property.
Inf. Process. Lett.
Maw-Shang Chang, Hsiao-Han Chung, Chuang-Chieh Lin
2010 — conf
Certifying Algorithms for the Path Cover and Related Problems on Interval Graphs.
ICCSA (2)
Ruo-Wei Hung, Maw-Shang Chang
2010 J jnl
New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem.
Theory Comput. Syst.
Maw-Shang Chang, Chuang-Chieh Lin, Peter Rossmanith
2010 — conf
Probe Distance-Hereditary Graphs.
CATS
Maw-Shang Chang, Ling-Ju Hung, Peter Rossmanith
2010 C conf
Recognition of Probe Ptolemaic Graphs - (Extended Abstract).
IWOCA
Maw-Shang Chang, Ling-Ju Hung
2009 C conf
Block-Graph Width.
TAMC
Maw-Shang Chang, Ling-Ju Hung, Ton Kloks, Sheng-Lung Peng
2009 J jnl
On probe permutation graphs.
Discret. Appl. Math.
David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng
2009 J jnl
Signed and minus clique-transversal functions on graphs.
Inf. Process. Lett.
Chuan-Min Lee, Maw-Shang Chang
2008 J jnl
Dynamic sensitivity analysis of biological systems.
BMC Bioinform.
Wu Hsiung Wu, Feng Sheng Wang, Maw-Shang Chang
2008 — conf
New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem.
IWPEC
Maw-Shang Chang, Chuang-Chieh Lin, Peter Rossmanith
2008 J jnl
Partitioned probe comparability graphs.
Theor. Comput. Sci.
David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng
2008 Misc conf
Probe Ptolemaic Graphs.
COCOON
David B. Chandler, Maw-Shang Chang, Ton Kloks, Van Bang Le, Sheng-Lung Peng
2008 J jnl
Variations of Y-dominating functions on graphs.
Discret. Math.
Chuan-Min Lee, Maw-Shang Chang
2007 J jnl
Finding a minimum path cover of a distance-hereditary graph in polynomial time.
Discret. Appl. Math.
Ruo-Wei Hung, Maw-Shang Chang
2007 B conf
The 3-Steiner Root Problem.
WG
Maw-Shang Chang, Ming-Tat Ko
2006 J jnl
Distance-hereditary graphs are clique-perfect.
Discret. Appl. Math.
Chuan-Min Lee, Maw-Shang Chang
2006 — conf
Linear-Time Algorithms for Tree Root Problems.
SWAT
Maw-Shang Chang, Ming-Tat Ko, Hsueh-I Lu
2006 C conf
On Probe Permutation Graphs.
TAMC
David B. Chandler, Maw-Shang Chang, Antonius J. J. Kloks, Jiping Liu, Sheng-Lung Peng
2006 B conf
Partitioned Probe Comparability Graphs.
WG
David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng
2006 C conf
Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs.
AAIM
David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng
2006 J jnl
Solving the path cover problem on circular-arc graphs by using an approximation algorithm.
Discret. Appl. Math.
Ruo-Wei Hung, Maw-Shang Chang
2005 J jnl
An improved algorithm for the maximum agreement subtree problem.
Inf. Process. Lett.
Chuan-Min Lee, Ling-Ju Hung, Maw-Shang Chang, Chia-Ben Shen, Chuan Yi Tang
2005 J jnl
Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
Theor. Comput. Sci.
Ruo-Wei Hung, Maw-Shang Chang
2005 Misc conf
On the Recognition of Probe Graphs of Some Self-Complementary Classes of Perfect Graphs.
COCOON
Maw-Shang Chang, Ton Kloks, Dieter Kratsch, Jiping Liu, Sheng-Lung Peng
2004 J jnl
A simple linear algorithm for the connected domination problem in circular-arc graphs.
Discuss. Math. Graph Theory
Maw-Shang Chang, Ruo-Wei Hung
2004 B conf
An Efficient Exact Algorithm for the Minimum Ultrametric Tree Problem.
ISAAC
Hsin-Fu Chen, Maw-Shang Chang
2004 C conf
An Improved Algorithm for the Maximum Agreement Subtree Problem.
BIBE
Chuan-Min Lee, Ling-Ju Hung, Maw-Shang Chang, Chuan Yi Tang
2004 J jnl
New upper bounds on feedback vertex numbers in butterflies.
Inf. Process. Lett.
Maw-Shang Chang, Chin-Hua Lin, Chuan-Min Lee
2003 J jnl
Hamiltonian Cycle Problem on Distance-Hereditary Graphs.
J. Inf. Sci. Eng.
Ruo-Wei Hung, Shaur-Ching Wu, Maw-Shang Chang
2002 J jnl
Domination in distance-hereditary graphs.
Discret. Appl. Math.
Maw-Shang Chang, Shaur-Ching Wu, Gerard J. Chang, Hong-Gwa Yeh
2001 B conf
Maximum Clique Transversals.
WG
Maw-Shang Chang, Ton Kloks, Chuan-Min Lee
2001 B conf
On the Tree-Degree of Graphs.
WG
Maw-Shang Chang, Haiko Müller
2001 J jnl
The K
Computing
Venkatesan Guruswami, C. Pandu Rangan, Maw-Shang Chang, Gerard J. Chang, C. K. Wong
1999 J jnl
Deferred-query: An efficient approach for some problems on interval graphs.
Networks
Maw-Shang Chang, Sheng-Lung Peng, Jenn-Liang Liaw
1998 J jnl
Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs.
SIAM J. Comput.
Maw-Shang Chang
1998 B conf
The Vertex-Disjoint Triangles Problem.
WG
Venkatesan Guruswami, C. Pandu Rangan, Maw-Shang Chang, Gerard J. Chang, C. K. Wong
1998 J jnl
Weighted Irredundance of Interval Graphs.
Inf. Process. Lett.
Maw-Shang Chang, P. Nagavamsi, C. Pandu Rangan
1997 B conf
Dynamic Programming on Distance-Hereditary Graphs.
ISAAC
Maw-Shang Chang, Sun-Yuan Hsieh, Gen-Huey Chen
1997 J jnl
Minimum Feedback Vertex Sets in Cocomparability Graphs and Convex Bipartite Graphs.
Acta Informatica
Y. Daniel Liang, Maw-Shang Chang
1997 J jnl
On Minimum Intersection of Two Minimum Dominating Sets of Interval Graphs.
Discret. Appl. Math.
Maw-Shang Chang, Chung-Chang Hsu
1997 J jnl
Weighted Domination of Cocomparability Graphs.
Discret. Appl. Math.
Maw-Shang Chang
1996 J jnl
Algorithmic Aspects of the Generalized Clique-transversal Problem on Chordal Graphs.
Discret. Appl. Math.
Maw-Shang Chang, Yi-Hua Chen, Gerard J. Chang, Jing-Ho Yan
1996 B conf
Algorithms for Maximum Matching and Minimum Fill-in on Chordal Bipartite Graphs.
ISAAC
Maw-Shang Chang
1995 J jnl
Edge Domination on Bipartite Permutation Graphs and Cotriangulated Graphs.
Inf. Process. Lett.
Anand Srinivasan, K. Madhukar, P. Nagavamsi, C. Pandu Rangan, Maw-Shang Chang
1995 B conf
Weighted Domination on Cocomparability Graphs.
ISAAC
Maw-Shang Chang
1994 J jnl
Polynomial Algorithms for Weighted Perfect Domination Problems on Interval and Circular-Arc Graphs.
J. Inf. Sci. Eng.
Maw-Shang Chang, Yi-Chang Liu
1994 B conf
Weighted Irredundance of Interval Graphs.
ISAAC
C. Pandu Rangan, Maw-Shang Chang
1993 B conf
Deferred-Query - An Efficient Approach for Problems on interval and Circular-Arc Graphs (Extended Abstract).
WADS
Maw-Shang Chang, Sheng-Lung Peng, Jenn-Liang Liaw
1993 J jnl
Polynomial Algorithms for the Weighted Perfect Domination Problems on Chordal Graphs and Split Graphs.
Inf. Process. Lett.
Maw-Shang Chang, Yi-Chang Liu
1992 J jnl
A Simple Linear Time Algorithm for the Domatic Partition Problem on Strongly Chordal Graphs.
Inf. Process. Lett.
Sheng-Lung Peng, Maw-Shang Chang
1992 — conf
Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs.
IFIP Congress (1)
Maw-Shang Chang
1992 J jnl
Efficient Algorithms for the Maximum Weight Clique and Maximum Weight Independent Set Problems on Permutation Graphs.
Inf. Process. Lett.
Maw-Shang Chang, Fu-Hsing Wang
1992 J jnl
Solving the Euclidean Bottleneck Biconnected Edge Subgraph Problem by 2-Relative Neighborhood Graphs.
Discret. Appl. Math.
Maw-Shang Chang, Chuan Yi Tang, Richard C. T. Lee
1992 J jnl
Solving the Euclidean Bottleneck Matching Problem by k-Relative Neighborhood Graphs.
Algorithmica
Maw-Shang Chang, Chuan Yi Tang, Richard C. T. Lee
1991 J jnl
20-relative neighborhood graphs are hamiltonian.
J. Graph Theory
Maw-Shang Chang, Chuan Yi Tang, Richard C. T. Lee
1991 — conf
A unified approach for solving bottleneck k-bipartition problems.
ACM Conference on Computer Science
Maw-Shang Chang, Chuan Yi Tang, Richard C. T. Lee
1990 — conf
20-Relative Neighborhood Graphs Are Hamiltonian.
SIGAL International Symposium on Algorithms
Maw-Shang Chang, Chuan Yi Tang, Richard C. T. Lee
1990 J jnl
An Optimal Algorithm for Constructing Oriented Voronoi Diagrams and Geographic Neighborhood Graphs.
Inf. Process. Lett.
Maw-Shang Chang, Nen-Fu Huang, Chuan Yi Tang