Chuan-Min Lee

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