Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarMin Chih Lin
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – today
- 2018
[j32]Min Chih Lin, Vadim V. Lozin, Veronica A. Moyano, Jayme Luiz Szwarcfiter:
Perfect edge domination: hard and solvable cases. Annals OR 264(1-2): 287-305 (2018)- [j31]Min Chih Lin, Julián Mestre, Saveliy Vasiliev:
Approximating weighted induced matchings. Discrete Applied Mathematics 243: 304-310 (2018) - [j30]Min Chih Lin, Julián Mestre, Saveliy Vasiliev:
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. Discrete Applied Mathematics 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. Discrete Applied Mathematics 197: 53-58 (2015) - [j26]Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter:
Efficient and Perfect domination on circular-arc graphs. Electronic Notes in Discrete Mathematics 50: 307-312 (2015) - [j25]Min Chih Lin, Saveliy Vasiliev:
Approximation algorithms for clique transversals on some graph classes. Inf. Process. Lett. 115(9): 667-670 (2015) - [j24]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): 913-916 (2015) - [j23]Min Chih Lin, Veronica A. Moyano, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
The Maximum Number of Dominating Induced Matchings. Journal of 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, Michel J. Mizrahi, Jayme Luiz Szwarcfiter:
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. Inf. and Applic. 48(5): 541-549 (2014) - [c6]Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter:
O(n) Time Algorithms for Dominating Induced Matching Problems. LATIN 2014: 399-408 - 2013
- [j20]Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter:
Normal Helly circular-arc graphs and its subclasses. Discrete Applied Mathematics 161(7-8): 1037-1059 (2013) - [j19]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. Discrete Mathematics & Theoretical Computer Science 15(1): 157-182 (2013) - [c5]Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter:
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, Francisco J. Soulignac, Jayme Luiz Szwarcfiter:
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, Ross M. McConnell, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter:
Linear-Time Recognition of Helly Circular-Arc Models and Graphs. Algorithmica 59(2): 215-239 (2011) - [j16]Min Chih Lin, Dieter Rautenbach, Francisco J. Soulignac, Jayme Luiz Szwarcfiter:
Powers of cycles, powers of paths, and distance graphs. Discrete Applied Mathematics 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, Francisco J. Soulignac, Jayme Luiz Szwarcfiter:
The clique operator on circular-arc graphs. Discrete Applied Mathematics 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, Jayme Luiz Szwarcfiter:
Characterizations and recognition of circular-arc graphs and subclasses: A survey. Discrete Mathematics 309(18): 5618-5635 (2009) - [j13]Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter:
Short Models for Unit Interval Graphs. Electronic Notes in Discrete Mathematics 35: 247-255 (2009) - 2008
- [j12]Guillermo Durán, Min Chih Lin, Sergio Mera, Jayme Luiz Szwarcfiter:
Algorithms for finding clique-transversals of graphs. Annals OR 157(1): 37-45 (2008) - [j11]Min Chih Lin, Ross M. McConnell, Francisco J. Soulignac, Jayme Luiz Szwarcfiter:
On cliques of Helly Circular-arc Graphs. Electronic Notes in Discrete Mathematics 30: 117-122 (2008) - [j10]Mitre Costa Dourado, Min Chih Lin, Fábio Protti, Jayme Luiz Szwarcfiter:
Improved algorithms for recognizing p. Inf. Process. Lett. 108(4): 247-250 (2008) - [j9]Min Chih Lin, Jayme Luiz Szwarcfiter:
Unit Circular-Arc Graph Representations and Feasible Circulations. SIAM J. Discrete Math. 22(1): 409-423 (2008) - [c4]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: 355-366 - 2007
- [j8]Min Chih Lin, Jayme Luiz Szwarcfiter:
Faster recognition of clique-Helly and hereditary clique-Helly graphs. Inf. Process. Lett. 103(1): 40-43 (2007) - [c3]Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter:
Proper Helly Circular-Arc Graphs. WG 2007: 248-257 - 2006
- [j7]Guillermo Durán, Min Chih Lin, Sergio Mera, Jayme Luiz Szwarcfiter:
Algorithms for clique-independent sets on subclasses of circular-arc graphs. Discrete Applied Mathematics 154(13): 1783-1790 (2006) - [j6]Flavia Bonomo, Guillermo Durán, Min Chih Lin, Jayme Luiz Szwarcfiter:
On Balanced Graphs. Math. Program. 105(2-3): 233-250 (2006) - [c2]Min Chih Lin, Jayme Luiz Szwarcfiter:
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, Sergio Mera, Jayme Luiz Szwarcfiter:
Clique-independent sets of Helly circular-arc graphs. Electronic Notes in Discrete Mathematics 18: 103-108 (2004) - 2003
- [j4]John Adrian Bondy, Guillermo Durán, Min Chih Lin, Jayme Luiz Szwarcfiter:
Self-clique graphs and matrix permutations. Journal of 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. Annals OR 116(1-4): 71-77 (2002) - 2001
- [j2]
- [j1]John Adrian Bondy, Guillermo Durán, Min Chih Lin, Jayme Luiz Szwarcfiter:
A sufficient condition for self-clique graphs. Electronic Notes in Discrete Mathematics 7: 174-177 (2001)
Coauthor Index
maintained by 
, founded at 
, founded at 
last updated on 2018-12-01 22:30 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
