Seguir
Martín D. Safe
Martín D. Safe
Departamento de Matemática, Universidad Nacional del Sur & INMABBB (UNS-CONICET)
Dirección de correo verificada de uns.edu.ar - Página principal
Título
Citado por
Citado por
Año
On stopping criteria for genetic algorithms
M Safe, J Carballido, I Ponzoni, N Brignole
Brazilian Symposium on Artificial Intelligence, 405-413, 2004
1982004
Partial characterizations of circular‐arc graphs
F Bonomo, G Durán, LN Grippo, MD Safe
Journal of Graph Theory 61 (4), 289-306, 2009
242009
Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
G Durán, LN Grippo, MD Safe
Discrete Applied Mathematics 164, 427-443, 2014
232014
Graph classes with and without powers of bounded clique-width
F Bonomo, LN Grippo, M Milanič, MD Safe
Discrete Applied Mathematics 199, 3-15, 2016
222016
Domination parameters with number 2: interrelations and algorithmic consequences
F Bonomo, B Brešar, LN Grippo, M Milanič, MD Safe
Discrete Applied Mathematics 235, 23-50, 2018
172018
Some results for the (signless) Laplacian resolvent
AA Cafure, DA Jaume, LN Grippo, AG Pastine, MD Safe, V Trevisan, ...
University of Kragujevac, 2017
152017
Forbidden subgraphs and the König–Egerváry property
F Bonomo, MC Dourado, G Durán, L Faria, LN Grippo, MD Safe
Discrete Applied Mathematics 161 (16-17), 2380-2388, 2013
132013
Forbidden induced subgraphs of normal Helly circular-arc graphs: Characterization and detection
Y Cao, LN Grippo, MD Safe
Discrete Applied Mathematics 216, 67-83, 2017
112017
Convex p-partitions of bipartite graphs
LN Grippo, M Matamala, MD Safe, MJ Stein
Theoretical Computer Science 609, 511-514, 2016
112016
Clique-perfectness of complements of line graphs
F Bonomo, G Durán, MD Safe, AK Wagler
Discrete Applied Mathematics 186, 19-44, 2015
11*2015
Partial characterizations of circle graphs
F Bonomo, G Durán, LN Grippo, MD Safe
Discrete applied mathematics 159 (16), 1699-1706, 2011
112011
Characterization and linear‐time detection of minimal obstructions to concave‐round graphs and the circular‐ones property
MD Safe
Journal of Graph Theory 93 (2), 268-298, 2020
82020
The dominance flow shop scheduling problem
DA Rossit, ÓC Vásquez, F Tohmé, M Frutos, MD Safe
Electronic Notes in Discrete Mathematics 69, 21-28, 2018
82018
A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems
DA Rossit, ÓC Vásquez, F Tohmé, M Frutos, MD Safe
European Journal of Operational Research 289 (3), 841-854, 2021
72021
On minimal forbidden subgraph characterizations of balanced graphs
F Bonomo, G Durán, MD Safe, AK Wagler
Electronic Notes in Discrete Mathematics 35, 41-46, 2009
7*2009
Critical paths of non-permutation and permutation flow shop scheduling problems
D Rossit, F Tohme, M Frutos, M Safe
International Journal of Industrial Engineering Computations 11 (2), 281-298, 2020
62020
Balancedness of some subclasses of circular-arc graphs
F Bonomo, G Durán, MD Safe, AK Wagler
Electronic Notes in Discrete Mathematics 36, 1121-1128, 2010
62010
On stopping criteria for genetic algorithms Advances in Artificial Intelligence–SBIA 2004 (pp. 405-413)
M Safe, J Carballido, I Ponzoni, N Brignole
Springer, 2004
52004
On nested and 2-nested graphs: two subclasses of graphs between threshold and split graphs
N Pardal, GA Durán, LN Grippo, MD Safe
arXiv preprint arXiv:1906.11970, 2019
42019
On circular-arc graphs having a model with no three arcs covering the circle
LN Grippo, MD Safe
arXiv preprint arXiv:1402.2641, 2014
42014
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20