Min Chih Lin

50 papers A* 1B 3Misc 1Journal 44Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
Efficient recognition algorithms for (1,2)-, (2,1)- and (2,2)-graphs.
CoRR
Flavia Bonomo-Braberman, Min Chih Lin, Ignacio Maqueda
2024 J jnl
Graphs whose vertices of degree at least 2 lie in a triangle.
RAIRO Oper. Res.
Vinicius Leal do Forte, Min Chih Lin, Abilio Lucena, Nelson Maculan, Veronica A. Moyano, Jayme Luiz Szwarcfiter
2022 J jnl
Restricted Hamming-Huffman trees.
RAIRO Oper. Res.
Min Chih Lin, Fabiano de S. Oliveira, Paulo E. D. Pinto, Moysés S. Sampaio Jr., Jayme Luiz Szwarcfiter
2022 J jnl
Some New Results on Efficient and Perfect Edge Domination of Graphs.
CoRR
Vinicius Leal do Forte, Min Chih Lin, Abilio Lucena, Nelson Maculan, Veronica A. Moyano, Jayme Luiz Szwarcfiter
2020 J jnl
Modelling and solving the perfect edge domination problem.
Optim. Lett.
Vinicius Leal do Forte, Min Chih Lin, Abilio Lucena, Nelson Maculan, Veronica A. Moyano, Jayme Luiz Szwarcfiter
2018 J jnl
Approximating weighted induced matchings.
Discret. Appl. Math.
Min Chih Lin, Julián Mestre, Saveliy Vasiliev
2018 J jnl
Approximating weighted neighborhood independent sets.
Inf. Process. Lett.
Min Chih Lin, Julián Mestre, Saveliy Vasiliev
2018 J jnl
Perfect edge domination: hard and solvable cases.
Ann. Oper. Res.
Min Chih Lin, Vadim V. Lozin, Veronica A. Moyano, Jayme Luiz Szwarcfiter
2017 J jnl
Exact Algorithms for Minimum Weighted Dominating Induced Matching.
Algorithmica
Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter
2017 J jnl
On neighborhood-Helly graphs.
Discret. Appl. Math.
Marina Groshaus, Min Chih Lin, Jayme Luiz Szwarcfiter
2017 J jnl
Perfect Edge Domination: Hard and Solvable Cases.
CoRR
Min Chih Lin, Vadim V. Lozin, Veronica A. Moyano, Jayme Luiz Szwarcfiter
2015 J jnl
A faster algorithm for the cluster editing problem on proper interval graphs.
Inf. Process. Lett.
Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter
2015 J jnl
Approximation algorithms for clique transversals on some graph classes.
Inf. Process. Lett.
Min Chih Lin, Saveliy Vasiliev
2015 J jnl
Efficient and Perfect domination on circular-arc graphs.
CoRR
Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter
2015 J jnl
Efficient and Perfect domination on circular-arc graphs.
Electron. Notes Discret. Math.
Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter
2015 J jnl
On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size.
Discret. Appl. Math.
Min Chih Lin, Michel J. Mizrahi
2015 J jnl
The Maximum Number of Dominating Induced Matchings.
J. Graph Theory
Min Chih Lin, Veronica A. Moyano, Dieter Rautenbach, Jayme Luiz Szwarcfiter
2014 J jnl
Domination problems on P
RAIRO Theor. Informatics Appl.
Min Chih Lin, Michel J. Mizrahi
2014 J jnl
Fast algorithms for some dominating induced matching problems.
Inf. Process. Lett.
Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter
2014 B conf
O(n) Time Algorithms for Dominating Induced Matching Problems.
LATIN
Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter
2013 J jnl
An $O^*(1.1939^n)$ time algorithm for minimum weighted dominating induced matching
CoRR
Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter
2013 B conf
An O *(1.1939 n ) Time Algorithm for Minimum Weighted Dominating Induced Matching.
ISAAC
Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter
2013 J jnl
Exact algorithms for dominating induced matchings
CoRR
Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter
2013 J jnl
Isomorphism of graph classes related to the circular-ones property.
Discret. Math. Theor. Comput. Sci.
Andrew R. Curtis, Min Chih Lin, Ross M. McConnell, Yahav Nussbaum, Francisco J. Soulignac, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter
2013 J jnl
Normal Helly circular-arc graphs and its subclasses.
Discret. Appl. Math.
Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter
2012 J jnl
Arboricity, h-index, and dynamic algorithms.
Theor. Comput. Sci.
Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter
2012 J jnl
Isomorphism of graph classes related to the circular-ones property
CoRR
Andrew R. Curtis, Min Chih Lin, Ross M. McConnell, Yahav Nussbaum, Francisco J. Soulignac, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter
2011 J jnl
Linear-Time Recognition of Helly Circular-Arc Models and Graphs.
Algorithmica
Benson L. Joeris, Min Chih Lin, Ross M. McConnell, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter
2011 J jnl
Powers of cycles, powers of paths, and distance graphs.
Discret. Appl. Math.
Min Chih Lin, Dieter Rautenbach, Francisco J. Soulignac, Jayme Luiz Szwarcfiter
2011 J jnl
Subclasses of Normal Helly Circular-Arc Graphs
CoRR
Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter
2010 J jnl
Arboricity, h-Index, and Dynamic Algorithms
CoRR
Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter
2010 J jnl
The clique operator on circular-arc graphs.
Discret. Appl. Math.
Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter
2009 J jnl
Characterizations and recognition of circular-arc graphs and subclasses: A survey.
Discret. Math.
Min Chih Lin, Jayme Luiz Szwarcfiter
2009 J jnl
Short Models for Unit Interval Graphs.
Electron. Notes Discret. Math.
Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter
2008 — conf
A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs.
SWAT
Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter
2008 J jnl
Algorithms for finding clique-transversals of graphs.
Ann. Oper. Res.
Guillermo Durán, Min Chih Lin, Sergio Mera, Jayme Luiz Szwarcfiter
2008 J jnl
Improved algorithms for recognizing p.
Inf. Process. Lett.
Mitre Costa Dourado, Min Chih Lin, Fábio Protti, Jayme Luiz Szwarcfiter
2008 J jnl
On cliques of Helly Circular-arc Graphs.
Electron. Notes Discret. Math.
Min Chih Lin, Ross M. McConnell, Francisco J. Soulignac, Jayme Luiz Szwarcfiter
2008 J jnl
Unit Circular-Arc Graph Representations and Feasible Circulations.
SIAM J. Discret. Math.
Min Chih Lin, Jayme Luiz Szwarcfiter
2007 J jnl
Faster recognition of clique-Helly and hereditary clique-Helly graphs.
Inf. Process. Lett.
Min Chih Lin, Jayme Luiz Szwarcfiter
2007 B conf
Proper Helly Circular-Arc Graphs.
WG
Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter
2006 J jnl
Algorithms for clique-independent sets on subclasses of circular-arc graphs.
Discret. Appl. Math.
Guillermo Durán, Min Chih Lin, Sergio Mera, Jayme Luiz Szwarcfiter
2006 Misc conf
Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs.
COCOON
Min Chih Lin, Jayme Luiz Szwarcfiter
2006 A* conf
Efficient construction of unit circular-arc models.
SODA
Min Chih Lin, Jayme Luiz Szwarcfiter
2006 J jnl
On Balanced Graphs.
Math. Program.
Flavia Bonomo, Guillermo Durán, Min Chih Lin, Jayme Luiz Szwarcfiter
2004 J jnl
Clique-independent sets of Helly circular-arc graphs.
Electron. Notes Discret. Math.
Guillermo Durán, Min Chih Lin, Sergio Mera, Jayme Luiz Szwarcfiter
2003 J jnl
Self-clique graphs and matrix permutations.
J. Graph Theory
J. Adrian Bondy, Guillermo Durán, Min Chih Lin, Jayme Luiz Szwarcfiter
2002 J jnl
On Clique-Transversals and Clique-Independent Sets.
Ann. Oper. Res.
Guillermo Durán, Min Chih Lin, Jayme Luiz Szwarcfiter
2001 J jnl
A sufficient condition for self-clique graphs.
Electron. Notes Discret. Math.
J. Adrian Bondy, Guillermo Durán, Min Chih Lin, Jayme Luiz Szwarcfiter
2001 J jnl
Clique graphs of Helly circular arc graphs.
Ars Comb.
Guillermo Durán, Min Chih Lin