default search action
Min Chih Lin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j34]Min Chih Lin
, Fabiano de S. Oliveira
Restricted Hamming-Huffman trees. RAIRO Oper. Res. 56(3): 1823-1839 (2022) - [i8]Vinicius Leal do Forte, Min Chih Lin, Abilio Lucena, Nelson Maculan, Veronica A. Moyano, Jayme Luiz Szwarcfiter:
Some New Results on Efficient and Perfect Edge Domination of Graphs. CoRR abs/2204.11785 (2022) - 2020
- [j33]Vinicius Leal do Forte, Min Chih Lin, Abilio Lucena
Modelling and solving the perfect edge domination problem. Optim. Lett. 14(2): 369-394 (2020)
2010 – 2019
- 2018
- [j32]Min Chih Lin
Perfect edge domination: hard and solvable cases. Ann. Oper. Res. 264(1-2): 287-305 (2018) - [j31]Min Chih Lin
Approximating weighted induced matchings. Discret. Appl. Math. 243: 304-310 (2018) - [j30]Min Chih Lin
Approximating weighted neighborhood independent sets. Inf. Process. Lett. 130: 11-15 (2018) - 2017
- [j29]Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter:
Exact Algorithms for Minimum Weighted Dominating Induced Matching. Algorithmica 77(3): 642-660 (2017) - [j28]Marina Groshaus, Min Chih Lin, Jayme Luiz Szwarcfiter:
On neighborhood-Helly graphs. Discret. Appl. Math. 216: 191-202 (2017) - [i7]Min Chih Lin, Vadim V. Lozin, Veronica A. Moyano, Jayme Luiz Szwarcfiter:
Perfect Edge Domination: Hard and Solvable Cases. CoRR abs/1705.08379 (2017) - 2015
- [j27]Min Chih Lin, Michel J. Mizrahi:
On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size. Discret. Appl. Math. 197: 53-58 (2015) - [j26]Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter:
Efficient and Perfect domination on circular-arc graphs. Electron. Notes Discret. Math. 50: 307-312 (2015) - [j25]Min Chih Lin
Approximation algorithms for clique transversals on some graph classes. Inf. Process. Lett. 115(9): 667-670 (2015) - [j24]Min Chih Lin
A faster algorithm for the cluster editing problem on proper interval graphs. Inf. Process. Lett. 115(12): 913-916 (2015) - [j23]Min Chih Lin, Veronica A. Moyano, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
The Maximum Number of Dominating Induced Matchings. J. Graph Theory 78(4): 258-268 (2015) - [i6]Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter:
Efficient and Perfect domination on circular-arc graphs. CoRR abs/1502.01523 (2015) - 2014
- [j22]Min Chih Lin
Fast algorithms for some dominating induced matching problems. Inf. Process. Lett. 114(10): 524-528 (2014) - [j21]Min Chih Lin, Michel J. Mizrahi:
Domination problems on P5-free graphs. RAIRO Theor. Informatics Appl. 48(5): 541-549 (2014) - [c6]Min Chih Lin
O(n) Time Algorithms for Dominating Induced Matching Problems. LATIN 2014: 399-408 - 2013
- [j20]Min Chih Lin
Normal Helly circular-arc graphs and its subclasses. Discret. Appl. Math. 161(7-8): 1037-1059 (2013) - [j19]Andrew R. Curtis, Min Chih Lin
Isomorphism of graph classes related to the circular-ones property. Discret. Math. Theor. Comput. Sci. 15(1): 157-182 (2013) - [c5]Min Chih Lin
An O *(1.1939 n ) Time Algorithm for Minimum Weighted Dominating Induced Matching. ISAAC 2013: 558-567 - [i5]Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter:
Exact algorithms for dominating induced matchings. CoRR abs/1301.7602 (2013) - [i4]Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter:
An $O^*(1.1939^n)$ time algorithm for minimum weighted dominating induced matching. CoRR abs/1303.0035 (2013) - 2012
- [j18]Min Chih Lin
Arboricity, h-index, and dynamic algorithms. Theor. Comput. Sci. 426: 75-90 (2012) - [i3]Andrew R. Curtis, Min Chih Lin, Ross M. McConnell, Yahav Nussbaum, Francisco J. Soulignac, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter:
Isomorphism of graph classes related to the circular-ones property. CoRR abs/1203.4822 (2012) - 2011
- [j17]Benson L. Joeris, Min Chih Lin
Linear-Time Recognition of Helly Circular-Arc Models and Graphs. Algorithmica 59(2): 215-239 (2011) - [j16]Min Chih Lin
Powers of cycles, powers of paths, and distance graphs. Discret. Appl. Math. 159(7): 621-627 (2011) - [i2]Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter:
Subclasses of Normal Helly Circular-Arc Graphs. CoRR abs/1103.3732 (2011) - 2010
- [j15]Min Chih Lin
The clique operator on circular-arc graphs. Discret. Appl. Math. 158(12): 1259-1267 (2010) - [i1]Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter:
Arboricity, h-Index, and Dynamic Algorithms. CoRR abs/1005.2211 (2010)
2000 – 2009
- 2009
- [j14]Min Chih Lin
Characterizations and recognition of circular-arc graphs and subclasses: A survey. Discret. Math. 309(18): 5618-5635 (2009) - [j13]Min Chih Lin
Short Models for Unit Interval Graphs. Electron. Notes Discret. Math. 35: 247-255 (2009) - 2008
- [j12]Guillermo Durán, Min Chih Lin
Algorithms for finding clique-transversals of graphs. Ann. Oper. Res. 157(1): 37-45 (2008) - [j11]Min Chih Lin
On cliques of Helly Circular-arc Graphs. Electron. Notes Discret. Math. 30: 117-122 (2008) - [j10]Mitre Costa Dourado, Min Chih Lin
Improved algorithms for recognizing p. Inf. Process. Lett. 108(4): 247-250 (2008) - [j9]Min Chih Lin
Unit Circular-Arc Graph Representations and Feasible Circulations. SIAM J. Discret. Math. 22(1): 409-423 (2008) - [c4]Min Chih Lin
A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs. SWAT 2008: 355-366 - 2007
- [j8]Min Chih Lin
Faster recognition of clique-Helly and hereditary clique-Helly graphs. Inf. Process. Lett. 103(1): 40-43 (2007) - [c3]Min Chih Lin
Proper Helly Circular-Arc Graphs. WG 2007: 248-257 - 2006
- [j7]Guillermo Durán, Min Chih Lin
Algorithms for clique-independent sets on subclasses of circular-arc graphs. Discret. Appl. Math. 154(13): 1783-1790 (2006) - [j6]Flavia Bonomo
On Balanced Graphs. Math. Program. 105(2-3): 233-250 (2006) - [c2]Min Chih Lin
Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs. COCOON 2006: 73-82 - [c1]Min Chih Lin, Jayme Luiz Szwarcfiter:
Efficient construction of unit circular-arc models. SODA 2006: 309-315 - 2004
- [j5]Guillermo Durán, Min Chih Lin
Clique-independent sets of Helly circular-arc graphs. Electron. Notes Discret. Math. 18: 103-108 (2004) - 2003
- [j4]J. Adrian Bondy, Guillermo Durán, Min Chih Lin
Self-clique graphs and matrix permutations. J. Graph Theory 44(3): 178-192 (2003) - 2002
- [j3]Guillermo Durán, Min Chih Lin, Jayme Luiz Szwarcfiter:
On Clique-Transversals and Clique-Independent Sets. Ann. Oper. Res. 116(1-4): 71-77 (2002) - 2001
- [j2]Guillermo Durán, Min Chih Lin:
Clique graphs of Helly circular arc graphs. Ars Comb. 60 (2001) - [j1]J. Adrian Bondy, Guillermo Durán, Min Chih Lin, Jayme Luiz Szwarcfiter:
A sufficient condition for self-clique graphs. Electron. Notes Discret. Math. 7: 174-177 (2001)
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-04-25 05:50 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: