Get started
Author

Chuan-Min Lee

Observed names: CHUAN-MIN LEE, Chuan Min Lee
ORCID: 0000-0003-3456-6697
Observed ORCID: 0000-0003-3456-6697
OpenAlex ID: A5062338704
Distance-hereditary graphs are clique-perfect
2005 · Chuan-Min Lee, Maw-Shang Chang · Discrete Applied Mathematics · 46
High-capacity reversible image steganography based on pixel value ordering
2019 · Hsing-Han Liu, Chuan-Min Lee · EURASIP Journal on Image and Video Processing · 43
PDF
Variations of Y-dominating functions on graphs
2007 · Chuan-Min Lee, Maw-Shang Chang · Discrete Mathematics · 42
PDF
Maximum Clique Transversals
2001 · Maw-Shang Chang, Ton Kloks, et al. · Lecture notes in computer science · 38
Kernels in planar digraphs
2005 · Gregory Gutin, Ton Kloks, et al. · Journal of Computer and System Sciences · 31
An improved algorithm for the maximum agreement subtree problem
2005 · Chuan-Min Lee, Ling-Ju Hung, et al. · Information Processing Letters · 21
On the Recognition of General Partition Graphs
2003 · Ton Kloks, Chuan-Min Lee, et al. · Lecture notes in computer science · 18
Algorithmic Aspects of Some Variations of Clique Transversal and Clique Independent Sets on Graphs
2021 · Chuan-Min Lee · Algorithms · 15
PDF
Variations of maximum-clique transversal sets on graphs
2009 · Chuan-Min Lee · Annals of Operations Research · 15
On the complexity of signed and minus total domination in graphs
2009 · Chuan-Min Lee · Information Processing Letters · 7
Signed and minus total domination on subclasses of bipartite graphs.
2011 · Chuan-Min Lee · Ars Combinatoria · 6
Remarks on Parameterized Complexity of Variations of the Maximum-Clique Transversal Problem on Graphs
2022 · Chuan-Min Lee · Symmetry · 5
PDF
Weighted Maximum-Clique Transversal Sets of Graphs
2011 · Chuan-Min Lee · ISRN Discrete Mathematics · 5
PDF
Improved bottleneck domination algorithms
2006 · Ton Kloks, Dieter Kratsch, et al. · Discrete Applied Mathematics · 4
PDF
Signed and minus clique-transversal functions on graphs
2009 · Chuan-Min Lee, Maw-Shang Chang · Information Processing Letters · 3
Trivially-Perfect Width
2009 · Ling-Ju Hung, Ton Kloks, et al. · Lecture notes in computer science · 3
An improved algorithm for the maximum agreement subtree problem
2004 · Chuan-Min Lee, Ling-Ju Hung, et al. · IEEE International Conference on Bioinformatics and Bioengineering (BIBE) · 3
Exploring Clique Transversal Problems for d-degenerate Graphs with Fixed d: From Polynomial-Time Solvability to Parameterized Complexity
2024 · Chuan-Min Lee · Axioms · 2
Total k-Domatic Partition on Some Classes of Graphs
2016 · Chuan-Min Lee · International Computer Symposium · 2
Remarks on the Complexity of Non-negative Signed Domination
2014 · Chuan-Min Lee · Journal of Networks · 2
New upper bounds on feedback vertex numbers in butterflies
2004 · Maw-Shang Chang, Chin-Hua Lin, et al. · Information Processing Letters · 2
Stickiness, Edge-Thickness, and Clique-Thickness in Graphs *
2004 · Ton Kloks, Chuan Min Lee, et al. · 2
Efficient Minus and Signed Domination in Proper Interval Graphs with a Totally Unimodular Structure
2026 · Chuan-Min Lee · Axioms · 1
PDF
Exploring Dominating Functions and Their Complexity in Subclasses of Weighted Chordal Graphs and Bipartite Graphs
2025 · Chuan-Min Lee · Mathematics · 1
PDF
Exploring Clique Transversal Variants on Distance-Hereditary Graphs: Computational Insights and Algorithmic Approaches
2024 · Chuan-Min Lee · Algorithms · 1
Works count: 35
Citation count: 322
H-index: 9
I10-index: 9
Year
Topic
Type