PIC

Martín D. Safe

Profesor titular 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. M.D. Safe. Circularly compatible ones, D-circularity, and proper circular-arc bigraphs. SIAM Journal on Discrete Mathematics 35(2), 707–751 (2021).
  2. S. Ombrosi, I.P. Rivera-Ríos y M.D. Safe, Fefferman-Stein inequalities for the Hardy-Littlewood maximal function on the infinite rooted k-ary tree. International Mathematics Research Notices IMRN 2021(4) (2021), 2736–2762.
  3. E. Dratman, L.N. Grippo, M.D. Safe, C.M. da Silva Jr. y R.R. Del-Vecchio. The determinant of the distance matrix of graphs with blocks at most bicyclic. Linear Algebra and its Applications 614 (2021), 437–454.
  4. F. Bonomo, G. Durán, N. Pardal y M.D. Safe. Forbidden induced subgraph characterization of circle graphs within split graphs. Discrete Applied Mathematics (2021), en prensa.
  5. D.A. Rossit, Ó.C. Vásquez, F. Tohmé, M. Frutos y M.D. Safe, A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems. European Journal of Operational Research 289(3) (2021), 841–854.
  6. L.M. González, L.N. Grippo y M.D. Safe. Formulas in connection with parameters related to convexity of paths on three vertices: caterpillars and unit interval graphs. Australasian Journal of Combinatorics 79(3) (2021), 401–423.
  7. M.D. Safe. Characterization and linear-time detection of minimal obstructions to concave-round graphs and the circular-ones property. Journal of Graph Theory 93(2) (2020), 268–298.
  8. G. Durán, M.D. Safe y X.S. Warnes. Neighborhood covering and independence on P4-tidy graphs and tree-cographs. Annals of Operations Research 286(1–2) (2020), 55–86.
  9. D.A. Rossit, F. Tohmé, M. Frutos, M.D. Safe y Ó.C. Vásquez, Critical paths of non-permutation and permutation flow shop scheduling problems. International Journal of Industrial Engineering Computations 11(2) (2020), 281-298.
  10. F. Bonomo, G. Durán, M.D. Safe y A.K. Wagler. On some graph classes related to perfect graphs: A survey. Discrete Applied Mathematics 281 (2020) 42–60.
  11. L.M. González, L.N. Grippo, M.D. Safe y V.F. dos Santos. Covering graphs with convex sets and partitioning graphs into convex sets. Information Processing Letters 158 (2020), 105944.
  12. E.G. Hinrichsen, V.A. Leoni y M.D. Safe. Labelled packing functions in graphs. Information Processing Letters 154 (2020), 105863.
  13. N. Pardal, G. Durán, L.N. Grippo y M.D. Safe. On nested and 2-nested graphs: two subclasses of graphs between threshold and split graphs. Matemática Contemporânea 46 (2019), 119–128.
  14. L.E. Allem, A. Cafure, E. Dratman, L.N. Grippo, M.D. Safe y V. Trevisan. Partial characterization of graphs having a single large Laplacian eigenvalue. The Electronic Journal of Combinatorics 25(4) (2018), #P4.65.
  15. D.A. Jaume, G. Molina, A. Pastine y M.D. Safe. A {-1,0,1}- and sparsest basis for the null space of a forest in optimal time Linear Algebra and its Applications 549 (2018), 53–66.
  16. F. Bonomo, B. Brešar, L.N. Grippo, M. Milanič y M.D. Safe. Domination parameters with number 2: interrelations and algorithmic consequences. Discrete Applied Mathematics 235 (2018), 23–50.
  17. 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 Commun. Math. Comput. Chem. 77(1) (2017), 105–114.
  18. 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.
  19. 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.
  20. 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.
  21. 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.
  22. 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.
  23. 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.
  24. 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.
  25. 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.
  26. 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.
  27. 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.
  28. 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.
  29. 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.
  30. 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. V. Berthé, E. Cesaratto, F. Paccaut, P. Rotondo, M.D. Safe y B. Vallée. Two arithmetical sources and their associated tries. In Proceedings of the 31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA2020), Klagenfurt, Austria. Leibniz International Proceedings in Informatics (LIPIcs) 159 (2020), Article No. 4, 4:1–4:19.
  2. E. Dratman, L.N. Grippo, M.D. Safe, C.M. da Silva Jr. y R.R. Del-Vecchio. Computing the determinant of the distance matrix of a bicyclic graph. In Proceedings of the X Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019), Belo Horizonte, Brasil. Electronic Notes in Theoretical Computer Science 346 (2019), 413–423.
  3. D.A. Rossit, Ó.C. Vásquez, F. Tohmé, M. Frutos y M.D. Safe. The dominance flow shop scheduling problem. En Proceedings of the International Conference 2018 on Applied Combinatorial Optimization (EURO/ALIO 2018), Bolonia, Italia. Electronic Notes in Discrete Mathematics 69 (2018), 21–28.
  4. L.E. Allem, A. Cafure, E. Dratman, L.N. Grippo, M.D. Safe y V. 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.
  5. 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.
  6. 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.
  7. 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.
  8. 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.
  9. 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.
  10. 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.
  11. 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.
  12. F. Bonomo, G. Durán, L.N. Grippo y M.D. Safe. Partial characterizations of circle graphs. En Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW09), del 2 al 4 de junio de 2009, en Paris, Francia, 281–284.
  13. 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.
  14. 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