Clique graphs of Helly circular arc graphs. - Guillermo Durán; Min Chih Lin (Ars Comb., 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)

On Clique-Transversals and Clique-Independent Sets. - Guillermo Durán; Min Chih Lin; Jayme Luiz Szwarcfiter (Ann. Oper. Res., 2002)

Self-clique graphs and matrix permutations. - J. Adrian Bondy; Guillermo Durán; Min Chih Lin; Jayme Luiz Szwarcfiter (J. Graph Theory, 2003)

Clique-independent sets of Helly circular-arc graphs. - Guillermo Durán; Min Chih Lin; Sergio Mera; Jayme Luiz Szwarcfiter (Electron. Notes Discret. Math., 2004)

Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs. - Min Chih Lin; Jayme Luiz Szwarcfiter (COCOON, 2006)

Efficient construction of unit circular-arc models. - Min Chih Lin; Jayme Luiz Szwarcfiter (SODA, 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)

On Balanced Graphs. - Flavia Bonomo; Guillermo Durán; Min Chih Lin; Jayme Luiz Szwarcfiter (Math. Program., 2006)

Proper Helly Circular-Arc Graphs. - Min Chih Lin; Francisco J. Soulignac; Jayme Luiz Szwarcfiter (WG, 2007)

Faster recognition of clique-Helly and hereditary clique-Helly graphs. - Min Chih Lin; Jayme Luiz Szwarcfiter (Inf. Process. Lett., 2007)

A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs. - Min Chih Lin; Francisco J. Soulignac; Jayme Luiz Szwarcfiter (SWAT, 2008)

Algorithms for finding clique-transversals of graphs. - Guillermo Durán; Min Chih Lin; Sergio Mera; Jayme Luiz Szwarcfiter (Ann. Oper. Res., 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)

Improved algorithms for recognizing p. - Mitre Costa Dourado; Min Chih Lin; Fábio Protti; Jayme Luiz Szwarcfiter (Inf. Process. Lett., 2008)

Unit Circular-Arc Graph Representations and Feasible Circulations. - Min Chih Lin; Jayme Luiz Szwarcfiter (SIAM J. Discret. Math., 2008)

Characterizations and recognition of circular-arc graphs and subclasses: A survey. - Min Chih Lin; Jayme Luiz Szwarcfiter (Discret. Math., 2009)

Short Models for Unit Interval Graphs. - Min Chih Lin; Francisco J. Soulignac; Jayme Luiz Szwarcfiter (Electron. Notes Discret. Math., 2009)

The clique operator on circular-arc graphs. - Min Chih Lin; Francisco J. Soulignac; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2010)

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)

Subclasses of Normal Helly Circular-Arc Graphs - Min Chih Lin; Francisco J. Soulignac; Jayme Luiz Szwarcfiter (CoRR, 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)

Arboricity, h-index, and dynamic algorithms. - Min Chih Lin; Francisco J. Soulignac; Jayme Luiz Szwarcfiter (Theor. Comput. Sci., 2012)

An O *(1.1939 n ) Time Algorithm for Minimum Weighted Dominating Induced Matching. - Min Chih Lin; Michel J. Mizrahi; Jayme Luiz Szwarcfiter (ISAAC, 2013)

Exact algorithms for dominating induced matchings - Min Chih Lin; Michel J. Mizrahi; Jayme Luiz Szwarcfiter (CoRR, 2013)

Normal Helly circular-arc graphs and its subclasses. - Min Chih Lin; Francisco J. Soulignac; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 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)

O(n) Time Algorithms for Dominating Induced Matching Problems. - Min Chih Lin; Michel J. Mizrahi; Jayme Luiz Szwarcfiter (LATIN, 2014)

Fast algorithms for some dominating induced matching problems. - Min Chih Lin; Michel J. Mizrahi; Jayme Luiz Szwarcfiter (Inf. Process. Lett., 2014)

Domination problems on P5-free graphs. - Min Chih Lin; Michel J. Mizrahi (RAIRO Theor. Informatics Appl., 2014)

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)

Efficient and Perfect domination on circular-arc graphs. - Min Chih Lin; Michel J. Mizrahi; Jayme Luiz Szwarcfiter (Electron. Notes Discret. Math., 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)

Approximation algorithms for clique transversals on some graph classes. - Min Chih Lin; Saveliy Vasiliev (Inf. Process. Lett., 2015)

The Maximum Number of Dominating Induced Matchings. - Min Chih Lin; Veronica A. Moyano; Dieter Rautenbach; Jayme Luiz Szwarcfiter (J. Graph Theory, 2015)

Exact Algorithms for Minimum Weighted Dominating Induced Matching. - Min Chih Lin; Michel J. Mizrahi; Jayme Luiz Szwarcfiter (Algorithmica, 2017)

On neighborhood-Helly graphs. - Marina Groshaus; Min Chih Lin; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2017)

Perfect edge domination: hard and solvable cases. - Min Chih Lin; Vadim V. Lozin; Veronica A. Moyano; Jayme Luiz Szwarcfiter (Ann. Oper. Res., 2018)

Approximating weighted induced matchings. - Min Chih Lin; Julián Mestre; Saveliy Vasiliev (Discret. Appl. Math., 2018)

Approximating weighted neighborhood independent sets. - Min Chih Lin; Julián Mestre; Saveliy Vasiliev (Inf. Process. Lett., 2018)

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)

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)

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)