Maximum Clique Transversals. - Maw-Shang Chang; Ton Kloks; Chuan-Min Lee (WG, 2001)

New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k -Disjoint Cycles on Plane and Planar Graphs. - Ton Kloks; Chuan-Min Lee; Jiping Liu (WG, 2002)

On the Recognition of General Partition Graphs. - Ton Kloks; Chuan-Min Lee; Jiping Liu; Haiko Müller (WG, 2003)

An Improved Algorithm for the Maximum Agreement Subtree Problem. - Chuan-Min Lee; Ling-Ju Hung; Maw-Shang Chang; Chuan Yi Tang (BIBE, 2004)

New upper bounds on feedback vertex numbers in butterflies. - Maw-Shang Chang; Chin-Hua Lin; Chuan-Min Lee (Inf. Process. Lett., 2004)

Stickiness, Edge-Thickness, and Clique-Thickness in Graphs. - Ton Kloks; Chuan-Min Lee; Jiping Liu (J. Inf. Sci. Eng., 2004)

An improved algorithm for the maximum agreement subtree problem. - Chuan-Min Lee; Ling-Ju Hung; Maw-Shang Chang; Chia-Ben Shen; Chuan Yi Tang (Inf. Process. Lett., 2005)

Kernels in planar digraphs. - Gregory Z. Gutin; Ton Kloks; Chuan-Min Lee; Anders Yeo (J. Comput. Syst. Sci., 2005)

The Maximum Interval Graphs on Distance Hereditary Graphs. - Sheng-Lung Peng; Ton Kloks; Chuan-Min Lee (JCIS, 2006)

Improved bottleneck domination algorithms. - Ton Kloks; Dieter Kratsch; Chuan-Min Lee; Jiping Liu (Discret. Appl. Math., 2006)

Distance-hereditary graphs are clique-perfect. - Chuan-Min Lee; Maw-Shang Chang (Discret. Appl. Math., 2006)

Variations of Y-dominating functions on graphs. - Chuan-Min Lee; Maw-Shang Chang (Discret. Math., 2008)

Trivially-Perfect Width. - Ling-Ju Hung; Ton Kloks; Chuan-Min Lee (IWOCA, 2009)

On the complexity of signed and minus total domination in graphs. - Chuan-Min Lee (Inf. Process. Lett., 2009)

Signed and minus clique-transversal functions on graphs. - Chuan-Min Lee; Maw-Shang Chang (Inf. Process. Lett., 2009)

Variations of maximum-clique transversal sets on graphs. - Chuan-Min Lee (Ann. Oper. Res., 2010)

Signed and minus total domination on subclasses of bipartite graphs. - Chuan-Min Lee (Ars Comb., 2011)

On the Complexity of Reverse Minus Domination on Graphs. - Chuan-Min Lee; Cheng-Chien Lo (CSE, 2014)

Remarks on the Complexity of Non-negative Signed Domination. - Chuan-Min Lee (J. Networks, 2014)

Remarks on the complexity of signed k-independece on graphs. - Chuan-Min Lee (Ars Comb., 2015)

On the Complexity of Reverse Minus and Signed Domination on Graphs. - Chuan-Min Lee; Cheng-Chien Lo (J. Interconnect. Networks, 2015)

On the complexity of variations of mixed domination on graphs. - Chuan-Min Lee (Int. J. Comput. Math., 2016)

Total k-Domatic Partition and Weak Elimination Ordering. - Chuan-Min Lee (ICS, 2018)

High-capacity reversible image steganography based on pixel value ordering. - Hsing-Han Liu; Chuan-Min Lee (EURASIP J. Image Video Process., 2019)

The complexity of total k-domatic partition and total R-domination on graphs with weak elimination orderings. - Chuan-Min Lee (Int. J. Comput. Math. Comput. Syst. Theory, 2020)

Algorithmic Aspects of Some Variations of Clique Transversal and Clique Independent Sets on Graphs. - Chuan-Min Lee (Algorithms, 2021)

Remarks on Parameterized Complexity of Variations of the Maximum-Clique Transversal Problem on Graphs. - Chuan-Min Lee (Symmetry, 2022)

Exploring Clique Transversal Problems for d-degenerate Graphs with Fixed d: From Polynomial-Time Solvability to Parameterized Complexity. - Chuan-Min Lee (Axioms, 2024)

Exploring Clique Transversal Variants on Distance-Hereditary Graphs: Computational Insights and Algorithmic Approaches. - Chuan-Min Lee (Algorithms, 2024)