Chuan-Min Lee

Algorithms, August, 2024

Exploring Clique Transversal Problems for d-degenerate Graphs with Fixed d: From Polynomial-Time Solvability to Parameterized Complexity.

[BibT_eX]

[DOI]

Axioms, June, 2024

2022

Remarks on Parameterized Complexity of Variations of the Maximum-Clique Transversal Problem on Graphs.

[BibT_eX]

[DOI]

Symmetry, 2022

2021

Algorithmic Aspects of Some Variations of Clique Transversal and Clique Independent Sets on Graphs.

[BibT_eX]

[DOI]

Algorithms, 2021

2020

The complexity of total k-domatic partition and total R-domination on graphs with weak elimination orderings.

[BibT_eX]

[DOI]

Int. J. Comput. Math. Comput. Syst. Theory, 2020

2019

High-capacity reversible image steganography based on pixel value ordering.

[BibT_eX]

[DOI]

Hsing-Han Liu

EURASIP J. Image Video Process., 2019

2018

Total k-Domatic Partition and Weak Elimination Ordering.

[BibT_eX]

[DOI]

Proceedings of the New Trends in Computer Technologies and Applications, 2018

2016

On the complexity of variations of mixed domination on graphs.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2016

2015

On the Complexity of Reverse Minus and Signed Domination on Graphs.

[BibT_eX]

[DOI]

Cheng-Chien Lo

J. Interconnect. Networks, 2015

Remarks on the complexity of signed k-independece on graphs.

[BibT_eX]

Ars Comb., 2015

2014

Remarks on the Complexity of Non-negative Signed Domination.

[BibT_eX]

[DOI]

J. Networks, 2014

On the Complexity of Reverse Minus Domination on Graphs.

[BibT_eX]

[DOI]

Cheng-Chien Lo

Proceedings of the 17th IEEE International Conference on Computational Science and Engineering, 2014

2011

Signed and minus total domination on subclasses of bipartite graphs.

[BibT_eX]

Ars Comb., 2011

2010

Variations of maximum-clique transversal sets on graphs.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2010

2009

Signed and minus clique-transversal functions on graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

On the complexity of signed and minus total domination in graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

Trivially-Perfect Width.

[BibT_eX]

[DOI]

Ling-Ju Hung

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2008

Variations of Y-dominating functions on graphs.

[BibT_eX]

[DOI]

Discret. Math., 2008

2006

Distance-hereditary graphs are clique-perfect.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

Improved bottleneck domination algorithms.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

The Maximum Interval Graphs on Distance Hereditary Graphs.

[BibT_eX]

[DOI]

Sheng-Lung Peng

Proceedings of the 2006 Joint Conference on Information Sciences, 2006

2005

Kernels in planar digraphs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2005

An improved algorithm for the maximum agreement subtree problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2005

2004

Stickiness, Edge-Thickness, and Clique-Thickness in Graphs.

[BibT_eX]

[DOI]

Jiping Liu

J. Inf. Sci. Eng., 2004

New upper bounds on feedback vertex numbers in butterflies.

[BibT_eX]

[DOI]

Chin-Hua Lin

Inf. Process. Lett., 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

On the Recognition of General Partition Graphs.

[BibT_eX]

[DOI]

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

2002

New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k -Disjoint Cycles on Plane and Planar Graphs.

[BibT_eX]

[DOI]

Jiping Liu

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

2001

Maximum Clique Transversals.

[BibT_eX]

[DOI]