Maw-Shang Chang

Li-Hsuan Chen

J. Comb. Optim., 2016

Fixed-parameter algorithms for vertex cover P3.

[BibT_eX]

[DOI]

Discret. Optim., 2016

2015

Moderately exponential time algorithms for the maximum induced matching problem.

[BibT_eX]

[DOI]

Li-Hsuan Chen

Optim. Lett., 2015

Linear-Time Algorithms for Tree Root Problems.

[BibT_eX]

[DOI]

Ming-Tat Ko

Hsueh-I Lu

Algorithmica, 2015

2014

Exact algorithms for problems related to the densest k-set problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2014

An efficient exact algorithm for P2-packing in cubic graphs.

[BibT_eX]

[DOI]

Li-Hsuan Chen

Proceedings of the Intelligent Systems and Applications, 2014

2013

On the Min-Max 2-Cluster Editing Problem.

[BibT_eX]

[DOI]

J. Inf. Sci. Eng., 2013

Testing consistency of quartet topologies: a parameterized approach.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2013

Recognition of probe distance-hereditary graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Finding large k-clubs in undirected graphs.

[BibT_eX]

[DOI]

Computing, 2013

2012

Independent sets in edge-clique graphs II

[BibT_eX]

[DOI]

CoRR, 2012

Independent sets in edge-clique graphs

[BibT_eX]

[DOI]

Ton Kloks

Ching-Hao Liu

CoRR, 2012

Edge-clique graphs of cocktail parties have unbounded rankwidth

[BibT_eX]

[DOI]

Ton Kloks

Ching-Hao Liu

CoRR, 2012

2011

An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Block-graph width.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

A Property Tester for Tree-Likeness of Quartet Topologies.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2011

On the threshold-width of graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2011

Multi-objective optimization of enzyme manipulations in metabolic networks considering resilience effects.

[BibT_eX]

[DOI]

Wu Hsiung Wu

Feng Sheng Wang

BMC Syst. Biol., 2011

Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2011

2010

New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2010

An improved algorithm for the red-blue hitting set problem with the consecutive ones property.

[BibT_eX]

[DOI]

Hsiao-Han Chung

Inf. Process. Lett., 2010

Recognition of Probe Ptolemaic Graphs - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

Certifying Algorithms for the Path Cover and Related Problems on Interval Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computational Science and Its Applications, 2010

Probe Distance-Hereditary Graphs.

[BibT_eX]

[DOI]

Proceedings of the Theory of Computing 2010, 2010

2009

Signed and minus clique-transversal functions on graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

On probe permutation graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

2008

Partitioned probe comparability graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Variations of Y-dominating functions on graphs.

[BibT_eX]

[DOI]

Discret. Math., 2008

Dynamic sensitivity analysis of biological systems.

[BibT_eX]

[DOI]

Wu Hsiung Wu

Feng Sheng Wang

BMC Bioinform., 2008

Probe Ptolemaic Graphs.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

The 3-Steiner Root Problem.

[BibT_eX]

[DOI]

Ming-Tat Ko

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007

2006

Distance-hereditary graphs are clique-perfect.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

Solving the path cover problem on circular-arc graphs by using an approximation algorithm.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2006

2005

Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs, .

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

An improved algorithm for the maximum agreement subtree problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2005

On the Recognition of Probe Graphs of Some Self-Complementary Classes of Perfect Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

New upper bounds on feedback vertex numbers in butterflies.

[BibT_eX]

[DOI]

Chin-Hua Lin

Inf. Process. Lett., 2004

A simple linear algorithm for the connected domination problem in circular-arc graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2004

An Efficient Exact Algorithm for the Minimum Ultrametric Tree Problem.

[BibT_eX]

[DOI]

Hsin-Fu Chen

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

An Improved Algorithm for the Maximum Agreement Subtree Problem.

[BibT_eX]

[DOI]

Proceedings of the 4th IEEE International Symposium on BioInformatics and BioEngineering (BIBE 2004), 2004

2003

Hamiltonian Cycle Problem on Distance-Hereditary Graphs.

[BibT_eX]

[DOI]

Shaur-Ching Wu

J. Inf. Sci. Eng., 2003

2002

Domination in distance-hereditary graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

2001

The Kr-Packing Problem.

[BibT_eX]

[DOI]

Computing, 2001

On the Tree-Degree of Graphs.

[BibT_eX]

[DOI]

Haiko Müller

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

Maximum Clique Transversals.

[BibT_eX]

[DOI]

Ton Kloks

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

1999

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

[BibT_eX]

[DOI]

Sheng-Lung Peng

Jenn-Liang Liaw

Networks, 1999

1998

Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs.

[BibT_eX]

[DOI]

SIAM J. Comput., 1998

Weighted Irredundance of Interval Graphs.

[BibT_eX]

[DOI]

P. Nagavamsi

C. Pandu Rangan

Inf. Process. Lett., 1998

The Vertex-Disjoint Triangles Problem.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1998

1997

On Minimum Intersection of Two Minimum Dominating Sets of Interval Graphs.

[BibT_eX]

[DOI]

Chung-Chang Hsu

Discret. Appl. Math., 1997

Weighted Domination of Cocomparability Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1997

Minimum Feedback Vertex Sets in Cocomparability Graphs and Convex Bipartite Graphs.

[BibT_eX]

[DOI]

Y. Daniel Liang

Acta Informatica, 1997

Dynamic Programming on Distance-Hereditary Graphs.

[BibT_eX]

[DOI]

Sun-Yuan Hsieh

Gen-Huey Chen

Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

1996

Algorithmic Aspects of the Generalized Clique-transversal Problem on Chordal Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1996

Algorithms for Maximum Matching and Minimum Fill-in on Chordal Bipartite Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 7th International Symposium, 1996

1995

Edge Domination on Bipartite Permutation Graphs and Cotriangulated Graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1995

1994

Polynomial Algorithms for Weighted Perfect Domination Problems on Interval and Circular-Arc Graphs.

[BibT_eX]

[DOI]

Yi-Chang Liu

J. Inf. Sci. Eng., 1994

Weighted Irredundance of Interval Graphs.

[BibT_eX]

[DOI]

C. Pandu Rangan

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.

[BibT_eX]

[DOI]

Yi-Chang Liu

Inf. Process. Lett., 1993

Deferred-Query - An Efficient Approach for Problems on interval and Circular-Arc Graphs (Extended Abstract).

[BibT_eX]

[DOI]

Sheng-Lung Peng

Jenn-Liang Liaw

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.

[BibT_eX]

[DOI]

Sheng-Lung Peng

Inf. Process. Lett., 1992

Efficient Algorithms for the Maximum Weight Clique and Maximum Weight Independent Set Problems on Permutation Graphs.

[BibT_eX]

[DOI]

Fu-Hsing Wang

Inf. Process. Lett., 1992

Solving the Euclidean Bottleneck Biconnected Edge Subgraph Problem by 2-Relative Neighborhood Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1992

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

[BibT_eX]

[DOI]

Algorithmica, 1992

1991

20-relative neighborhood graphs are hamiltonian.

[BibT_eX]

[DOI]

J. Graph Theory, 1991

A unified approach for solving bottleneck k-bipartition problems.

[BibT_eX]

[DOI]

Proceedings of the 19th annual conference on Computer Science, 1991

1990

An Optimal Algorithm for Constructing Oriented Voronoi Diagrams and Geographic Neighborhood Graphs.

[BibT_eX]

[DOI]

Nen-Fu Huang