I hold Ph.D. in the field of Mathematics/Operations Research from the University of Seville (USev), a master’s degree in computational mathematics from the University of Minho, and a degree in Mathematics/Computer Science from the University of Coimbra.
I teach at the Instituto Superior de Engenharia (ISE) of the Universidade do Algarve (UAlg) since 1998 and I'm member NOVA LINCS (https://nova-lincs.di.fct.unl.pt/).
At the management level, he played some administrative positions and committees, such as, director of the eletrical Engineering Department (present), direction and sub direction of the degree course in "Electrical and Computer Engineering" (ISE/UAlg), sub-director of the degree course in "Information and Communication Technologies" (ISE/UAlg), director of the short cycles in "Computer Technologies" and "Information Systems and Technologie"s, or the positions on the Technical and Scientific Council and the Pedagogical Council of the ISE/UAlg.
I've a broad knowledge in the fields of: algorithms and data structures in general, with particular emphasis in the field of machine learning and meta-heuristic; in the management, use, and training in relational and non-relational databases; in the management and use of operating systems, such as Linux and Windows; and several programming languages and technologies.
Over the past years, he has been involved in over a twenty scientific and development projects, (co-)authored more than nighty publications, and is the editor of 9 books [https://orcid.org/0000-0003-4803-7964].
The Erdős number is a measure of the "collaborative distance" between a person and the prolific mathematician Paul Erdős. If you co-authored a paper with Erdős, your Erdős number is 1. If you co-authored a paper with someone who has an Erdős number of 1 (but not Erdős himself), your Erdős number is 2, and so on. It's a way to quantify a person's proximity to Erdős in terms of mathematical collaboration.
So, I'm I'm Erdős - 3 because
I have published with "Marquez Perez, Alberto"
Cardoso, P., Jesus, M., & Márquez, A. (2011). -DANTE: an ant colony oriented depth search procedure. Soft Computing, 15(1), 149-182 (https://link.springer.com/article/10.1007/s00500-010-0543-9)
"Marquez Perez, Alberto" published with OELLERMANN, ORTRUD R.
Cáceres, J., Márquez, A., Oellermann, O. R., & Puertas, M. L. (2005). Rebuilding convex sets in graphs. Discrete Mathematics, 297(1-3), 26-37. (https://www.sciencedirect.com/science/article/pii/S0012365X05002517)
OELLERMANN, ORTRUD R. published with Erdős
Alavi, Y., Boals, A. J., Chartrand, G., Erdos, P., & Oellermann, O. R. (1987). The ascending subgraph decomposition problem. Congressus Numerantium, 58(7), 14. (https://static.renyi.hu/~p_erdos/1987-31.pdf)