Min Chih Lin

According to our database, Min Chih Lin authored at least 43 papers between 2001 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2022

Restricted Hamming-Huffman trees.

Min Chih Lin, Fabiano de S. Oliveira, Paulo E. D. Pinto, Moysés S. Sampaio Jr., Jayme Luiz Szwarcfiter

RAIRO Oper. Res., 2022

Some New Results on Efficient and Perfect Edge Domination of Graphs.

Vinicius Leal do Forte, Min Chih Lin, Abilio Lucena, Nelson Maculan, Veronica A. Moyano, Jayme Luiz Szwarcfiter

CoRR, 2022

2020

Modelling and solving the perfect edge domination problem.

Vinicius Leal do Forte, Min Chih Lin, Abilio Lucena, Nelson Maculan, Veronica A. Moyano, Jayme Luiz Szwarcfiter

Optim. Lett., 2020

2018

Approximating weighted neighborhood independent sets.

Min Chih Lin, Julián Mestre, Saveliy Vasiliev

Inf. Process. Lett., 2018

Approximating weighted induced matchings.

Min Chih Lin, Julián Mestre, Saveliy Vasiliev

Discret. Appl. Math., 2018

Perfect edge domination: hard and solvable cases.

Min Chih Lin, Vadim V. Lozin, Veronica A. Moyano, Jayme Luiz Szwarcfiter

Ann. Oper. Res., 2018

2017

On neighborhood-Helly graphs.

Marina Groshaus, Min Chih Lin, Jayme Luiz Szwarcfiter

Discret. Appl. Math., 2017

Exact Algorithms for Minimum Weighted Dominating Induced Matching.

Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter

Algorithmica, 2017

2015

The Maximum Number of Dominating Induced Matchings.

Min Chih Lin, Veronica A. Moyano, Dieter Rautenbach, Jayme Luiz Szwarcfiter

J. Graph Theory, 2015

Approximation algorithms for clique transversals on some graph classes.

Min Chih Lin, Saveliy Vasiliev

Inf. Process. Lett., 2015

A faster algorithm for the cluster editing problem on proper interval graphs.

Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter

Inf. Process. Lett., 2015

Efficient and Perfect domination on circular-arc graphs.

Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter

Electron. Notes Discret. Math., 2015

On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size.

Min Chih Lin, Michel J. Mizrahi

Discret. Appl. Math., 2015

2014

Domination problems on P₅-free graphs.

Min Chih Lin, Michel J. Mizrahi

RAIRO Theor. Informatics Appl., 2014

Fast algorithms for some dominating induced matching problems.

Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter

Inf. Process. Lett., 2014

O(n) Time Algorithms for Dominating Induced Matching Problems.

Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

2013

Isomorphism of graph classes related to the circular-ones property.

Andrew R. Curtis, Min Chih Lin, Ross M. McConnell, Yahav Nussbaum, Francisco J. Soulignac, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter

Discret. Math. Theor. Comput. Sci., 2013

Normal Helly circular-arc graphs and its subclasses.

Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter

Discret. Appl. Math., 2013

Exact algorithms for dominating induced matchings

Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter

CoRR, 2013

An O *(1.1939 n ) Time Algorithm for Minimum Weighted Dominating Induced Matching.

Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

2012

Arboricity, h-index, and dynamic algorithms.

Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter

Theor. Comput. Sci., 2012

2011

Powers of cycles, powers of paths, and distance graphs.

Min Chih Lin, Dieter Rautenbach, Francisco J. Soulignac, Jayme Luiz Szwarcfiter

Discret. Appl. Math., 2011

Subclasses of Normal Helly Circular-Arc Graphs

Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter

CoRR, 2011

Linear-Time Recognition of Helly Circular-Arc Models and Graphs.

Benson L. Joeris, Min Chih Lin, Ross M. McConnell, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter

Algorithmica, 2011

2010

The clique operator on circular-arc graphs.

Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter

Discret. Appl. Math., 2010

2009

Short Models for Unit Interval Graphs.

Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter

Electron. Notes Discret. Math., 2009

Characterizations and recognition of circular-arc graphs and subclasses: A survey.

Min Chih Lin, Jayme Luiz Szwarcfiter

Discret. Math., 2009

2008

Unit Circular-Arc Graph Representations and Feasible Circulations.

Min Chih Lin, Jayme Luiz Szwarcfiter

SIAM J. Discret. Math., 2008

Improved algorithms for recognizing p.

Mitre Costa Dourado, Min Chih Lin, Fábio Protti, Jayme Luiz Szwarcfiter

Inf. Process. Lett., 2008

On cliques of Helly Circular-arc Graphs.

Min Chih Lin, Ross M. McConnell, Francisco J. Soulignac, Jayme Luiz Szwarcfiter

Electron. Notes Discret. Math., 2008

Algorithms for finding clique-transversals of graphs.

Guillermo Durán, Min Chih Lin, Sergio Mera, Jayme Luiz Szwarcfiter

Ann. Oper. Res., 2008

A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs.

Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter

Proceedings of the Algorithm Theory, 2008

2007

Faster recognition of clique-Helly and hereditary clique-Helly graphs.

Min Chih Lin, Jayme Luiz Szwarcfiter

Inf. Process. Lett., 2007

Proper Helly Circular-Arc Graphs.

Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007

2006

On Balanced Graphs.

Flavia Bonomo, Guillermo Durán, Min Chih Lin, Jayme Luiz Szwarcfiter

Math. Program., 2006

Algorithms for clique-independent sets on subclasses of circular-arc graphs.

Guillermo Durán, Min Chih Lin, Sergio Mera, Jayme Luiz Szwarcfiter

Discret. Appl. Math., 2006

Efficient construction of unit circular-arc models.

Min Chih Lin, Jayme Luiz Szwarcfiter

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs.

Min Chih Lin, Jayme Luiz Szwarcfiter

Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

2004

Clique-independent sets of Helly circular-arc graphs.

Guillermo Durán, Min Chih Lin, Sergio Mera, Jayme Luiz Szwarcfiter

Electron. Notes Discret. Math., 2004

2003

Self-clique graphs and matrix permutations.

J. Adrian Bondy, Guillermo Durán, Min Chih Lin, Jayme Luiz Szwarcfiter

J. Graph Theory, 2003

2002

On Clique-Transversals and Clique-Independent Sets.

Guillermo Durán, Min Chih Lin, Jayme Luiz Szwarcfiter

Ann. Oper. Res., 2002

2001

A sufficient condition for self-clique graphs.

J. Adrian Bondy, Guillermo Durán, Min Chih Lin, Jayme Luiz Szwarcfiter

Electron. Notes Discret. Math., 2001

Clique graphs of Helly circular arc graphs.

Guillermo Durán, Min Chih Lin

Ars Comb., 2001