Min Chih Lin

Publication Activity (10 Years)

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

Top Topics

Np Hard Problems

Exact Algorithms

Graph Structure

Top Venues

Inf. Process. Lett.

Discret. Appl. Math.

RAIRO Oper. Res.

Publications

Min Chih Lin, Fabiano de S. Oliveira, Paulo E. D. Pinto, Moysés S. Sampaio Jr., Jayme Luiz Szwarcfiter
Restricted Hamming-Huffman trees. RAIRO Oper. Res. 56 (3) (2022)
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 (2022)
Vinicius Leal do Forte, Min Chih Lin, Abilio Lucena, Nelson Maculan, Veronica A. Moyano, Jayme Luiz Szwarcfiter
Modelling and solving the perfect edge domination problem. Optim. Lett. 14 (2) (2020)
Min Chih Lin, Julián Mestre, Saveliy Vasiliev
Approximating weighted neighborhood independent sets. Inf. Process. Lett. 130 (2018)
Min Chih Lin, Julián Mestre, Saveliy Vasiliev
Approximating weighted induced matchings. Discret. Appl. Math. 243 (2018)
Min Chih Lin, Vadim V. Lozin, Veronica A. Moyano, Jayme Luiz Szwarcfiter
Perfect edge domination: hard and solvable cases. Ann. Oper. Res. 264 (1-2) (2018)
Marina Groshaus, Min Chih Lin, Jayme Luiz Szwarcfiter
On neighborhood-Helly graphs. Discret. Appl. Math. 216 (2017)
Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter
Exact Algorithms for Minimum Weighted Dominating Induced Matching. Algorithmica 77 (3) (2017)
Min Chih Lin, Vadim V. Lozin, Veronica A. Moyano, Jayme Luiz Szwarcfiter
Perfect Edge Domination: Hard and Solvable Cases. CoRR (2017)
Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter
A faster algorithm for the cluster editing problem on proper interval graphs. Inf. Process. Lett. 115 (12) (2015)
Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter
Efficient and Perfect domination on circular-arc graphs. CoRR (2015)
Min Chih Lin, Saveliy Vasiliev
Approximation algorithms for clique transversals on some graph classes. Inf. Process. Lett. 115 (9) (2015)
Min Chih Lin, Veronica A. Moyano, Dieter Rautenbach, Jayme Luiz Szwarcfiter
The Maximum Number of Dominating Induced Matchings. J. Graph Theory 78 (4) (2015)
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 (2015)
Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter
Efficient and Perfect domination on circular-arc graphs. Electron. Notes Discret. Math. 50 (2015)
Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter
Fast algorithms for some dominating induced matching problems. Inf. Process. Lett. 114 (10) (2014)
Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter
O(n) Time Algorithms for Dominating Induced Matching Problems. LATIN (2014)
Min Chih Lin, Michel J. Mizrahi
-free graphs. RAIRO Theor. Informatics Appl. 48 (5) (2014)
Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter
An $O^*(1.1939^n)$ time algorithm for minimum weighted dominating induced matching CoRR (2013)
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. Discret. Math. Theor. Comput. Sci. 15 (1) (2013)
Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter
Normal Helly circular-arc graphs and its subclasses. Discret. Appl. Math. 161 (7-8) (2013)
Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter
Exact algorithms for dominating induced matchings CoRR (2013)
Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter
An O *(1.1939 n ) Time Algorithm for Minimum Weighted Dominating Induced Matching. ISAAC (2013)
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 (2012)
Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter
Arboricity, h-index, and dynamic algorithms. Theor. Comput. Sci. 426 (2012)
Min Chih Lin, Dieter Rautenbach, Francisco J. Soulignac, Jayme Luiz Szwarcfiter
Powers of cycles, powers of paths, and distance graphs. Discret. Appl. Math. 159 (7) (2011)
Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter
Subclasses of Normal Helly Circular-Arc Graphs CoRR (2011)
Benson L. Joeris, Min Chih Lin, Ross M. McConnell, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter
Linear-Time Recognition of Helly Circular-Arc Models and Graphs. Algorithmica 59 (2) (2011)
Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter
Arboricity, h-Index, and Dynamic Algorithms CoRR (2010)
Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter
The clique operator on circular-arc graphs. Discret. Appl. Math. 158 (12) (2010)
Min Chih Lin, Jayme Luiz Szwarcfiter
Characterizations and recognition of circular-arc graphs and subclasses: A survey. Discret. Math. 309 (18) (2009)
Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter
Short Models for Unit Interval Graphs. Electron. Notes Discret. Math. 35 (2009)
Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter
A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs. SWAT (2008)
Min Chih Lin, Jayme Luiz Szwarcfiter
Unit Circular-Arc Graph Representations and Feasible Circulations. SIAM J. Discret. Math. 22 (1) (2008)
Mitre Costa Dourado, Min Chih Lin, Fábio Protti, Jayme Luiz Szwarcfiter
Improved algorithms for recognizing p. Inf. Process. Lett. 108 (4) (2008)
Guillermo Durán, Min Chih Lin, Sergio Mera, Jayme Luiz Szwarcfiter
Algorithms for finding clique-transversals of graphs. Ann. Oper. Res. 157 (1) (2008)
Min Chih Lin, Ross M. McConnell, Francisco J. Soulignac, Jayme Luiz Szwarcfiter
On cliques of Helly Circular-arc Graphs. Electron. Notes Discret. Math. 30 (2008)
Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter
Proper Helly Circular-Arc Graphs. WG (2007)
Min Chih Lin, Jayme Luiz Szwarcfiter
Faster recognition of clique-Helly and hereditary clique-Helly graphs. Inf. Process. Lett. 103 (1) (2007)
Min Chih Lin, Jayme Luiz Szwarcfiter
Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs. COCOON (2006)
Min Chih Lin, Jayme Luiz Szwarcfiter
Efficient construction of unit circular-arc models. SODA (2006)
Flavia Bonomo, Guillermo Durán, Min Chih Lin, Jayme Luiz Szwarcfiter
On Balanced Graphs. Math. Program. 105 (2-3) (2006)
Guillermo Durán, Min Chih Lin, Sergio Mera, Jayme Luiz Szwarcfiter
Algorithms for clique-independent sets on subclasses of circular-arc graphs. Discret. Appl. Math. 154 (13) (2006)
Guillermo Durán, Min Chih Lin, Sergio Mera, Jayme Luiz Szwarcfiter
Clique-independent sets of Helly circular-arc graphs. Electron. Notes Discret. Math. 18 (2004)
J. Adrian Bondy, Guillermo Durán, Min Chih Lin, Jayme Luiz Szwarcfiter
Self-clique graphs and matrix permutations. J. Graph Theory 44 (3) (2003)
Guillermo Durán, Min Chih Lin, Jayme Luiz Szwarcfiter
On Clique-Transversals and Clique-Independent Sets. Ann. Oper. Res. 116 (1-4) (2002)
J. Adrian Bondy, Guillermo Durán, Min Chih Lin, Jayme Luiz Szwarcfiter
A sufficient condition for self-clique graphs. Electron. Notes Discret. Math. 7 (2001)
Guillermo Durán, Min Chih Lin
Clique graphs of Helly circular arc graphs. Ars Comb. 60 (2001)