home   publicaciones   docencia   investigación   alumnos   laboral   familia   curriculum vitae   @   links 
home
publicaciones
docencia

proyectos de investigación
alumnos
laboral

familia
curriculum vitae
e-mail
links
Área de investigación | Research area
 Algoritmos y Teoría de Grafos | Algorithms and Graph Theory
 Optimización Combinatoria | Combinatorial Optimization
Trabajos publicados | Published papers
  en revistas internacionales indexadas por
   ISI y calificadas por CAPES QUALIS
 
 Lin M., Soulignac F. and Szwarcfiter J., "The Clique Operator on
  Circular-Arc Graphs", Discrete Applied Mathematics (2008),
  accepted. [CAPES QUALIS Comp:A; Math:A]
 Joeris B., Lin M., McConnell R., Spinrad J. and Szwarcfiter J., "Linear
  Time Recognition of Helly Circular-Arc Models and Graphs",
  Algorithmica (2008), accepted. [CAPES QUALIS Comp:A; Math:A]
 Lin M. and Szwarcfiter J., "Characterizations and recognition of
  circular-arc graphs and subclasses: a survey", Discrete Mathematics,
  available online. [CAPES QUALIS Comp:A; Math:A]
 [link] [PDF]
 Dourado M., Lin M., Protti F. and Szwarcfiter J., "Improved Algorithms
  for Recognizing p-Helly and Hereditary p-Helly Hypergraphs",
  Information Processing Letters 108(4) (2008), 247-250. [CAPES
  QUALIS
Comp:B; Math:B]
 [link] [PDF]
 Lin M. and Szwarcfiter J., "Unit Circular-Arc Graph Representations and
  Feasible Circulations", SIAM Journal on Discrete Mathematics 22(1)
  (2008), 409-423. [CAPES QUALIS Comp:A]
 [link] [PDF]
 Durán G., Lin M., Mera S. and Szwarcfiter J., "Algorithms for finding
  clique-transversals of graphs", Annals of Operations Research 157
  (2008), 37-45. [CAPES QUALIS Comp:B; Math:A]
 [link] [PDF]
 Lin M. and Szwarcfiter J., "Faster Recognition of Clique-Helly and
  Hereditary Clique-Helly Graphs", Information Processing Letters 103(1)
  (2007), 40-43. [CAPES QUALIS Comp:B; Math:B]
 [link] [PDF]
 Durán G., Lin M., Mera S. and Szwarcfiter J., "Algorithms for clique-
  independent sets on sublcasses of circular-arc graphs", Discrete
  Applied Mathematics 154(13) (2006), 1783-1790. [CAPES QUALIS
  Comp:A; Math:A]
 [link] [PDF]
 Bonomo F., Durán G., Lin M. and Szwarcfiter J., "On Balanced Graphs",
  Mathematical Programming 105 (2006), 233-250. [CAPES QUALIS
  Comp:A; Math:A]
 [link] [PS]
 Bondy A., Durán G., Lin M. and Szwarcfiter J., "Self-clique graphs and
  matrix permutations", Journal of Graph Theory, Vol. 44, Issue 3,
  (2003), 178-192. [CAPES QUALIS Comp:B; Math:A]
[link] [PS]
 Durán G., Lin M. and Szwarcfiter J., "On clique-transversals and clique-
  independent sets", Annals of Operations Research 116 (2002), 71-77.
  [CAPES QUALIS Comp:B; Math:A]
[link] [PS]
 Durán G. and Lin M., "Clique graphs of Helly circular-arc graphs", Ars
  Combinatoria 60 (2001), 255-271. [CAPES QUALIS Comp:C; Math:B]
[PDF]
  en revistas internacionales no indexadas  
 Lin M., McConnell R., Soulignac F. and Szwarcfiter J., "On cliques of
  Helly circular-arc graphs", Electronic Notes in Discrete Mathematic 30
  (2008), 117-122.
[link][PDF]
 Durán G., Lin M., Mera S. and Szwarcfiter J., "Clique-independent sets
  of Helly circular-arc graphs", Electronic Notes in Discrete Mathematic,
  Volume 18  (2004), 103-108.
[link] [PS]
 Bondy A., Durán G., Lin M. and Szwarcfiter J., "A sufficient condition
  for self-clique graphs", Electronic Notes in Discrete Mathematic,
  Volume 7 (2001), 174-177.
[link] [PS]
 Durán G. and Lin M., "On some subclasses of circular-arc graphs",
  Congressus Numerantium 146 (2000), 201-212.
[PDF]
  en actas de congresos internacionales  
 Lin M., Soulignac F. and Szwarcfiter J., "A Simple Linear Time Algorithm
  for the Isomorphism Problem on Proper Circular-Arc Graphs", aceptado
  en 11th Scandinavian Workshop on Algorithm Theory (SWAT'08)(2008),
  Lecture Notes in Computer Science 5124 (2008), 355-366.
 [link] [PDF]
 Lin M., Soulignac F. and Szwarcfiter J., "Proper Helly Circular-Arc
  Graphs", Proceedings of 33rd International Workshop on Graph-
  Theoretic Concepts in Computer Science (WG'07), Lecture Notes in
  Computer Science 4769 (2007), 248-257.
 [link] [PDF]
 Lin M. and Szwarcfiter J., "Characterizations and linear time recognition
  of helly circular-arc graphs", Proceedings of the 12th Annual
  International conference on Computing and Combinatorics
  (COCOON’06), Lecture Notes in Computer Science 4112 (2006), 73-82.
 [link] [PDF]
 Lin M. and Szwarcfiter J., "Efficient Construction of Unit Circular-Arc
  Models", Proceedings of the 17th Annual ACM-SIAM Symposium on
  Discrete Algorithms (SODA’06) (2006), 309-315.
 [link] [PDF]
Trabajos en preparación | Working papers
 Groshaus M., Lin M. and Szwarcfiter J., "Characterizations and
  Recognitions of Neighborhood Helly graphs".
 Curtis A., Lin M., McConnell R., Soulignac F. and Szwarcfiter J., "Linear
  Time Algorithms for some problems on Helly Circular-Arc Graphs".
 Lin M., Soulignac F. and Szwarcfiter J., "Classes of Helly circular-arc
  graphs".
Tesis Doctoral | PhD Thesis
 Título: Grafos self-clique y otras clases de grafos clique
  Director: Jayme L. Szwarcfiter (Universidad Federal de Rio de Janeiro)
  Fecha de presentación: Mayo de 2001
[PS]
Tesis Doctorales de miembros del grupo | PhD Thesis
 Título: Sobre grafos intersección de arcos y cuerdas en un círculo
  Autor: Guillermo A. Durán
  Director: Jayme L. Szwarcfiter (Universidad Federal de Rio de Janeiro)
  Fecha de presentación: Mayo de 2000
[PS]