Álvaro Junio Pereira Franco

Álvaro J. Pereira Franco

Professor Adjunto
Departamento de Informática e Estatística
Universidade Federal de Santa Catarina
Florianópolis, Brasil
alvaro.junio@ufsc.br
Horário - 2025.1
+55 48 3721-7548

Research

I am mainly intereted in Graph Theory and Practice, Combinatorial Optimization and Algorithms.
Research projects

Currículo Lattes

Students

(Co-)Supervisor

Felipe Lourenço da Silva - An exact algorithm for the TSP problem with time window and electric vehicle - (IC)
Wesly Carmesini Ataide - Supercolored paths in digraphs - (Co-supervisor Master)

Past

Luiza Bryn Marangoni Guimarães - A solution for a school timetabling problem using mathematical programming - (IC 2024)
Henrique dos Santos Goulart - A state rebalanced strategy to partitioning checkpoints (Co-supervisor Master 2023)
Edmilson Domingues - Using mathematical programming and genetic algorithm to solve the school timetabling problem - (TCC 2023)
Pedro Guimarães Caninas - Infection graphs with constraints - (IC 2023) *
Matheus Leonel Balduino - A travelling salesman problem variant - (TCC 2023)
Eduardo Henke - An implementation of a language with dependent type system - (TCC 2022)
Lucas Henrique Goncalves Wodtke - Optimization in academic management using techniques of integer and linear programming - (TCC 2022)
Thiago Martendal Salvador - Adaptive mesh generation using hash tables - (TCC 2022)
Wesly Carmesini Ataide - Spreading minimization in a topology using mathematical programming - (TCC 2021)
Marcelo Emilio Vendramin - Algorithms for finding chromatic rings in kinship networks - (TCC and Co-supervisor IC 2020)
João Gabriel Trombeta - Partitioning balanced graph analysis to explore parallelism in Parallel Replication State Machine - (Co-supervisor TCC 2020)
Lucas Rodrigo da Silva Suppes - Algorithms and data structures to visualize polygons in real time applications - (TCC 2019)

Published Papers

W.C. Ataide, R. de Santiago, Á.J. Pereira Franco, "Algorithms for super-coloring in directed graphs", Em: Anais do LVI Simpósio Brasileiro de Pesquisa Operacional, 2024 (DOI: 10.59254/sbpo-2024-193367).
P.B. Castellucci, Á.J. Pereira Franco, R. de Santiago, "Soluções factíveis para o problema do caixeiro viajante com veículo elétrico e janelas de tempo", Em: Anais do IX Encontro de Teoria da Computação, 2024 (DOI:10.5753/etc.2024.3034).
H.S. Goulart, J. Trombeta, Á.J. Pereira Franco, O.M. Mendizabal, "Achieving Enhanced Performance Combining Checkpointing and Dynamic State Partitioning", In: 35th IEEE International Symposium on Computer Architecture and High Performance Computing, 2023 (DOI:10.1109/sbac-pad59825.2023.00024).
P.G. Caninas, P.C. Calegari, Á.J. Pereira Franco, "Um estudo sobre árvores geradoras como alternativas conexas para o controle de doença em um grafo de infecção", Em: Anais do LV Simpósio Brasileiro de Pesquisa Operacional, 2023 (DOI:10.59254/sbpo-2023-175142).
H.S. Goulart, Á.J. Pereira Franco, O.M. Mendizabal, "Checkpointing Techniques in Distributed Systems: A Synopsis of Diverse Strategies Over the Last Decades", In: Anais do XXIV Workshop de Testes e Tolerância a Falhas, 2023 (DOI:10.5753/wtf.2023.785)
W.C. Ataide; P.B. Castellucci; Á.J. Pereira Franco; R. de Santiago, "Minimizing Infection in a Topology using Mathematical Programming", Em: Anais do VII Encontro de Teoria da Computação, 2022 (DOI:10.5753/etc.2022.223209).
Á.J. Pereira Franco and M.E. Vendramin, "Uma experiência com redes de parentesco totalmente coloridas", Em: REACT - VIII Reunião de Antropologia da Ciência e da Tecnologia, 2022 (OJS:v5.n5).
P.C. Calegari and Á.J. Pereira Franco, "Geração de malhas com refinamento adaptativo usando tabelas de dispersão", Em: CNMAC - Congresso Nacional de Matemática Aplicada e Computacional, 2021 (DOI:10.5540/03.2021.008.01.0421).
Á.J. Pereira Franco and M.E. Vendramin, "Super-colored paths in digraphs", Em: Anais do VI Encontro de Teoria da Computação, 2021 (DOI:10.5753/etc.2021.16389).
Á.J. Pereira Franco, "Epidemic models with restricted circulation and social distancing on some network topologies", In: ACRI - Cellular Automata for Research and Industry, 2021 (DOI:10.1007/978-3-030-69480-7_26).
G.A. Domene, ÁJ. Pereira Franco and G. E. de Oliveira, "Atribuição de salas para disciplinas com demanda e horários fixos", Em: SBPO - Simpósio Brasileiro de Pesquisa Operacional, 2020 (DOI:10.59254/sbpo-2020-122626).
C. Paulino, and Á.J. Pereira Franco "The Kraho Empiric Network: an exercise in modelling", In: 18th IUAES World Congress, 2018 (ISBN: 978-85-62946-96-7).
C.E. Ferreira, and Á.J. Pereira Franco "A min-max relation in flowgraphs and some applications", Discrete Applied Mathematics, 2018 (DOI:10.1016/j.dam.2017.04.038).
C.G. Fernandes, C.E. Ferreira, Á.J. Pereira Franco, and R.C.S. Schouery, "The Envy-Free Pricing Problem, Unit-Demand Markets and Connections with the Network Pricing Problem", Discrete Optimization, 2016 (DOI:10.1016/j.disopt.2015.09.003).
C.E. Ferreira and Á.J. Pereira Franco, "A min-max relation in flowgraphs", In: LAGOS'15 -- VIII Latin-American Algorithms, Graphs and Optimization Symposium. Electronic Notes in Discrete Mathematics, 2015, 50, pp.109-114 (DOI:10.1016/j.endm.2015.07.019).
C.E. Ferreira, Á.J. Pereira Franco, and M.F. da Silva, "Finding Matrimonial Circuits in some Amerindian Kinship Networks: an Experimental Study", In: 10th IEEE International Conference on e-Science, 2014 (DOI:10.1109/eScience.2014.12).
C.G. Fernandes, C.E. Ferreira, Á.J. Pereira Franco, and R.C.S. Schouery, "The Envy-Free Pricing Problem and Unit-Demand Markets", In: 3rd International Symposium on Combinatorial Optimization (ISCO). (Org.). Lecture Notes in Computer Science. 1ed.: Springer Berlin Heidelberg, 2014, p. 707-718 (DOI:10.1007/978-3-319-09174-7_20).
C.E. Ferreira, and Á.J. Pereira Franco, "Algorithms for Junctions in Acyclic Digraphs", In: Michael Jünger; Gerhard Reinelt. (Org.). Facets of Combinatorial Optimization. 1ed.Berlin Heidlberg: Springer Berlin Heidelberg, 2013, p. 175-194 (DOI:10.1007/978-3-642-38189-8_8).

Technical report

Á.J. Pereira Franco and G.E. de Oliveira, "Uma Apresentação Sucinta do Sistema de Criptografia RSA", 2016 (pdf).

Papers in preparation

"Epidemiological model on networks". Join work with Priscila C. Calegari.
"The kinship as a computational question" (pdf - preliminary version). Join work with C. E. Ferreira e M. F. Silva, M. Teixeira-Pinto.

Tools

Windowing Query: a library to find lines in windows.

Kinhsip Machine: a tool used to find rings in kinship networks.
You can download the Kinship Machine (Version 1.0):

Source code (General Public License - GPL); or
Binary code for Windows (Vista or 7)

Classroom Assignment - UFSC: a tool to assign courses to classrooms (access only for UFSC members).
Join work with Gabriel A. Domene and Gabriel E. de Oliveira

Mesh Generator: a tool to generate meshes in the plane.
Join work with Priscila C. Calegari

Epidemic Models: Python (3.7.3 version) implementations of SIS and SIR models on networks.
Join work with Priscila C. Calegari

Non-Linear Optimization Model for Infection Graph Problem: a tool using SCIP and JuMP to solve an Infection Graph Problem.
Join work with Wesly C. Ataide, Pedro B. Castellucci and Rafael de Santiago

Generator Trees and Infection Graphs a tool which finds generator trees as a connected alternative to infection graphs.
Join work with Pedro G. Caninas and Priscila C. Calegari

Timetabling Problem and Santa Catarina Schools: a tool using Gurobi and a genetic algorithm to solve a Timetabling Problem in Santa Catarina Schools.
Join work with Edmilson Domingues

Miscellaneous

Álvaro Junio Pereira Franco
Sala 411 INE-UFSC
e-mail: alvaro.junio@ufsc.br