Producción Científica

Artículos Científicos en Revistas (todos con referato):
  • Gutierrez and L. Oubiña  Minimum proper interval graph , ,Discrete Mathematics 142 (1995) 77-85.Notas de Matemática 52. Dep. de Matemática. Fac de Cs. Exactas. UNLP(1993).
  • Gutierrez and L. Oubiña,    Metric caracterizations of Proper interval graphs and Tree-clique graphs, Journal of Graph Theory 21 n.2 199-205 (1996) Notas de Matemática 54. Dep. de Matemática. Fac. de Cs. Exactas. UNL(1994).
  • Gutierez and João Meidanis, On the Clique Operator, Lecture Notes inComputer  Science, vol 1380, 261-272. (1998).
  • Gutierrez , Intersection Graphs and the Clique Operator, Graphs and Combinatorics, vol.2 (2001) 237-244.
  • Gutierrez and J. Meidanis, Algebraic Theory for the Clique Operator, Journal of the Brasilian Computer Society, 7(3): 53-64.(2002)
  • Alcón and M. Gutierrez, A new characterization of clique graphs. Matemática Contemporanea, 25: 1-7. (2003).
  • Dobson and M. Gutierrez, Comparability-Helly is not fixed under K. Matemática Contemporanea, 25: 71-79, (2003).
  • Gutierrez and J. Meidanis, Preimage, Image, and Iterated Image of heClique              Operator.  Matemática Contemporanea, 25: 107-123, (2003).
  • Gutierrez and J. Meidanis, Recognizing Clique Graph of Directed Edge Path               Graphs, Discrete Applied Math, 126:297-304. (2003)
  •   Gutierrez and J. Meidanis,  On the Clique Graph Recognition, Ars Combinatoria,  vol. 63 (2002), 207-210.
  • Alcón and M. Gutierrez, Cliques and Extended Triangles.  A necessary condition to be Clique Planar Graph, Discrete Applied Math, Vol: 141/1-3, (2004) 3-17.
  • Alcón and M. Gutierrez, Clique Graphs of Planar Graphs, Ars Combinatoria. , Vol: 71, 257-261 (2004).
  • Bodlaender, C. de Figueiredo, M. Gutierrez, T. Kloks, and R. Niedermeier, Simple-Max Cut for Split-Indifference Graphs and Graphs with few P4´s,  Lecture Notes in Computer Science, Vol: 3059, (2004), 87-99. ISSN 0302-9743
  • Alcón, M. R. Cerioli, C. M. H. de Figueiredo, M. Gutierrez , J. Meidanis.  Tree Loop Graphs (version completa). Discrete Applied Mathematics. Series on Computational Biology, Vol 155: 686-694(2007).
  • M.P. Dobson, M. Gutierrez and J. L. Szwarcfiter. Characterizations for treelike         graphs Congressus Numerantium 182 (2006), pp 23-32.
  • Alcón, L. Farias, C. M. H. de   Figueiredo, M. Gutierrez,Clique Graph              recognition is NP-Complete,  Lecture Notes in Computer Science, 4271, (2006),                  pp 269–277. ISSN  0302-9743.
  •     M.P. Dobson, M. Gutierrez, M. Habib and  J.L. Szwarcfiter. Comparability graphs    with restricted covering graphs, Information  Processing Letters 101, 119- 125 (2007).
  • Alcón, M. R. Cerioli, C. M. H. de Figueiredo, M. Gutierrez and J. Meidanis. Cycles  and Asteroidal Sets in Loop Graphs, Actas de la  Academia Nacional de Ciencias,  Tomo XIII, 2007.pp 41—49. ISSN 0325-7533
  • Alcón, L. Faria, C. Figueiredo and M. Gutierrez The complexity of clique   graph  recognition, Theoretical Computer Science (2009), 410, pp 2072–2083.
  • L. Alcón, L. Farias, C. M. H. de Figueiredo, M. Gutierrez. On maximizing clique,       clique-Helly and hereditary clique-Helly induced subgraphs, (complete version)  Discrete Applied Mathematics,  (2010) 158 pp. 1279-1285.
  • De Caria,  M. Gutierrez, Determining possible sets of leaves for spaning tree of dually chordal  graphs (complete version). Ars Combinatoria (2010) en prensa.
  • Alcón and M. Gutierrez, Finding intersection models: from chordal to Helly           circular-arc graphs,  Discrete Math (2012)  312 pp. 1148-1157.
  • Chaplick, M. Gutierrez, B. Lévêque, S. Tondato, From path graphs to directed                path  graphs, Lecture Notes in Computer Science, 6410, (2010),  pp 256–265. ISSN  0302-9743.
  • Alcón, L. Farias, C. M. H. de   Figueiredo, M. Gutierrez, Split Clique Graph        complexity,  Lecture Notes in Computer Science, 6986,  (2011) , pp 11-22. ISSN 0302-9743
  • De Caria and M. Gutierrez, Determining what sets of trees can be the clique trees of a  chordal graph,  Journal of the Brazilian Computer Society, 18, (2011), pp 121-128.
  • De Caria and M. Gutierrez, On minimal vertex separators of dually chordal      graphs: properties and characterizations,   Discrete Applied Mathematics,  160(2012)  pp. 2627-2635.
  •  De Caria and M. Gutierrez, Special eccentric vertices in chordal graphs and      related  classes,   (complete version) Graph and Combinatorics 30 (2014) pp.343–352.
  •  De Caria and M. Gutierrez, On the correspondence between tree epresentations      of chordal and dually chordal graphs,  Discrete Applied Mathematics 164 (2014)500–511.
  • Alcón, L. Farias, C. M. H. de  Figueiredo, M. Gutierrez, Split Clique Graph         complexity, (complete version) Theoretical Computer Science 506 (2013) pp.29–42.
  • Alcón, M. Gutierrez, M. P. Mazzoleni, Recognizing vertex intersection graphs          of paths on bounded degree trees, Discrete Applied Mathematics, 162 (2014) 70-77
  • Alcón, M. Gutierrez, G. Hulbert, Pebbling number of Split Graph, SIAM J. Discrete Math,vol 28 n. 3 (2014) pp.1449-1466.
  • Alcón, M. Gutierrez, M. P. Mazzoleni Characterizing paths graphs on bounded  degree trees by minimal forbidden induced subgraphs,  Discrete Mathematics,    vol.  338, n. 1 (2015) pp. 103–110.
  • Alcón, B. Bresar, T. Gologranc, T. Kraner, I. Peterin, A. Tepeh  Toll convexity,  European Journal of Combinatorics N. 46 pp. 161-175 (2015)
  • Gutierrez, S. Tondato On models of directed path graphs non rooted  directed  path graphs, Graph and Combinatorics 32 (2) pp.663-684 (2015).
  • Gutierrez, B. Leveque, S. Tondato Asteroidal quadruples in non rooted path      Graphs, Disscuciones Mathematicae N. 1821 pp. 603-614 (2015).
  • Alcón, M. Gutierrez, I. Kovacs, M. Milanic, R. Rizzi, Strong cliques andequistable EPT graphs, Discrete Applied Mathematics N. 203 pp. 13-25 (2016).
  • Alcón, F. Bonomo, G. Durán, M. Gutierrez, M. P. Mazzoleni, B. Ries M. Valencia On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid. Aceptado en Discrete Applied Mathematics. (2016)
  • Gutierrez , S. Tondato On rooted directed path graphs Revista de la Unión Matemática Argentina, Vol 57, pp. 114-144 (2016).
  •         De Caria, M. Gutierrez On basic chordal graphs and some of its subclases,Aceptado en Discrete Applied Mathematics N  210 pp. 261-276 (2016)
  •  Gutierrez , S. Tondato End simplicial vertices in path graphsAceptado en Discussiones Mathematicae Graph Theory. N 36 pp. 393-408 (2016)
  • Gutierrez , S. Tondato Extended star graphs.  Algebra and Discrete Mathematics Vol 21 N 2 pp. 239-254 (2016).
  • Alcón, N. Gudiño, M. Gutierrez, Introducing containment graphs of paths in  a tree, aceptado en Discrete Applied Mathematics (2016).
Artículos en Actas de Congresos  (todos con referato):
  • M. Gutierrez Tree-clique graphs, Estudos  e Comunicacoes do Instituto de Matemática, Universidad  Federal  do Rio de Janeiro , n. 63 7-26 (1996).
  • M. Gutierrez and J. Meidanis, The Clique Operator, Set Families, and Their         Properties. Electronic Notes in Discrete Mathematic. Volumen 7 (2001).
  • L. Alcón and M. Gutierrez, Clique Planar Graphs. Electronic Notes in Discrete Mathematic.  Volumen 7 (2001).
  • P. Dobson, M. Gutierrez and J. Szwarcfiter, Treelike Comparability Graphs Electrionic Notes in Discrete Mathematics. Vol 18: 97-102 (2004).
  • L. Alcón, M. R. Cerioli, C. M. H. de Figueiredo, M. Gutierrez, J. Meidanis. Tree Loop Graphs, Electrionic Notes in Discrete Mathematics.Vol 18: 17-23 (2004).
  • L. Alcón, M. R. Cerioli, C. M. H. de Figueiredo, M. Gutierrez , and J. Meidanis         Non  Loop Graphs with induced Cycles,  Electronic Notes in DiscreteMathematics.  Vol: 19, 289-295 (2005).
  • L. Alcón, M. R. Cerioli, C. M. H. de Figueiredo, M. Gutierrez , and J. Meidanis         Loop graphs and Asteroidal Sets, Electronic Notes in Discrete Mathematics,Vol. 22, 179—183 (2005).
  • M. Gutierrez, S. Tondato , and J.Szwarcfiter A forbidden subgraph            characterization of path graphs, Electronic Notes in DiscreteMathematics, III Latin-American Algorithms, Graphs and OptimizationSymposium  (2005), 19, 281-287.
  • L. Alcón, L. Farias, C. M. H. de Figueiredo, M. Gutierrez. On maximizing clique,         clique-Helly and hereditary clique-Helly induced subgraphs, Electronic Notesin Discrete Mathematics, IV Latin-American Algorithms, Graphs and OptimizationSymposium  (2007), 30, pp.147–152 . ISSN: 1571-0653.
  • M. Gutierrez, J. Szwarcfiter and S. Tonato. Clique trees of chordal graphs:              Leafage and 3-asteroidal.  Electronic Notes  in Discrete Mathematics,  IV Latin-American Algorithms, Graphs and Optimization  Symposium  (2007),30, (2008), pp 237—242.  ISSN: 1571-0653.
  • P. De Caria and M. Gutierrez, Minimal vertex separadors and new                characterizations for dually chordal graphs.  Electronic Notes  in DiscreteMathematics,  V Latin-  American  Algorithms, Graphs and Optimization  Symposium (2009), 35 , pp 127–132.
  • M. Gutierrez, S. Tondato, Diferencia entre las clase UV y DV,Publicado en las actas del MACI 2009, Congreso de Matemática Aplicada, Computacional e  Industrial, pp 133-136.
  • P. De Caria, M. Gutierrez, Determining possible sets of leaves for spaning              trees of dually chordal  graphs Publicado en las actas del MACI 2009,Congreso de Matemática Aplicada, Computacional e Industrial, pp 153-156.
  • P. De Caria,  M. Gutierrez  Special eccentric vertices for chordal, dually chordal           graphs and   related classes. Publicado en las actas del MACI 2009,           Congreso de Matemática Aplicada,Computacional e  Industrial, pp 157-160.
  •  N. Kepes, L. Alcón, M. Gutierrez, Sobre árboles que son  grafos Loop propios, Publicado en las actas del MACI 2009, Congreso de Matemática Aplicada, Computacional e Industrial, pp 161-163.
  • P. De Caria and M. Gutierrez, Comparing trees characteristic to chordal and             Dually chordal graphs.  Electronic Notes  in Discrete  Mathematics,  VI Latin-American  Algorithms, Graphs and Optimization  Symposium (2011), 37 , pp 33–38.
  • L. Alcon, L. Faria, C. M. H. de Figueiredo, M. Gutierrez, On split clique graphs, Matematica Contemporânea 39, (2010), pp 85-91.
  • L. Alcón, M. Gutiérrez, M. P. Mazzoleni, A necessary condition for EPT-graphs      and   a new family of minimal forbidden, Matematica Contemporânea 39, (2010), pp 111-120.
  • Alcón, M. Gutierrez, M. P. Mazzoleni, On minimal non [h,2,1] graphs,Electronic Notes in Discrete Mathematics,  VII Latin- American  Algorithms, Graphs and Optimization  Symposium (2013), 44, Issue 5,  pp 115-120
  • P. De Caria y M. Gutierrez , Introducing subclasses of basic chordal graphs,               Electronic Notes in Discrete Mathematics , VII Latin- American  Algorithms, Graphs And Optimization  Symposium (2013)44 , pp 287-292.
  • M. Gutierrez , S. Tondato , Special asteroidal on directed path graph non      rooted  path graph, Electronic Notes in Discrete Mathematics VII Latin- AmericanAlgorithms, Graphs And Optimization  Symposium (2013)44, pág. 47–52.
  • Liliana Alcón, Marisa Gutiérrez, María Pía Mazzoleni, EPT graphs on bounded degree trees, Matematica Contemporânea 42, (2014), pp 1-8.
  • M. Gutierrez , S. Tondato, DV-model that can be rooted, MatemáticaContemporânea 42, pp. (2014) 49-58 .
  •    Alcón, N. Gudiño M. Gutierrez , Containment posets of paths in trees,               Electronic Notes in Discrete Mathematics , VIII Latin- American  Algorithms, Graphs  and Optimization  Symposium (2015).
  • Alcón, M. Gutierrez, G. Hulbert , Pebbling in 2-paths, Electronic Notes in Discrete Mathematics , VIII Latin- American  Algorithms, Graphs  and Optimization  Symposium (2015).
  •  L. Alcón, F. Bonomo, G. Durán, M. Gutierrez, M. P. Mazzoleni, B. Ries, M. Valencia- Pabon On the bend number of circular arc graphs as edge   intersection graphs  of paths on a grid, Electronic Notes in Discrete Mathematics , VIII Latin- American  Algorithms, Graphs And Optimization Symposium (2015).
  • L. Alcón, M. Gutiérrez, M. P. Mazzoleni On local edge intersection graphs  of paths on bounded degree trees,  Matematica Contemporânea, en prensa.