Algorithms, Combinatorics and Optimization

Algorithms are the most fundamental concept of Computer Science. His study refers to basic theories such as Computational Complexity and Computability. On the other hand, the design of algorithms, accompanied by all its paradigms – sequential, parallel, distributed, randomized, approximate, quantum algorithms, among others – allows the application of the computer in solving problems in the most diverse fields of knowledge. In this project, the concept of algorithm is investigated in all its dimensions, from basic research in computational complexity and algorithm design paradigms to applied research aiming at the development of algorithms in areas such as Bioinformatics, Computational Geometry and Spectral Theory of Graphs.

As an essential tool for the development of algorithms, combinatorial mathematics and optimization are investigated. With regard to combinatorial mathematics, the development of data structures that support the execution of efficient algorithms is sought, as well as in search of greater understanding regarding fundamental combinatorial problems and those related to Graph Theory. In terms of optimization, the aim is to conceive and apply techniques for solving problems using linear, non-linear, whole or mixed programming models (exact and / or heuristic methods), as well as bio- inspired as an ant colony, genetic algorithms, particle swarm.

Researchers:

• Diego Haddad
• Laura Silva de Assis
• Leonardo Lima
• Pedro Henrique Gonzalez (Coordinator)

International partnerships:

• Ali Mohammadian (Anhui University, Hefei, China);
• Gilles Caporossi (GERAD, University of Montreal);
• Paula Carvalho and Paula Rama (University of Aveiro, Portugal)
• Philippe Michelon (Université d’Avignon et des Pays de Vaucluse, France)
• Saieed Akbari (Sharif University, Iran);
• Vladimir Nikiforov (University of Memphis, USA);

Financial Information:

1. CNPq Universal announcement, project “Problems in Spectral Theory of Graphs and applications in Complex Networks”, in the period 2012-2015, with the coordination of Professor Leonardo Lima. Financed amount: R$ 22,300.00.
2. Public Notice FAPERJ Young Scientist of Our State, project “Matrices in Spectral Theory of Graphs: theory and applications”, in the period 2013-2016, with the coordination of Professor Leonardo Lima. Financed amount: R$ 75,600.00.
3. APP-CAMPI notice from CEFET / RJ, project “Optimized Management of Wireless Mesh Networks and Server Clusters for the Development of Ubiquitous and Pervasive Applications, in the 2015 period, with the coordination of Professor Laura Assis. Financed amount: R$ 15,000.00.
4. CNPq publicity grant for productivity, project “The Algebraic Theory of Graphs and Applications”, in the 2015-2018 period, coordinated by Professor Leonardo Lima. Financed amount: R$ 39,600.00;
5. Edital FAPERJ / APQ1, project “Monitoring Systems Applied to Wireless Sensor Networks”, in the period 2016-2018, with the coordination of Professor Laura Assis. Financed amount: R$ 10,000.00.
6. FAPERJ Notice Installation aid, project “Systems Monitoring Applied to Wireless Sensor Networks”, in the 2016-Current period, with the coordination of Professor Laura Assis. Financed amount R$ 12,000.00.
7. CNPq Universal announcement, project “Development and Analysis of Adaptive and Distributed Signal Processing Algorithms”, in the period 2016-2018, with the coordination of Professor Diego Haddad. Financed amount R$ 32,000.00.
8. Notice FAPERJ / APQ1-2019, entitled “Advanced Stochastic Analysis of Adaptive Filtering Algorithms”, in the 2019-current period, with the coordination of Professor Diego Barreto Haddad. Financed amount R$ 38,000.00.
9. Edital CNPq productivity grant, project “Study in Algebraic Theory of Graphs”, in the 2019-Current period, coordinated by Professor Leonardo Lima. Financed amount: R$ 39,600.00;
10. PIBIC Scholarships.

These projects have been under development by the group members since 2013 and total a financing amount of approximately R$ 284,100.00.