Program - Thursday

9:30-10:30Sebastian Cioabă - Chair: Gabriel Coutinho
10:30-10:50Break
SessionClassification and meta-heuristics - Chair: Thiago NoronhaSpectral graph theory - Chair: Nair Abreu
10:50-11:15Ricardo Corrêa, Manuela Blaum, Javier Marenco, Ivo Koch and Marcelo Mydlarz: An integer programming approach for the 2-class single-group classification problemEzequiel Dratman, Luciano N. Grippo, Martín D. Safe, Celso M. Da Silva Jr. and Renata R. Del-Vecchio: Computing the determinant of the distance matrix of a bicyclic graph
11:15-11:40Paulo Henrique Macêdo De Araújo, Manoel Campêlo, Ricardo C. Corrêa and Martine Labbé: The Geodesic Classification Problem on GraphsMarcel de Carli Silva, Gabriel Coutinho, Chris Godsil and David Roberson: Algebras, graphs and thetas
11:40-12:05Ana Paula dos Santos Dantas, Cid Carvalho de Souza and Zanoni Dias: A GRASP for the Convex Recoloring Problem in GraphsAndre Ebling Brondani, Carla Silva Oliveira, Francisca Andrea Macedo França and Leonardo De Lima: Aα-Spectrum of a firefly Graph
12:05-12:30Alexandre Frias Faria, Sergio Ricardo De Souza, Elisangela Martins de Sá and Carlos Alexandre Silva: Variable Neighborhood Descent Branching applied to the Multi-Way Number Partitioning ProblemGabriel Coutinho, Rafael Grandsire and Célio Passos: Colouring the normalized Laplacian
12:30-14:30Lunch
14:30-15:30Vilmar Trevisan - Chair: Carlos Hoppen
SessionOptimization I - Manoel CampêloColorings II - Chair: Chinh Hoang
15:30-15:55Ivo Koch and Javier Marenco: The 2D subarray polytopeC. A. Weffort-Santos, C. N. Campos and R. C. S. Schouery: On the complexity of gap-[2]-vertex-labellings of subcubic bipartite graphs
15:55-16:20Mónica Braga and Javier Marenco: Facet-generating procedures for the maximum-impact coloring polytopeCamila Araujo, Julio Araujo, Ana Silva and Alexandre Cezar: Backbone Coloring of Graphs with Galaxy Backbones
16:20-16:45Silvia Bianchi, Graciela Nasini, Paola Tolomei and Luis M Torres: Circuits and circulant minorsLuis Gustavo Da Soledade Gonzaga and Sheila Morais de Almeida: Sigma Coloring on Powers of Paths and Some Families of Snarks
16:45-17:15Coffee Break
17:15-18:15Karen Aardal - Chair: Sebastián Urrutia
SessionOptimization II - Chair: Ivo KochIdentifying codes and locating dominating sets - Chair: Fernanda Couto
18:15-18:40Fabio Abe, Edna Hoshino, Alessandro Hill and Roberto Baldacci: A branch-and-price algorithm for the ring tree facility location problemMárcia Cappelle, Erika Morais Martins Coelho, Leslie Foulds and Humberto Longo: Open-independent, open-locating-dominating sets in complementary prism graphs
18:40-19:05Mauro Lucci, Graciela Nasini and Daniel Severin: A Branch and Price Algorithm for List Coloring ProblemSilvia Bianchi, Gabriela Argiroffo, Yanina Lucarini and Annegret Wagler: The identifying code, the locating-dominating, the open locating-dominating and the locating total-dominating problems under some graph operations
19:05-19:30Luiz Alberto Do Carmo Viana and Manoel Campelo: The Generalized Dependency Constrained Spanning Tree ProblemMárcia Cappelle, Erika Coelho, Hebert Coelho, Lucia Penso and Dieter Rautenbach: Identifying Codes in the Complementary Prism of Cycles
19:30Conference Dinner + Dancing Presentation: Quadrilha Jiló com Mel