Maw-Shang Chang

According to our database1, Maw-Shang Chang authored at least 78 papers between 1990 and 2016.

Collaborative distances :
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2016
An O(1.4366n)-time exact algorithm for maximum P2-packing in cubic graphs.
J. Comb. Optim., 2016

Fixed-parameter algorithms for vertex cover P3.
Discrete Optimization, 2016

2015
Moderately exponential time algorithms for the maximum induced matching problem.
Optimization Letters, 2015

Linear-Time Algorithms for Tree Root Problems.
Algorithmica, 2015

2014
Exact algorithms for problems related to the densest k-set problem.
Inf. Process. Lett., 2014

An efficient exact algorithm for P2-packing in cubic graphs.
Proceedings of the Intelligent Systems and Applications, 2014

2013
On the Min-Max 2-Cluster Editing Problem.
J. Inf. Sci. Eng., 2013

Testing consistency of quartet topologies: a parameterized approach.
Inf. Process. Lett., 2013

Recognition of probe distance-hereditary graphs.
Discrete Applied Mathematics, 2013

Finding large k-clubs in undirected graphs.
Computing, 2013

2012
On the threshold-width of graphs
CoRR, 2012

Independent sets in edge-clique graphs II
CoRR, 2012

Independent sets in edge-clique graphs
CoRR, 2012

Edge-clique graphs of cocktail parties have unbounded rankwidth
CoRR, 2012

2011
An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs.
Theor. Comput. Sci., 2011

Block-graph width.
Theor. Comput. Sci., 2011

A Property Tester for Tree-Likeness of Quartet Topologies.
Theory Comput. Syst., 2011

On the threshold-width of graphs.
J. Graph Algorithms Appl., 2011

Multi-objective optimization of enzyme manipulations in metabolic networks considering resilience effects.
BMC Systems Biology, 2011

Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs.
Appl. Math. Lett., 2011

2010
New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem.
Theory Comput. Syst., 2010

An improved algorithm for the red-blue hitting set problem with the consecutive ones property.
Inf. Process. Lett., 2010

Recognition of Probe Ptolemaic Graphs - (Extended Abstract).
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

Certifying Algorithms for the Path Cover and Related Problems on Interval Graphs.
Proceedings of the Computational Science and Its Applications, 2010

Probe Distance-Hereditary Graphs.
Proceedings of the Theory of Computing 2010, 2010

2009
Signed and minus clique-transversal functions on graphs.
Inf. Process. Lett., 2009

On probe permutation graphs.
Discrete Applied Mathematics, 2009

Block-Graph Width.
Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

2008
Partitioned probe comparability graphs.
Theor. Comput. Sci., 2008

Variations of Y-dominating functions on graphs.
Discrete Mathematics, 2008

Dynamic sensitivity analysis of biological systems.
BMC Bioinformatics, 2008

New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem.
Proceedings of the Parameterized and Exact Computation, Third International Workshop, 2008

Probe Ptolemaic Graphs.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

2007
Finding a minimum path cover of a distance-hereditary graph in polynomial time.
Discrete Applied Mathematics, 2007

The 3-Steiner Root Problem.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007

2006
Distance-hereditary graphs are clique-perfect.
Discrete Applied Mathematics, 2006

Solving the path cover problem on circular-arc graphs by using an approximation algorithm.
Discrete Applied Mathematics, 2006

Partitioned Probe Comparability Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006

On Probe Permutation Graphs.
Proceedings of the Theory and Applications of Models of Computation, 2006

Linear-Time Algorithms for Tree Root Problems.
Proceedings of the Algorithm Theory, 2006

Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs.
Proceedings of the Algorithmic Aspects in Information and Management, 2006

2005
Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs, .
Theor. Comput. Sci., 2005

An improved algorithm for the maximum agreement subtree problem.
Inf. Process. Lett., 2005

On the Recognition of Probe Graphs of Some Self-Complementary Classes of Perfect Graphs.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004
New upper bounds on feedback vertex numbers in butterflies.
Inf. Process. Lett., 2004

A simple linear algorithm for the connected domination problem in circular-arc graphs.
Discussiones Mathematicae Graph Theory, 2004

An Efficient Exact Algorithm for the Minimum Ultrametric Tree Problem.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

An Improved Algorithm for the Maximum Agreement Subtree Problem.
Proceedings of the 4th IEEE International Symposium on BioInformatics and BioEngineering (BIBE 2004), 2004

2003
Hamiltonian Cycle Problem on Distance-Hereditary Graphs.
J. Inf. Sci. Eng., 2003

2002
Domination in distance-hereditary graphs.
Discrete Applied Mathematics, 2002

2001
The Kr-Packing Problem.
Computing, 2001

On the Tree-Degree of Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

Maximum Clique Transversals.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

1999
Deferred-query: An efficient approach for some problems on interval graphs.
Networks, 1999

1998
Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs.
SIAM J. Comput., 1998

Weighted Irredundance of Interval Graphs.
Inf. Process. Lett., 1998

The Vertex-Disjoint Triangles Problem.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1998

1997
On Minimum Intersection of Two Minimum Dominating Sets of Interval Graphs.
Discrete Applied Mathematics, 1997

Weighted Domination of Cocomparability Graphs.
Discrete Applied Mathematics, 1997

Minimum Feedback Vertex Sets in Cocomparability Graphs and Convex Bipartite Graphs.
Acta Inf., 1997

Dynamic Programming on Distance-Hereditary Graphs.
Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

1996
Algorithmic Aspects of the Generalized Clique-transversal Problem on Chordal Graphs.
Discrete Applied Mathematics, 1996

Algorithms for Maximum Matching and Minimum Fill-in on Chordal Bipartite Graphs.
Proceedings of the Algorithms and Computation, 7th International Symposium, 1996

1995
Edge Domination on Bipartite Permutation Graphs and Cotriangulated Graphs.
Inf. Process. Lett., 1995

Weighted Domination on Cocomparability Graphs.
Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

1994
Polynomial Algorithms for Weighted Perfect Domination Problems on Interval and Circular-Arc Graphs.
J. Inf. Sci. Eng., 1994

Weighted Irredundance of Interval Graphs.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

1993
Polynomial Algorithms for the Weighted Perfect Domination Problems on Chordal Graphs and Split Graphs.
Inf. Process. Lett., 1993

Deferred-Query - An Efficient Approach for Problems on interval and Circular-Arc Graphs (Extended Abstract).
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

1992
A Simple Linear Time Algorithm for the Domatic Partition Problem on Strongly Chordal Graphs.
Inf. Process. Lett., 1992

Efficient Algorithms for the Maximum Weight Clique and Maximum Weight Independent Set Problems on Permutation Graphs.
Inf. Process. Lett., 1992

Solving the Euclidean Bottleneck Biconnected Edge Subgraph Problem by 2-Relative Neighborhood Graphs.
Discrete Applied Mathematics, 1992

Solving the Euclidean Bottleneck Matching Problem by k-Relative Neighborhood Graphs.
Algorithmica, 1992

Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs.
Proceedings of the Algorithms, Software, Architecture, 1992

1991
20-relative neighborhood graphs are hamiltonian.
Journal of Graph Theory, 1991

A unified approach for solving bottleneck k-bipartition problems.
Proceedings of the 19th annual conference on Computer Science, 1991

1990
An Optimal Algorithm for Constructing Oriented Voronoi Diagrams and Geographic Neighborhood Graphs.
Inf. Process. Lett., 1990

20-Relative Neighborhood Graphs Are Hamiltonian.
Proceedings of the Algorithms, 1990


  Loading...