Chuan-Min Lee

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 9

Top Topics

Parameterized Complexity

Independent Set

Top Venues

EURASIP J. Image Video Process.

Publications

Chuan-Min Lee
Exploring Clique Transversal Problems for d-degenerate Graphs with Fixed d: From Polynomial-Time Solvability to Parameterized Complexity. Axioms 13 (6) (2024)
Chuan-Min Lee
Remarks on Parameterized Complexity of Variations of the Maximum-Clique Transversal Problem on Graphs. Symmetry 14 (4) (2022)
Chuan-Min Lee
Algorithmic Aspects of Some Variations of Clique Transversal and Clique Independent Sets on Graphs. Algorithms 14 (1) (2021)
Chuan-Min Lee
The complexity of total k-domatic partition and total R-domination on graphs with weak elimination orderings. Int. J. Comput. Math. Comput. Syst. Theory 5 (3) (2020)
Hsing-Han Liu, Chuan-Min Lee
High-capacity reversible image steganography based on pixel value ordering. EURASIP J. Image Video Process. 2019 (2019)
Chuan-Min Lee
Total k-Domatic Partition and Weak Elimination Ordering. ICS (2018)
Chuan-Min Lee
On the complexity of variations of mixed domination on graphs. Int. J. Comput. Math. 93 (11) (2016)
Chuan-Min Lee
Remarks on the complexity of signed k-independece on graphs. Ars Comb. 123 (2015)
Chuan-Min Lee, Cheng-Chien Lo
On the Complexity of Reverse Minus and Signed Domination on Graphs. J. Interconnect. Networks 15 (1-2) (2015)
Chuan-Min Lee
Remarks on the Complexity of Non-negative Signed Domination. J. Networks 9 (8) (2014)
Chuan-Min Lee, Cheng-Chien Lo
On the Complexity of Reverse Minus Domination on Graphs. CSE (2014)
Chuan-Min Lee
Signed and minus total domination on subclasses of bipartite graphs. Ars Comb. 100 (2011)
Chuan-Min Lee
Variations of maximum-clique transversal sets on graphs. Ann. Oper. Res. 181 (1) (2010)
Chuan-Min Lee
On the complexity of signed and minus total domination in graphs. Inf. Process. Lett. 109 (20) (2009)
Chuan-Min Lee, Maw-Shang Chang
Signed and minus clique-transversal functions on graphs. Inf. Process. Lett. 109 (8) (2009)
Ling-Ju Hung, Ton Kloks, Chuan-Min Lee
Trivially-Perfect Width. IWOCA (2009)
Chuan-Min Lee, Maw-Shang Chang
Variations of Y-dominating functions on graphs. Discret. Math. 308 (18) (2008)
Chuan-Min Lee, Maw-Shang Chang
Distance-hereditary graphs are clique-perfect. Discret. Appl. Math. 154 (3) (2006)
Sheng-Lung Peng, Ton Kloks, Chuan-Min Lee
The Maximum Interval Graphs on Distance Hereditary Graphs. JCIS (2006)
Ton Kloks, Dieter Kratsch, Chuan-Min Lee, Jiping Liu
Improved bottleneck domination algorithms. Discret. Appl. Math. 154 (11) (2006)
Gregory Z. Gutin, Ton Kloks, Chuan-Min Lee, Anders Yeo
Kernels in planar digraphs. J. Comput. Syst. Sci. 71 (2) (2005)
Chuan-Min Lee, Ling-Ju Hung, Maw-Shang Chang, Chia-Ben Shen, Chuan Yi Tang
An improved algorithm for the maximum agreement subtree problem. Inf. Process. Lett. 94 (5) (2005)
Chuan-Min Lee, Ling-Ju Hung, Maw-Shang Chang, Chuan Yi Tang
An Improved Algorithm for the Maximum Agreement Subtree Problem. BIBE (2004)
Ton Kloks, Chuan-Min Lee, Jiping Liu
Stickiness, Edge-Thickness, and Clique-Thickness in Graphs. J. Inf. Sci. Eng. 20 (2) (2004)
Maw-Shang Chang, Chin-Hua Lin, Chuan-Min Lee
New upper bounds on feedback vertex numbers in butterflies. Inf. Process. Lett. 90 (6) (2004)
Ton Kloks, Chuan-Min Lee, Jiping Liu, Haiko Müller
On the Recognition of General Partition Graphs. WG (2003)
Ton Kloks, Chuan-Min Lee, Jiping Liu
New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k -Disjoint Cycles on Plane and Planar Graphs. WG (2002)
Maw-Shang Chang, Ton Kloks, Chuan-Min Lee
Maximum Clique Transversals. WG (2001)