DO FORTE, VINICIUS L.; LIN, MIN CHIH; LUCENA, ABILIO; MACULAN, NELSON; MOYANO, VERONICA A.; SZWARCFITER, JAYME L.

Graphs whose vertices of degree at least 2 lie in a triangle

RAIRO - RECHERCHE OPERATIONNELLE (OPERATIONS RESEARCH); Lugar: Paris; Año: 2024

LIN, MIN CHIH; OLIVEIRA,FABIANO; PINTO,PAULO; SAMPAIO, MOYSÉS J.; SZWARCFITER, JAYME L.

Restricted Hamming-Huffman Trees

RAIRO - RECHERCHE OPERATIONNELLE (OPERATIONS RESEARCH); Lugar: Paris; Año: 2022 vol. 56 p. 1823 - 1839

AMBROSIS, NICOLÁS; MARTIN AISPURO, PABLO; BELHART, KEILA; BOTTERO, DANIELA; CRISP, RENÉE LEONOR; DANSEY, MARÍA VIRGINIA; GABRIELLI, MAGALI; FILEVICH, OSCAR; GENOUD, VALERIA; GIORDANO, ALEJANDRA; LIN, MIN CHIH; LODEIRO, ANIBAL; MARCECA, FELIPE; PREGI, NICOLÁS; LENICOV, FEDERICO REMES; ROCHA-VIEGAS, LUCIANA; RUDI, ERIKA; SOLOVEY, GUILLERMO; ZURITA, EUGENIA; PECCI, ADALI; ETCHENIQUE, ROBERTO; HOZBOR, DANIELA

Active Surveillance of Asymptomatic, Presymptomatic, and Oligosymptomatic SARS-CoV-2-Infected Individuals in Communities Inhabiting Closed or Semi-closed Institutions

Frontiers in Medicine; Lugar: Lausana; Año: 2021 vol. 8

DO FORTE, VINICIUS L.; LIN, MIN CHIH; LUCENA, ABILIO; MACULAN, NELSON; MOYANO, VERONICA A.; SZWARCFITER, JAYME L.

Modelling and solving the perfect edge domination problem

OPTIMIZATION LETTERS; Lugar: HEIDELBERG; Año: 2020 vol. 14 p. 369 - 394

LIN, MIN CHIH; MESTRE, JULIÁN; VASILIEV, SAVELIY

Approximating weighted induced matchings

DISCRETE APPLIED MATHEMATICS; Lugar: Amsterdam; Año: 2018 vol. 243 p. 304 - 310

LIN, MIN CHIH; LOZIN, VADIM; MOYANO, VERONICA A.; SZWARCFITER, JAYME L.

Perfect edge domination: hard and solvable cases

ANNALS OF OPERATIONS RESEARCH; Lugar: Berlin; Año: 2018 vol. 264 p. 287 - 305

LIN, MIN CHIH; MESTRE, JULIÁN; VASILIEV, SAVELIY

Approximating weighted neighborhood independent sets

INFORMATION PROCESSING LETTERS; Lugar: Amsterdam; Año: 2018 vol. 130 p. 11 - 15

MARINA GROSHAUS; MIN CHIH LIN; JAYME L. SZWARCFITER

On neighborhood-Helly graphs

DISCRETE APPLIED MATHEMATICS; Lugar: Amsterdam; Año: 2017 vol. 216 p. 191 - 202

MIN CHIH LIN; MICHEL MIZRAHI; JAYME L. SZWARCFITER

Exacts algorithms for the minimum weighted dominating induced matching

ALGORITHMICA; Lugar: NEW YORK; Año: 2017 vol. 77 p. 642 - 660

MIN CHIH LIN; FRANCISCO J. SOULIGNAC; JAYME L. SZWARCFITER

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

INFORMATION PROCESSING LETTERS; Lugar: Amsterdam; Año: 2015 vol. 115 p. 913 - 916

MIN CHIH LIN; MICHEL MIZRAHI

On the Complexity of the Minimum Domination Problem restricted by forbidden induced subgraphs of small size

DISCRETE APPLIED MATHEMATICS; Lugar: Amsterdam; Año: 2015 vol. 197 p. 53 - 58

MIN CHIH LIN; MICHEL MIZRAHI; JAYME LUIZ SZWARCFITER

Efficient and Perfect domination on circular-arc graphs

Electronic Notes in Discrete Mathematics; Lugar: AMSTERDAM; Año: 2015 vol. 50 p. 307 - 312

MIN CHIH LIN; VERÓNICA ANDREA MOYANO; DIETER RAUTENBACH; JAYME L. SZWARCFITER

The Maximum Number of Dominating Induced Matchings

JOURNAL OF GRAPH THEORY; Lugar: New York; Año: 2015 vol. 78 p. 258 - 268

MIN CHIH LIN; SAVELI VASILIEV

Approximation algorithms for clique transversals on some graph classes

INFORMATION PROCESSING LETTERS; Lugar: Amsterdam; Año: 2015 vol. 115 p. 667 - 670

MIN CHIH LIN; MICHEL MIZRAHI

Domination problems on $P_5$-free graphs

RAIRO - INFORMATIQUE THEORIQUE ET APPLICATIONS; Lugar: Paris; Año: 2014 vol. 48 p. 541 - 549

MIN CHIH LIN; MICHEL MIZRAHI; JAYME L. SZWARCFITER

Fast Algorithms for Some Dominating Induced Matching Problems

INFORMATION PROCESSING LETTERS; Lugar: Amsterdam; Año: 2014 vol. 114 p. 524 - 528

ANDREW R. CURTIS; MIN CHIH LIN; ROSS M. MCCONNELL; YAHAV NUSSBAUM; FRANCISCO J. SOULIGNAC; JEREMY P. SPINRAD; JAYME L. SZWARCFITER

Isomorphism of graph classes related to the circular-ones property

DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE (DMTCS); Lugar: Nancy; Año: 2013 vol. 15 p. 157 - 182

MIN CHIH LIN; FRANCISCO J. SOULIGNAC; JAYME L. SZWARCFITER

Normal Helly circular-arc graphs and its subclasses

DISCRETE APPLIED MATHEMATICS; Lugar: Amsterdam; Año: 2013 vol. 161 p. 1037 - 1059

MIN CHIH LIN; FRANCISCO JUAN SOULIGNAC; JAYME L. SZWARCFITER

Arboricity, h-Index, and Dynamic Algorithms

THEORETICAL COMPUTER SCIENCE; Lugar: Amsterdam; Año: 2012 vol. 426 p. 75 - 90

BENSON L. JOERIS; MIN CHIH LIN; ROSS M. MCCONNELL; JEREMY P. SPINRAD; JAYME L. SZWARCFITER

Linear Time Recognition of Helly Circular-Arc Models and Graphs

ALGORITHMICA; Lugar: NEW YORK; Año: 2011 vol. 59 p. 215 - 239

MIN CHIH LIN; DIETER RAUTENBACH; FRANCISCO JUAN SOULIGNAC; JAYME LUIZ SZWARCFITER

Powers of cycles, powers of paths, and distance graphs

DISCRETE APPLIED MATHEMATICS; Lugar: AMSTERDAM; Año: 2011 vol. 159 p. 621 - 627

MIN CHIH LIN; FRANCISCO J. SOULIGNAC; JAYME L. SZWARCFITER

The Clique Operator on Circular-Arc Graphs

DISCRETE APPLIED MATHEMATICS; Lugar: AMSTERDAM; Año: 2010 vol. 158 p. 1259 - 1267

MIN CHIH LIN; JAYME L. SZWARCFITER

Characterizations and recognition of circular-arc graphs and subclasses: a survey

DISCRETE MATHEMATICS; Lugar: AMSTERDAM; Año: 2009 vol. 309 p. 5618 - 5635

MIN CHIH LIN; FRANCISCO J. SOULIGNAC; JAYME L. SZWARCFITER

Short Models for Unit Interval Graphs

Electronic Notes in Discrete Mathematics; Lugar: AMSTERDAM; Año: 2009 vol. 35 p. 247 - 255

MITRE C. DOURADO; MIN CHIH LIN; FÁBIO PROTTI; JAYME L. SZWARCFITER

Improved Algorithms for Recognizing p-Helly and Hereditary p-Helly Hypergraphs

INFORMATION PROCESSING LETTERS; Lugar: AMSTERDAM; Año: 2008 vol. 108 p. 247 - 250

MIN CHIH LIN; JAYME L. SZWARCFITER

Unit Circular-Arc Graph Representations and Feasible Circulations

SIAM JOURNAL ON DISCRETE MATHEMATICS; Lugar: PHILADELPHIA; Año: 2008 vol. 22 p. 409 - 423

GUILLERMO DURÁN; MIN CHIH LIN; SERGIO MERA; JAYME L. SZWARCFITER

Algorithms for finding clique-transversals of graphs

ANNALS OF OPERATIONS RESEARCH; Lugar: DORDRECHT; Año: 2008 vol. 157 p. 37 - 45

MIN CHIH LIN; ROSS M. MCCONNELL; FRANCISCO J. SOULIGNAC; JAYME L. SZWARCFITER

On cliques of Helly circular-arc graphs

Electronic Notes in Discrete Mathematics; Lugar: AMSTERDAM; Año: 2008 vol. 30 p. 117 - 122

MIN CHIH LIN; JAYME L. SZWARCFITER

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

INFORMATION PROCESSING LETTERS; Lugar: AMSTERDAM; Año: 2007 vol. 103 p. 40 - 43

GUILLERMO DURÁN; MIN CHIH LIN; SERGIO MERA; JAYME L. SZWARCFITER

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

DISCRETE APPLIED MATHEMATICS; Lugar: AMSTERDAM; Año: 2006 vol. 154 p. 1783 - 1790

FLAVIA BONOMO; GUILLERMO DURÁN; MIN CHIH LIN; JAYME L. SZWARCFITER

On Balanced Graphs

MATHEMATICAL PROGRAMMING; Lugar: NEW YORK; Año: 2006 vol. 105 p. 233 - 250

GUILLERMO DURÁN; MIN CHIH LIN; SERGIO MERA; JAYME L. SZWARCFITER

Clique-independent sets of Helly circular-arc graphs

Electronic Notes in Discrete Mathematics; Lugar: AMSTERDAM; Año: 2004 vol. 18 p. 103 - 108

ADRIAN BONDY; GUILLERMO DURÁN; MIN CHIH LIN; JAYME L. SZWARCFITER

Self-clique graphs and matrix permutations

JOURNAL OF GRAPH THEORY; Lugar: HOBOKEN; Año: 2003 vol. 44 p. 178 - 192

GUILLERMO DURÁN; MIN CHIH LIN; JAYME L. SZWARCFITER

On Clique-Transversals and Clique-Independent Sets

ANNALS OF OPERATIONS RESEARCH; Lugar: DORDRECHT; Año: 2002 vol. 116 p. 71 - 77

GUILLERMO DURÁN; MIN CHIH LIN

Clique graphs of Helly circular-arc graphs

ARS COMBINATORIA; Lugar: WINNIPEG; Año: 2001 vol. 60 p. 255 - 271

ADRIAN BONDY; GUILLERMO DURÁN; MIN CHIH LIN; JAYME L. SZWARCFITER

A sufficient condition for self-clique graphs

Electronic Notes in Discrete Mathematics; Lugar: AMSTERDAM; Año: 2001 vol. 7 p. 174 - 177

GUILLERMO DURÁN; MIN CHIH LIN

On some subclasses of circular-arc graphs

CONGRESSUS NUMERANTIUM; Lugar: WINNIPEG; Año: 2000 vol. 146 p. 201 - 212