On stopping criteria for genetic algorithms M Safe, J Carballido, I Ponzoni, N Brignole
Advances in Artificial Intelligence–SBIA 2004: 17th Brazilian Symposium on …, 2004
221 2004 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
28 2014 Partial characterizations of circular‐arc graphs F Bonomo, G Durán, LN Grippo, MD Safe
Journal of Graph Theory 61 (4), 289-306, 2009
27 2009 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
24 2018 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
20 2016 Some results for the (signless) Laplacian resolvent AA Cafure, DA Jaume, LN Grippo, AG Pastine, MD Safe, V Trevisan, ...
University of Kragujevac, 2017
17 2017 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
15 2021 Clique-perfectness of complements of line graphs F Bonomo, G Durán, MD Safe, AK Wagler
Discrete Applied Mathematics 186, 19-44, 2015
15 * 2015 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
15 2013 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
14 2017 Partial characterizations of circle graphs F Bonomo, G Durán, LN Grippo, MD Safe
Discrete applied mathematics 159 (16), 1699-1706, 2011
12 2011 Convex p-partitions of bipartite graphs LN Grippo, M Matamala, MD Safe, MJ Stein
Theoretical Computer Science 609, 511-514, 2016
11 2016 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
10 2020 Fefferman–Stein Inequalities for the Hardy–Littlewood Maximal Function on the Infinite Rooted k -ary Tree S Ombrosi, IP Rivera-Ríos, MD Safe
International Mathematics Research Notices 2021 (4), 2736-2762, 2021
9 2021 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
9 * 2009 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
8 2018 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
7 2020 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
6 2010 Circularly Compatible Ones, MD Safe
SIAM Journal on Discrete Mathematics 35 (2), 707-751, 2021
5 2021 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
5 2019 
Luciano N. GrippoUniversidad Nacional de General Sarmiento - CONICETAdresă de e-mail confirmată pe campus.ungs.edu.ar
