Martín Darío Safe

Profesor Titular · Investigador Independiente del CONICET

Afiliación actual. Profesor Titular ordinario con dedicación exclusiva del Departamento de Matemática de la Universidad Nacional del Sur e Investigador Independiente del CONICET, con lugar de trabajo en el Instituto de Matemática de Bahía Blanca (INMABB, UNS-CONICET).

Dirección de investigación. Director —investigador principal— del Proyecto de Grupo de Investigación de la Universidad Nacional del Sur Estructura y Algoritmos en Teoría de Grafos (2024–2027). El proyecto estudia caracterizaciones estructurales de clases de grafos y su aplicación al diseño de algoritmos eficientes. Página institucional del proyecto · Perfil público en CONICET.

Current appointments. Full Professor in the Department of Mathematics at Universidad Nacional del Sur and Independent Researcher at CONICET, based at the Instituto de Matemática de Bahía Blanca (INMABB, UNS-CONICET).

Research leadership. Project Director (principal investigator) of the Universidad Nacional del Sur research project Structure and Algorithms in Graph Theory (2024–2027), focused on structural characterizations of graph classes and their application to efficient algorithms.

Correo institucional / Institutional email: msafe@uns.edu.ar

Intereses

Teoría de Grafos
Optimización Combinatoria

Educación

Doctor de la Universidad de Buenos Aires, Área Ciencias de la Computación, 2011

Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires
Licenciado en Matemática, 2006

Departamento de Matemática, Universidad Nacional del Sur

Perfiles

Scopus

zbMATH

dblp

Artículos

Mitre C. Dourado, Luciano N. Grippo, Martín D. Safe (2023). On the generalized Helly property of hypergraphs, cliques, and bicliques. Discrete Applied Mathematics 330, 56-77.

DOI arXiv

Valérie Berthé, Eda Cesaratto, Pablo Rotondo, Martín D. Safe (2023). Lochs-type theorems beyond positive entropy. Monatshefte für Mathematik (en prensa).

DOI arXiv

Flavia Bonomo-Braberman, Guillermo Durán, Nina Pardal, Martín D. Safe (2022). Forbidden induced subgraph characterization of circle graphs within split graphs. Discrete Applied Mathematics, 323, 43-75.

DOI arXiv

Martín D. Safe (2022). Essential obstacles to Helly circular-arc graphs. Discrete Applied Mathematics 320, 245-258.

DOI arXiv

Guillermo Durán, Nina Pardal, Martín D. Safe (2022). $2$-nested matrices: Towards understanding the structure of circle graphs. Graphs and Combinatorics 38, Article 111.

DOI arXiv

Ezequiel Dratman, Luciano N. Grippo, Martín D. Safe, Celso M. da Silva Jr., Renata R. Del-Vecchio (2021). The determinant of the distance matrix of graphs with blocks at most bicyclic. Linear Algebra and its Applications 614, 437-454.

DOI arXiv

Martín D. Safe (2021). Circularly compatible ones, $D$-circularity, and proper circular-arc bigraphs. SIAM Journal on Discrete Mathematics 35(2), 707–751.

DOI arXiv

Daniel A. Rossit, Óscar C. Vásquez, Fernando Tohmé, Mariano Frutos, Martín D. Safe (2021). A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems. European Journal of Operational Research 289(3), 841-854.

PDF DOI

Sheldy Ombrosi, Israel P. Rivera-Ríos, Martín D. Safe (2021). Fefferman-Stein inequalities for the Hardy-Littlewood maximal function on the infinite rooted k-ary tree. International Mathematics Research Notices IMRN 2021(4), 2736–2762.

DOI arXiv

Lucía M. González, Luciano N. Grippo, Martín D. Safe (2021). Formulas in connection with parameters related to convexity of paths on three vertices: caterpillars and unit interval graphs. Australasian Journal of Combinatorics 79(3), 401–423.

PDF arXiv

Martín D. Safe (2020). Characterization and linear-time detection of minimal obstructions to concave-round graphs and the circular-ones property. Journal of Graph Theory 93(2), 268–298.

DOI arXiv

Flavia Bonomo-Braberman, Guillermo Durán, Martín D. Safe, Annegret K. Wagler (2020). On some graph classes related to perfect graphs: A survey. Discrete Applied Mathematics 281, 42–60.

DOI HAL

Lucía M. González, Luciano N. Grippo, Martín D. Safe, Vinicius F. dos Santos (2020). Covering graphs with convex sets and partitioning graphs into convex sets. Information Processing Letters 158, 105944.

DOI arXiv

Daniel A. Rossit, Fernando Tohmé, Mariano Frutos, Martín D. Safe, Óscar C. Vásquez (2020). Critical paths of non-permutation and permutation flow shop scheduling problems. International Journal of Industrial Engineering Computations 11(2), 281-298.

DOI

Guillermo Durán, Martín D. Safe, Xavier S. Warnes (2020). Neighborhood covering and independence on $P_4$-tidy graphs and tree-cographs. Annals of Operations Research 286, 55–86.

DOI arXiv

Érica G. Hinrichsen, Valeria A. Leoni, Martín D. Safe (2020). Labelled packing functions in graphs. Information Processing Letters 154, 105863.

PDF DOI

L. Emilio Allem, Antonio Cafure, Ezequiel Dratman, Luciano N. Grippo, Martín D. Safe, Vilmar Trevisan (2018). Partial characterization of graphs having a single large Laplacian eigenvalue. The Electronic Journal of Combinatorics 25(4), #P4.65.

DOI arXiv

Daniel A. Jaume, Gonzalo Molina, Adrián Pastine, Martín D. Safe (2018). A $\{-1,0,1\}$- and sparsest basis for the null space of a forest in optimal time. Linear Algebra and its Applications 549, 53–66.

DOI arXiv

Flavia Bonomo, Boŝtjan Brešar, Luciano N. Grippo, Martin Milanič, Martín D. Safe (2018). Domination parameters with number 2: interrelations and algorithmic consequences. Discrete Applied Mathematics 235, 23–50.

DOI arXiv

Antonio Cafure, Daniel A. Jaume, Luciano N. Grippo, Adrián Pastine, Martín D. Safe, Vilmar Trevisan, I. Gutman (2017). Some results for the (signless) Laplacian resolvent. MATCH Communications in Mathematical and in Computer Chemistry 77(1), 105–114.

PDF

Yixin Cao, Luciano N. Grippo, Martín D. Safe (2017). Forbidden induced subgraphs of normal Helly circular-arc graphs: characterization and detection. Discrete Applied Mathematics 216(1), 67–83.

DOI

Flavia Bonomo, Luciano N. Grippo, Martin Milanič, Martín D. Safe (2016). Graph classes with and without powers of bounded clique-width. Discrete Applied Mathematics 199, 3–15.

DOI

Luciano N. Grippo, M. Matamala, Martín D. Safe, Maya Stein (2016). Convex $p$-partitions of bipartite graphs. Theoretical Computer Science 609(2), 511–514.

DOI

Flavia Bonomo, Guillermo Durán, Martín D. Safe, Annegret K. Wagler (2015). Clique-perfectness of complements of line graphs. Discrete Applied Mathematics 186(C), 19–44.

DOI

Flavia Bonomo, Celina M.H. de Figueiredo, Guillermo Durán, Luciano N. Grippo, Martín D. Safe, Jayme L. Szwarcfiter (2015). On probe 2-clique graphs and probe diamond-free graphs. Discrete Mathematics and Theoretical Computer Science 17(1), 187–200.

DOI PDF

Flavia Bonomo, Guillermo Durán, Martín D. Safe, Annegret K. Wagler (2014). Balancedness of subclasses of circular-arc graphs. Discrete Mathematics and Theoretical Computer Science 16(3), 1–22..

DOI PDF

Flavia Bonomo, Guillermo Durán, Martín D. Safe, Annegret K. Wagler (2014). Clique-perfectness and balancedness of some graph classes. International Journal of Computer Mathematics 91(10), 2118–2141.

DOI

Guillermo Durán, Luciano N. Grippo, Martín D. Safe (2014). Structural results on circular-arc graphs and circle graphs: A survey and the main open problems. Discrete Applied Mathematics 164(2), 427–443.

DOI

Flavia Bonomo, Mitre C. Dourado, Guillermo Durán, Luerbio Faria, Luciano N. Grippo, Martín D. Safe (2013). Forbidden subgraphs and the König–Egerváry property. Discrete Applied Mathematics 161(16–17), 2380–2388.

DOI

Flavia Bonomo, Guillermo Durán, Martín D. Safe, Annegret K. Wagler (2013). On minimal forbidden subgraph characterizations of balanced graphs. Discrete Applied Mathematics 161(13–14), 1925–1942.

DOI

Flavia Bonomo, Guillermo Durán, Luciano N. Grippo, Martín D. Safe (2013). Probe interval graphs and probe unit interval graphs on superclasses of cographs. Discrete Mathematics and Theoretical Computer Science 15(2), 177–194.

DOI PDF

Flavia Bonomo, Guillermo Durán, Luciano N. Grippo, Martín D. Safe (2011). Partial characterizations of circle graphs. Discrete Applied Mathematics 159(16), 1699–1706.

DOI

Flavia Bonomo, Guillermo Durán, Luciano N. Grippo, Martín D. Safe (2009). Partial characterizations of circular-arc graphs. Journal of Graph Theory 61(4), 289–306.

DOI

Contacto

msafe@uns.edu.ar
+54 291 459 5101, Int. 3424
Av. Alem 1253, Bahía Blanca, Argentina
Oficina 29 del Área de Matemática y Física