PIC

Martín D. Safe

Profesor asociado con dedicación exclusiva
Departamento de Matemática, Universidad Nacional del Sur

Contacto

Oficina 29 (Área de Matemática y Física), Av. Alem 1253, 8000 Bahía Blanca, Argentina
Correo electrónico: msafe@uns.edu.ar
Tel.: +54 291 459 5101, Int. 3424

Áreas de Investigación

Teoría de Grafos y Optimización Combinatoria

 
Estudios

 
Publicaciones

Prepublicaciones

Publicaciones en revistas

  1. G. Durán, M.D. Safe y X.S. Warnes. Neighborhood covering and independence on P4-tidy graphs and tree-cographs. Aceptado en Annals of Operations Research (2017).
  2. F. Bonomo, B. Brešar, L.N. Grippo, M. Milanič y M.D. Safe. Domination parameters with number 2: interrelations and algorithmic consequences. En prensa en Discrete Applied Mathematics (2017).
  3. Y. Cao, L.N. Grippo y M.D. Safe. Forbidden induced subgraphs of normal Helly circular-arc graphs: characterization and detection. Discrete Applied Mathematics 216(1) (2017), 67–83.
  4. A. Cafure, D.A. Jaume, L.N. Grippo, A. Pastine, M.D. Safe, V. Trevisan e I. Gutman. Some results for the (signless) Laplacian resolvent. MATCH Communications in Mathematical and in Computer Chemistry 77(1) (2017), 105–114.
  5. F. Bonomo, L.N. Grippo, M. Milanič y M.D. Safe. Graph classes with and without powers of bounded clique-width. Discrete Applied Mathematics 199 (2016), 3–15.
  6. L.N. Grippo, M. Matamala, M.D. Safe y M.J. Stein. Convex p-partitions of bipartite graphs. Theoretical Computer Science 609(2) (2016), 511–514.
  7. F. Bonomo, C.M.H. de Figueiredo, G. Durán, L.N. Grippo, M.D. Safe y J.L. Szwarcfiter. On probe 2-clique and probe diamond-free graphs. Discrete Mathematics and Theoretical Computer Science 17(1) (2015), 187–200.
  8. F. Bonomo, G. Durán, M.D. Safe y A.K. Wagler. Clique-perfectness of complements of line graphs. Discrete Applied Mathematics 186(C) (2015), 19–44.
  9. F. Bonomo, G. Durán, M.D. Safe y A.K. Wagler. Balancedness of subclasses of circular-arc graphs. Discrete Mathematics and Theoretical Computer Science 16(3) (2014), 1–22.
  10. F. Bonomo, G. Durán, M.D. Safe y A.K. Wagler. Clique-perfectness and balancedness of some graph classes. International Journal of Computer Mathematics 91(10) (2014), 2118–2141.
  11. G. Durán, L.N. Grippo y M.D. Safe. Structural results on circular-arc graphs and circle graphs: A survey and the main open problems. Discrete Applied Mathematics 164(2) (2014), 427–443.
  12. F. Bonomo, M.C. Dourado, G. Durán, L. Faria, L.N. Grippo y M.D. Safe. Forbidden subgraphs and the König–Egerváry property. Discrete Applied Mathematics 161(16–17) (2013), 2380–2388.
  13. F. Bonomo, G. Durán, L.N. Grippo y M.D. Safe. Probe interval graphs and probe unit interval graphs on superclasses of cographs. Discrete Mathematics and Theoretical Computer Science 15(2) (2013), 177–194.
  14. F. Bonomo, G. Durán, M.D. Safe y A.K. Wagler. On minimal forbidden subgraph characterizations of balanced graphs. Discrete Applied Mathematics 161(13–14) (2013), 1925–1942.
  15. F. Bonomo, G. Durán, L.N. Grippo y M.D. Safe. Partial characterizations of circle graphs. Discrete Applied Mathematics 159(16) (2011), 1699–1706.
  16. F. Bonomo, G. Durán, L.N. Grippo y M.D. Safe. Partial characterizations of circular-arc graphs. Journal of Graph Theory 61(4) (2009), 289–306.

Publicaciones en actas de reuniones científicas con referato

  1. L.E. Allem, A. Cafure, E. Dratman, L.N. Grippo, M.D. Safe y Vilmar Trevisan. On graphs with a single large Laplacian eigenvalue. En Proceedings of the IX Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2017), Marsella, Francia. Electronic Notes in Discrete Mathematics 62 (2017), 297–302.
  2. M. Dourado, L.N. Grippo y M.D. Safe. On the hereditary (p,q)-Helly property of hypergraphs, cliques, and bicliques. En Proceedings of the VIII Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2015), Praia das Fontes, Beberibe, Ceará, Brasil. Electronic Notes in Discrete Mathematics 50 (2015), 361–366.
  3. L.N. Grippo y M.D. Safe. On circular-arc graphs having a model with no three arcs covering the circle. En Anales del XVI Congreso Latino-Iberoamericano de Investigación Operativa y el XLIV Simpósio Brasileiro de Pesquisa Operacional (CLAIO/SBPO 2012), Río de Janeiro, Brasil. Anais do XLIV Simpósio Brasileiro de Pesquisa Operacional, SOBRAPO (2012), 4093–4104.
  4. F. Bonomo, G. Durán, M.D. Safe y A.K. Wagler. Clique-perfectness of complements of line graphs. En Proceedings of the VI Latin-American Algorithms, Graphs, and Optimization Symposium (LAGOS 2011), Bariloche, Argentina. Electronic Notes in Discrete Mathematics 37 (2011), 327–332. (Versión completa publicada en Discrete Applied Mathematics.)
  5. G. Durán, L.N. Grippo y M.D. Safe. Probe interval and probe unit interval graphs on superclasses of cographs. En Proceedings of the VI Latin-American Algorithms, Graphs, and Optimization Symposium (LAGOS 2011), Bariloche, Argentina. Electronic Notes in Discrete Mathematics 37 (2011), 339–344. (Versión completa publicada en Discrete Mathematics and Theoretical Computer Science.)
  6. M.C. Dourado, G. Durán, L. Faria, L.N. Grippo y M.D. Safe. Forbidden subgraphs and the König property. En Proceedings of the VI Latin-American Algorithms, Graphs, and Optimization Symposium (LAGOS 2011), Bariloche, Argentina. Electronic Notes in Discrete Mathematics 37 (2011), 333–338. (Versión completa publicada en Discrete Applied Mathematics.)
  7. F. Bonomo, G. Durán, M.D. Safe y A.K. Wagler. Balancedness of some subclasses of circular-arc graphs. En Proceedings of the International Symposium on Combinatorial Optimization (ISCO 2010), Hammamet, Túnez. Electronic Notes in Discrete Mathematics 36 (2010), 1121–1128. (Versión completa publicada en Discrete Mathematics and Theoretical Computer Science.)
  8. F. Bonomo, G. Durán, M.D. Safe y A.K. Wagler. On minimal forbidden subgraph characterizations of balanced graphs. En Proceedings of the V Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2009), Gramado, Brasil. Electronic Notes in Discrete Mathematics 35 (2009), 41–46. (Versión completa publicada en Discrete Applied Mathematics.)
  9. F. Bonomo, G. Durán, L.N. Grippo y M.D. Safe. Partial characterizations of circle graphs. En Proceedings of 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW09), del 2 al 4 de junio de 2009, en Paris, Francia, 281–284. (Versión completa publicada en Discrete Applied Mathematics.)
  10. F. Bonomo, G. Durán, L.N. Grippo y M.D. Safe. Partial characterizations of circular-arc graphs. En Proceedings of the IV Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2007), Puerto Varas, Chile. Electronic Notes in Discrete Mathematics 30 (2008), 45–50. (Versión completa publicada en Journal of Graph Theory.)
  11. M.D. Safe, J.A. Carballido, I. Ponzoni y N.B. Brignole. On stopping criteria for genetic algorithms. En Proceedings of the 17th Brazilian Symposium on Artificial Intelligence (SBIA 2004), São Luís, Maranhão, Brasil. Lecture Notes in Artificial Intelligence (subserie de Lecture Notes in Computer Science) 3171 (2004), 405–413.

Tesis doctoral

 
Tesistas