Invited speakers

Luerbio Faria
Luerbio Faria, Universidade do Estado do Rio de Janeiro, Brasil.
On the clique operator complexity
team member
Pavol Hell, Simon Fraser University, Canada.
Inteval Digraphs
Dieter Rautenbach
Dieter Rautenbach, Universität Ulm, Germany.
Cliques and Relatives – Bounds and Structures

Schedule

19:30Welcome Ceremony
20:00Welcome Cocktail
9:00–9:50Plenary Talk
Cliques and Relatives – Bounds and Structures
Dieter Rautenbach
10:00–10:40Combinatorial Games and Orders
Solitaire Clobber played on cartesian product of graphs
Simone Dantas, Sylvain Gravier, Telma Pará
Arboreal jump number of an order
Adriana Pimenta, Michael Habib, Sulamita Klein, Jayme Szwarcfiter
10:40-11:00Coffee Break
11:00-12:20Intersection Graphs
EPT graphs on bounded degree trees
Liliana Alcón, Marisa Gutierrez, María Pía Mazzoleni
On basic chordal graphs and some of its subclasses
Pablo De Caria, Marisa Gutierrez
Interval count of generalizations of threshold graphs
Márcia Cerioli, Fabiano Oliveira, Jayme Szwarcfiter
Modelos DV que pueden enraizarse
Marisa Gutierrez, Silvia Tondato
12:20-15:30Lunch
15:30-16:50Graph Operators
Self-diclique digraph
Ana P. Figueroa, Marietjie Frick, Bernardo Llano, Rita Zuazua
On Clique Graphs of Chordal Comparability Graphs
Michel Habib, Denis Julien, Vinícius Fernandes dos Santos, Ross M. McConnell, Jayme L. Szwarcfiter
The Clique Operator Considered as a Functor
Paco Larrión, Miguel A. Pizaña, Rafael Villarroel-Flores
Clique Graphs and Topology
Paco Larrión, Miguel A. Pizaña, Rafael Villarroel-Flores
16:50-17:20Coffee Break
17:20-18:20Bicliques
A lower bound for the biclique-chromatic number
Hélio B. Macêdo Filho, Raphael C. S. Machado, Celina M. H. de Figueiredo
The star and biclique coloring and choosability problems
Marina Groshaus, Francisco Soulignac, Pablo Terlisky
The biclique graph of some classes of graphs
Marina Groshaus, Juan Pablo Puppo
18:30-19:30Algebraic Graph Theory and Domination
Integer Index of n-broom-like graphs
Laura Patuzzi, Maria A. A. de Freitas, Renata R. Del-Vecchio
Dominating Induced Matchings
Min Chih Lin, Michel Mizrahi, Jayme Szwarcfiter
Efficient Multiple Domination
Rommel T. de Oliveira, Rommel M. Barbosa
20:00Dinner + Salsa class
9:00–9:50Plenary Talk
Interval Digraphs
Pavol Hell
10:00–10:40Independent Sets
Well-covered complementary prisms graphs
Rommel M. Barbosa, Márcia R. C. Santana
Enumeración de conjuntos independientes maximales en grafos bisplit
César Stuardo, Mónica Villanueva
10:40-11:00Coffee Break
11:00-12:20Colorings and Generalizations I
On the k,i-coloring problem
Flavia Bonomo, Guillermo Durán, Ivo Koch
On L(h,k)-coloring b-core limited graphs
Márcia R. Cerioli, Daniel F. D. Posner
Total chromatic number of some families of graphs with maximum degree 3
Simone Dantas, Celina M. H. de Figueiredo, Myriam Preissmann, Diana Sasaki
Minimal 3 × 3 M-obstruction cographs
Raquel S. F. Bravo, Fábio Protti, Loana T. Nogueira, Clautenis Viana
12:20-13:45Lunch
13:45-16:00Trip to Luján
16:00-17:00Convexity I
Geodetic Number Versus Hull Number in P3-Convexity
Carmen C. Centeno, Lucia D. Penso, Dieter Rautenbach, and Vinícius G. P. de Sá
Elements of Geodetic Convexity Applied to Classes of Graphs and Some Results in Distance-Hereditary Graphs
Mitre C. Dourado, Rodolfo A. Oliveira, Fábio Protti, Dieter Rautenbach
The Radon number on graphs
Alexandre Toman, Mitre C. Dourado, Jayme L. Szwarcfiter
17:00-17:30Coffee Break
17:30-18:30Applications
Two Families of Cayley Graph Interconnection Networks
André C. Ribeiro, Celina M. H. Figueiredo, Luis Antonio B. Kowada
A Pre-Processing Procedure for The Bicluster Graph Editing Problem
Rian Gabriel S. Pinheiro, Ivan César Martins, Fábio Protti, Luiz Satoru Ochi
Clique-based and others IP models for graph coloring with constraints and scheduling
Rosiane de Freitas, Flávio Coelho, Clarice Santos, Simone Gama
20:00Special Gala Dinner
9:30–10:20Plenary Talk
On the clique operator complexity
Luerbio Faria
10:30–11:10Convexity II
On the P3-Local Carathéodory number
Rommel M. Barbosa, Erika M. M. Coelho, Dieter Rautenbach, Mitre C. Dourado, Jayme L. Szwarcfiter
Uma Convexidade em Grafos Direcionados Acíclicos
Carmen C. Centeno, Mitre C. Dourado, Jayme L. Szwarcfiter
11:10-11:30Coffee Break
11:30-12:50Colorings and Generalizations II
AVD-total-coloring of complete equipartite graphs
Atílio G. Luiz, Christiane N. Campos, Célia P. de Mello
Multicolored Ramsey Numbers in Multipartite Graphs
Juliana Sanches, Emerson L. Monte Carmelo
Edge colouring bisplit graphs
Romina González, Carmen Ortiz, Mónica Villanueva
On selective-perfectness of graphs
Flavia Bonomo, Denis Cornaz, Tinaz Ekim-Asici, Bernard Ries
12:50-15:30Lunch
15:30-16:50Algorithms and Complexity
Feedback Vertex Set is NP-complete for Reducible Flow Hypergraphs
André L. P. Guedes, Lilian Markenzon, Luerbio Faria
Complexidade de Problemas de Conexão de Terminais
Uéverton dos Santos Souza, Rodolfo Alves de Oliveira, Fábio Protti
Searching for a NP-Complete Probe Graph Problem
Rafael B. Teixeira, Celina M. H. de Figueiredo, Simone Dantas
(k,l)-sandwich problem: why not ask for special kinds of bread?
Fernanda Couto, Luerbio Faria, Sulamita Klein, Loana Nogueira, Fábio Protti
16:50-17:20Coffee Break
18:00Check Out