Conference Program

20:00Welcome Ceremony
20:30Welcome Cocktail
7:00-7:30Breakfast
8:30–9:20Plenary Talk - Room Cavalhadas/Pastorinhas
Cliques in Parameterized Hardness
Michael R. Fellows
09:20–10:35Cliques and Bicliques I - Room Cavalhadas/Pastorinhas
Partitioning Distance Hereditary Graphs into stable sets and cliques
João Thompson, Loana Nogueira, Fábio Protti, Raquel Bravo

Disimplicial arcs, transitive vertices, and disimplicial eliminations
Martiniano Eguía, Francisco J. Soulignac

Experimental Analysis of Exact Algorithms for the Maximum Clique Problem
Cleverson Sebastião dos Anjos, Alexandre Prusch Züge, Renato Carmo
09:20–10:35Complexity and Algorithms I - Room Ita e Alaor
Reversible Processes on Graphs
Mitre C. Dourado, Carlos V. G. C. Lima, Jayme L. Szwarcfiter

On the complexity of the Cluster Deletion problem for several graph classe
Flavia Bonomo, Guillermo Durán, Mario Valencia-Pabon

Approximative algorithms for the maxcut of chordal graphs
Luerbio Faria, Rubens Sucupira, Sulamita Klein
10:35-11:00Coffee Break
11:00-12:15Coloring I - Room Cavalhadas/Pastorinhas
Distance coloring problems, spatial properties and feasibility conditions
Rosiane de Freitas, Bruno Raphael Dias, Jayme L. Szwarfiter

Choosability for restricted list coloring problems
Rosiane de Freitas, Simone Santos, Flavio Coelho, Mario Salvatierra

Acyclic edge coloring of the complete bipartite graph K2p,2p
Natacha Astromujoff, Martín Matamala
11:00-12:15Graph classes I - Room Ita e Alaor
Forbidden subgraph characterization of star directed path graphs that are not rooted directed path graphs
M. Gutierrez, S. Tondato

On the class [h; 2; 2] local
L. Alcón, M. Gutierrez, M. P. Mazzoleni

On Restricted Multi-break Rearrangement and Sorting Separable Permutations
Luís F. I. Cunha, Rodrigo de A. Hausen, Luis A. B. Kowada, Celina M. H. de Figueiredo
12:15-14:00Lunch
14:00–14:50Plenary Talk - Room Cavalhadas/Pastorinhas
On the b-continuity of graphs
Márcia R. Cerioli
15:00–17:45Optional tour: waterfall or Pirenópolis historical center
20:00-22:00Dinner
7:00-7:30Breakfast
8:30–9:20Plenary Talk - Room Cavalhadas/Pastorinhas
Cliques, Coloring and Satisfiability: from structure to algorithms
Vadim Lozin
09:20–10:35Convexity - Room Cavalhadas/Pastorinhas
Periphery and convexity of a graph
Danilo Artigas, Simone Dantas, Mitre C. Dourado, Jayme L. Szwarcfiter

On the l-neighborhood convexity
Carmen C. Centeno, Erika M. M. Coelho, Mitre C. Dourado, Jayme L. Szwarcfiter

A tight upper bound for the Helly number of the geodetic convexity on bipartite graphs
Mitre Costa Dourado, Aline Rodrigues da Silva
09:20–10:35Applications - Room Ita e Alaor
On the diameter of the Cayley Graph Hl,p
André C. Ribeiro, Diane Castonguay, Luis Antonio B. Kowada, Celina M. H. Figueiredo

Grafos de Permutação Redutíveis Canônicos: caracterização, reconhecimento e aplicações a marcas d'água digitais
Lucila Maria de Souza Bento, Davidson Rodrigo Boccardo, Raphael Carlos Santos Machado, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter

Sistemas modulares de dígitos verificadores ótimos
Natália Pedroza de Souza, Paulo Eustáquio Duarte Pinto, Luerbio Faria
10:35-11:00Coffee Break
11:00-12:15Cliques and Bicliques II - Room Cavalhadas/Pastorinhas
The Biclique Graph of some classes of graphs II
Marina Groshaus, André L. P. Guedes, Juan Pablo Puppo

Maximum Clique via MaxSat and Back Again
Alexandre Prusch Züge, Renato Carmo

Clique and neighborhood characterizations of strongly chordal graphs
Pablo De Caria, Terry McKee
11:00-12:15Coloring II - Room Ita e Alaor
AVD-total-colouring of some families of snarks
Atílio Gomes Luiz, C. N. Campos, C. P. de Mello

The Total Coloring of the 3rd and 4th Powers of Cycles
S. M. Almeida, J. T. Belotti, M. M. Omai, J. F. H. Brim

Complexity of the oriented coloring in planar, cubic oriented graphs
Hebert Coelho, Luerbio Faria, Sylvain Gravier, Sulamita Klein
12:15-14:00Lunch
14:00–14:50Plenary Talk - Room Cavalhadas/Pastorinhas
A characterization of PM-compact bipartite and near-bipartite graphs
Cláudio Lucchesi
14:50-16:05Complexity and Algorithms II - Room Cavalhadas/Pastorinhas
Total coloring of snarks is NP-complete
Vinícius F. dos Santos, Diana Sasaki

Complexity between Domination, Independent, Connected, and Paired Domination Numbers
Simone Dantas, José D. Alvarado, Dieter Rautenbach

Aliança Global Ofensiva em Alguns Produtos Lexicográficos em Grafos
Rommel Melgaço Barbosa, Mitre Costa Dourado, Leila Roling Scariot da Silva
14:50-16:05Combinatorial games and partition - Room Ita e Alaor
The Burning of the Snarks
Simone Dantas, Vitor Costa, Dieter Rautenbach

Timber Game with Caterpillars
A. Furtado, S. Dantas, C. de Figueiredo, S. Gravier

O problema da partição em cliques dominantes
H. V. Sousa, Christiane N. Campos
16:05-16:30Coffee Break
16:30-17:45Posets and Cycles - Room Cavalhadas/Pastorinhas
Sobre posets representables mediante contencion de caminos en un arbol
L. Alcón, N. Gudiño, M. Gutierrez

Kneser Graphs are Close to Being Hamiltonian
Felipe de Campos Mesquita, Letícia Rodrigues Bueno, Rodrigo de Alencar Hausen

Hamiltonian Cycles in 4-Connected 4-Regular Claw-free Graphs
Jorge L. B. Pucohuaranga, Letícia R. Bueno, Daniel M. Martin, Simone Dantas
16:30-17:45Graph Classes II - Room Ita e Alaor
Laplacian energy of special families of threshold graphs
R. R. Del-Vecchio, C. T. M. Vinagre, G. B. Pereira

Adjacent Strong Edge-Coloring of Split-indiference Graphs
Aloísio de Menezes Vilas-Bôas, Célia Picinin de Mello

Maximal Independent sets in cylindrical grid graphs
Rommel M. Barbosa, Márcia R. Cappelle
20:00-00:00Special Dinner
7:00-7:30Breakfast
8:30–9:20Plenary Talk - Room Cavalhadas/Pastorinhas
Editing to Cliques: A Survey of FPT Results and Recent Applications in Analyzing Large Datasets
Frances Rosamond
09:20–10:35Cliques and Bicliques III - Room Cavalhadas/Pastorinhas
On the generalized Helly property of hypergraphs and maximal cliques and bicliques
Mitre C. Dourado, Luciano N. Grippo, Martín D. Safe

The Clique Problem parameterized by the degeneracy of a graph
Jonilso Novacoski, Renato Carmo

Vizinhança Mínima no Hipercubo
Moysés da Silva Sampaio Júnior, Paulo Eustáquio Duarte Pinto, Luerbio Faria
09:20–10:35Complexity and Algorithms III - Room Ita e Alaor
Enumeration of chordless cycles
Diane Castonguay, Elisângela Silva Dias, Walid Abdala Rfaei Jradi, Humberto Longo

Algoritmos certificadores e verificadores: testemunhas ausentes e provas computacionais
Anne Rose Alves Federici Marinho, Vinícius Gusmão Pereira de Sá

Solving the k-in-a-tree problem for chordal graphs
Vinícius F. dos Santos, Murilo V. G. da Silva, Jayme L. Szwarfiter
10:35-11:00Coffee Break
11:00-12:15Graph Classes III - Room Cavalhadas/Pastorinhas
Minimal 4 × 4 M-obstruction cographs
Raquel S. F. Bravo, Loana T. Nogueira, Fábio Protti, Jeane Leite

Remarks on Complementary Prisms
Márcio Antônio Duarte, Lucia Penso, Dieter Rautenbach, Uérverton dos Santos Souza

Diameter of a Symmetric Icosahedral Fullerene Graphs
D. S. Nicodemos, L. Faria, S. Klein
11:00-12:15Convexity and Intersection Graphs - Room Ita e Alaor
New results on the geodeticity of the contour of a graph
Danilo Artigas, Simone Dantas, Alonso L. S. Oliveira, Thiago M. D. Silva

O número de Helly Geodético em convexidades
Moisés T. C. Junior, Mitre C. Dourado, Jayme L. Szwarcfiter

The problem of recognizing unit PI graphs
Luerbio Faria, Luiz Martins, Fabiano Oliveira
12:15-14:00Lunch
14:00Check Out