Program - Tuesday

9:30-10:30Ignasi Sau - Chair: Vinicius dos Santos
10:30-10:50Break
SessionPoly-time and FPT Algorithms - Chair: Ana Karolinna Maia
10:50-11:15Farnaz Sheikhi and Ali Mohades: Maximum Separability by L-shapes
11:15-11:40Farley Soares Oliveira, Hidefumi Hiraishi and Hiroshi Imai: FPT Algorithms to Enumerate and Count Acyclic and Totally Cyclic Orientations
11:40-12:05Victor Campos, Raul Lopes, Ana Karolinna Maia and Ignasi Sau: Adapting The Directed Grid Theorem into an FPT Algorithm
12:05-12:30Free time
12:30-14:30Lunch
14:30-15:30Cristina Fernandes - Chair: Gabriel Coutinho
SessionDistances in graphs - Chair: Sulamita KleinGraph convexity - Chair: Uéverton Souza
15:30-15:55Léo Planche, Etienne Birmele and Fabien De Montgolfier: On the Minimum Eccentricity Isometric Cycle ProblemPedro Arraes and Júlio Araújo: Hull and geodetic numbers for some classes of oriented graphs
15:55-16:20Fernanda Couto and Luis Cunha: Hardness and efficiency on minimizing maximum distances for graphs with few $P_4$'s and (k,l)-graphsMoisés Teles Carvalho, Simone Dantas, Mitre Costa Dourado, Daniel Fabio Domingues Posner and Jayme Luiz Szwarcfiter: On the computational complexity of the Helly number in the $P_3$ and related convexities
16:20-16:45Julien Bensmail, Fionn Mc Inerney and Nicolas Nisse: Metric Dimension: from Graphs to Oriented GraphsMárcia R. Cappelle, Erika M. M. Coelho, Hebert Coelho, Braully R. Silva, Fábio Protti, Uéverton S. Souza: $P_3$-Hull number of graphs with diameter two
16:45-17:15Coffee Break
17:15-18:00Free time
18:00-19:00Forró Lesson - Teachers: Luiza Bispo and Isabel Loyola
19:00-20:30Free time + Dinner
20:30Forró Party - Trio Bem-te-Quero