default search action
Chuan-Min Lee
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
- [j21]Chuan-Min Lee
:
Exploring Clique Transversal Variants on Distance-Hereditary Graphs: Computational Insights and Algorithmic Approaches. Algorithms 17(8): 359 (2024) - [j20]Chuan-Min Lee
Exploring Clique Transversal Problems for d-degenerate Graphs with Fixed d: From Polynomial-Time Solvability to Parameterized Complexity. Axioms 13(6): 382 (2024) - 2022
- [j19]Chuan-Min Lee
Remarks on Parameterized Complexity of Variations of the Maximum-Clique Transversal Problem on Graphs. Symmetry 14(4): 676 (2022) - 2021
- [j18]Chuan-Min Lee
Algorithmic Aspects of Some Variations of Clique Transversal and Clique Independent Sets on Graphs. Algorithms 14(1): 22 (2021) - 2020
- [j17]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): 134-147 (2020) - 2019
- [j16]Hsing-Han Liu
High-capacity reversible image steganography based on pixel value ordering. EURASIP J. Image Video Process. 2019: 54 (2019) - 2016
- [j15]Chuan-Min Lee:
On the complexity of variations of mixed domination on graphs. Int. J. Comput. Math. 93(11): 1937-1963 (2016) - 2015
- [j14]Chuan-Min Lee:
Remarks on the complexity of signed k-independece on graphs. Ars Comb. 123: 303-315 (2015) - [j13]Chuan-Min Lee, Cheng-Chien Lo:
On the Complexity of Reverse Minus and Signed Domination on Graphs. J. Interconnect. Networks 15(1-2): 1550008:1-1550008:13 (2015) - 2014
- [j12]Chuan-Min Lee:
Remarks on the Complexity of Non-negative Signed Domination. J. Networks 9(8): 2051-2058 (2014) - 2011
- [j11]Chuan-Min Lee:
Signed and minus total domination on subclasses of bipartite graphs. Ars Comb. 100: 129-149 (2011) - 2010
- [j10]Chuan-Min Lee:
Variations of maximum-clique transversal sets on graphs. Ann. Oper. Res. 181(1): 21-66 (2010) - 2009
- [j9]Chuan-Min Lee, Maw-Shang Chang
Signed and minus clique-transversal functions on graphs. Inf. Process. Lett. 109(8): 414-417 (2009) - [j8]Chuan-Min Lee:
On the complexity of signed and minus total domination in graphs. Inf. Process. Lett. 109(20): 1177-1181 (2009) - 2008
- [j7]Chuan-Min Lee, Maw-Shang Chang
Variations of Y-dominating functions on graphs. Discret. Math. 308(18): 4185-4204 (2008) - 2006
- [j6]Chuan-Min Lee, Maw-Shang Chang
Distance-hereditary graphs are clique-perfect. Discret. Appl. Math. 154(3): 525-536 (2006) - [j5]Ton Kloks, Dieter Kratsch, Chuan-Min Lee, Jiping Liu:
Improved bottleneck domination algorithms. Discret. Appl. Math. 154(11): 1578-1592 (2006) - 2005
- [j4]Chuan-Min Lee, Ling-Ju Hung
An improved algorithm for the maximum agreement subtree problem. Inf. Process. Lett. 94(5): 211-216 (2005) - [j3]Gregory Z. Gutin, Ton Kloks, Chuan-Min Lee, Anders Yeo:
Kernels in planar digraphs. J. Comput. Syst. Sci. 71(2): 174-184 (2005) - 2004
- [j2]Maw-Shang Chang
New upper bounds on feedback vertex numbers in butterflies. Inf. Process. Lett. 90(6): 279-285 (2004) - [j1]Ton Kloks, Chuan-Min Lee, Jiping Liu:
Stickiness, Edge-Thickness, and Clique-Thickness in Graphs. J. Inf. Sci. Eng. 20(2): 207-217 (2004)
Conference and Workshop Papers
- 2018
- [c8]Chuan-Min Lee:
Total k-Domatic Partition and Weak Elimination Ordering. ICS 2018: 516-523 - 2014
- [c7]Chuan-Min Lee, Cheng-Chien Lo:
On the Complexity of Reverse Minus Domination on Graphs. CSE 2014: 1121-1126 - 2009
- [c6]Ling-Ju Hung
Trivially-Perfect Width. IWOCA 2009: 301-311 - 2006
- [c5]Sheng-Lung Peng, Ton Kloks, Chuan-Min Lee:
The Maximum Interval Graphs on Distance Hereditary Graphs. JCIS 2006 - 2004
- [c4]Chuan-Min Lee, Ling-Ju Hung, Maw-Shang Chang, Chuan Yi Tang:
An Improved Algorithm for the Maximum Agreement Subtree Problem. BIBE 2004: 533-536 - 2003
- [c3]Ton Kloks, Chuan-Min Lee, Jiping Liu, Haiko Müller
On the Recognition of General Partition Graphs. WG 2003: 273-283 - 2002
- [c2]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: 282-295 - 2001
- [c1]Maw-Shang Chang, Ton Kloks, Chuan-Min Lee:
Maximum Clique Transversals. WG 2001: 32-43
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: