| BRT TIME | ACTIVITY (place) | |
|---|---|---|
| 9:00 AM | Getting to know Virtual Chair space | |
| 9:30 AM | Opening (auditorium) | |
| 10:00 AM | Technical session 1 (room A) Chair: Yoshiharu Kohayakawa |
Technical session 2 (room B) Chair: Vinícius Fernandes dos Santos |
| 10:00 AM | Simón Piga and Nicolás Sanhueza-Matamala Codegree conditions for cycle decompositions and Euler tours in 3-uniform hypergraphs |
Salomon Bendayan, Yanjia Li, Bruce Reed and Jordan Barrett Partitioning Into Prescribed Number of Cycles and Mod k T-join With Slack |
| 10:20 AM | Julia Böttcher, Olaf Parczyk, Amedeo Sgueglia and Jozef Skokan Cycle factors in randomly perturbed graphs |
Guillaume Ducoffe, Thomas Dissaux, Nicolas Nisse and Simon Nivelle Treelength of Series-parallel Graphs |
| 10:40 AM | Peter Allen, Julia Böttcher, Ewan Davies, Eng Keat Hng and Jozef Skokan An approximate blow-up lemma for sparse hypergraphs |
Clément Dallard, Robert Ganian, Meike Hatzel, Matjaž Krnc and Martin Milanič Graphs with Two Moplexes |
| 11:00 AM | Extra Q&A for technical sessions (lobby) / Break | |
| 11:15 AM | Plenary lecture: Jose R. Correa (auditorium) Chair: Manoel Campelo |
|
| 12:15 PM | Lunch break | |
| 2:00 PM | Plenary lecture: Xingxing Yu (auditorium) Chair: Jayme Szwarcfiter |
|
| 3:00 PM | Break | |
| 3:15 PM | Technical session 3 (room A) Chair: Carlos Hoppen |
Technical session 4 (room B) Chair: Cândida Nunes da Silva |
| 3:15 PM | Ndiamé Ndiaye, Noah Brustle, Sarah Clusiau, Vishnu V. Narayan, Bruce Reed and Ben Seamone The Speed and Threshold of the Biased Perfect Matching Game |
Guilherme de Castro Mendes Gomes and Vinicius F. dos Santos Kernelization results for Equitable Coloring |
| 3:35 PM | John Machacek Unique maximum independent sets in graphs on monomials of a fixed degree |
Diane Castonguay, Celina M. H. de Figueiredo, Luis A. B. Kowada, Caroline S. R. Patrão, Diana Sasaki and Mario Valencia-Pabon On total coloring the direct product of complete graphs |
| 3:55 PM | Adrián Pastine, Pablo Torres and Mario Valencia-Pabon On the diameter of Schrijver graphs |
Mauro Nigro Alves Junior, Diana Sasaki and Matheus Adauto On total coloring of 4-regular circulant graphs |
| 4:15 PM | Maurício Collares, Yoshiharu Kohayakawa, Carlos Moreira and Guilherme Mota Constrained colourings of random graphs |
Isabel F. A. Gonçalves, Simone Dantas and Diana Sasaki On equitable total coloring of snarks |
| 4:35 PM | Extra Q&A for technical sessions (lobby) | |
| BRT TIME | ACTIVITY (place) | |
|---|---|---|
| 10:00 AM | Technical session 5 (room A) Chair: Maurício Collares |
Technical session 6 (room B) Chair: Fabiano Oliveira |
| 10:00 AM | Jean Cardinal, Lionel Pournin and Mario Valencia-Pabon Bounds on the Diameter of Graph Associahedra |
Luis Gustavo Da Soledade Gonzaga, Sheila Almeida, Cândida Nunes Da Silva and Jadder Bismarck Sousa Cruz The chromatic index of split-interval graphs |
| 10:20 AM | Sören Berger, Simon Piga, Christian Reiher, Vojtěch Rödl and Mathias Schacht Turán density of cliques of order five in 3-uniform hypergraphs with quasirandom links |
Florent Foucaud, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr and Petru Valicov Cliques in exact distance powers of graphs of given maximum degree |
| 10:40 AM | Pranshu Gupta, Yannick Mogge, Simon Piga and Bjarne Schülke Maximum size of r-cross t-intersecting families |
Adriana Hansberg, Amanda Montejano and Yair Caro Recursive constructions of amoebas |
| 11:00 AM | Extra Q&A for technical sessions (lobby) / Break | |
| 11:15 AM | Plenary lecture: Silvano Martello (auditorium) Chair: Eduardo Moreno |
|
| 12:15 PM | Lunch break | |
| 13:00 PM | Minicourse "Some Discrete Aspects of Semidefinite Programming" Marcel Kenji de Carli Silva |
|
| 2:00 PM | Joseph S. B. Mitchell (auditorium) Chair: Carlos Hoppen |
|
| 3:00 PM | Break | |
| 3:15 PM | Technical session 7 (room A) Chair: Simon Piga |
Technical session 8 (room B) Chair: Javier Marenco |
| 3:15 PM | Maurício Collares, Yoshiharu Kohayakawa, Taísa Martins, Roberto Parente and Victor Souza Hitting times for arc-disjoint arborescences in random digraph processes |
Hugo Kooki Kasuya Rosado, Marcelo Pinheiro Leite Benedito and Lehilton Lelis Chaves Pedrosa On the Inapproximability of the Cable-Trench Problem |
| 3:35 PM | Vitor T. F. de Luca, Fabiano Oliveira and Jayme Szwarcfiter Minimum Number of Bends of Paths of Trees in a Grid Embedding |
Javier Akagi, Eduardo Canale and Marcos Villagra Tromino Tilings with Pegs via Flow Networks |
| 3:55 PM | Fábio Botler, Carlos Hoppen and Guilherme Mota Counting orientations of graphs with no strongly connected tournaments |
Felipe de C. Pereira, Pedro J. de Rezende and Cid C. de Souza Effective Heuristics for the Perfect Awareness Problem |
| 4:15 PM | Andrea Jiménez, Maycon Sambinelli, Fábio Botler and Yoshiko Wakabayashi The 2-Decomposition Conjecture for a new class of graphs |
Klairton Lima Brito, Andre Rodrigues Oliveira, Alexsandro Oliveira Alexandrino, Ulisses Dias and Zanoni Dias Reversal and Transposition Distance of Genomes Considering Flexible Intergenic Regions |
| 4:35 PM | Extra Q&A for technical sessions (lobby) | |
| BRT TIME | ACTIVITY (place) | |
|---|---|---|
| 10:00 AM | Technical session 9 (room A) Chair: Diane Castonguay |
Technical session 10 (room B) Chair: Tássio Naia dos Santos |
| 10:00 AM | Marina Groshaus and André L. P. Guedes Biclique Graphs of K3-free Graphs and Bipartite Graphs |
Matheus Diógenes Andrade and Fábio Luiz Usberti Combinatorial properties for the green vehicle routing problem |
| 10:20 AM | Guilherme de Castro Mendes Gomes and Vinicius F. dos Santos On structural parameterizations of the selective coloring problem |
Marcelo Bianchetti and Javier Marenco Valid inequalities and a branch-and-cut algorithm for the routing and spectrum allocation problem |
| 10:40 AM | Lucas Böltz, Benjamin Becker and Hannes Frey Local Construction of Connected Plane Subgraphs in Graphs Satisfying Redundancy and Coexistence |
Cecília Lescano Osório and Edna Hoshino A branch-and-price algorithm for the ring/ring problem |
| 11:00 AM | Extra Q&A for technical sessions (lobby) / Break | |
| 11:15 AM | Plenary lecture: Laura Sanità (auditorium) Chair: Luerbio Faria |
|
| 12:15 PM | Official photo | |
| 12:30 PM | Lunch break | |
| 13:00 PM | Minicourse "Some Discrete Aspects of Semidefinite Programming" Marcel Kenji de Carli Silva |
|
| 2:00 PM | Plenary lecture: Kirk Pruhs (auditorium) Chair: Cristina Gomes Fernandes |
|
| 3:00 PM | Break | |
| 3:15 PM | Technical session 11 (room A) Chair: Marina Groshaus |
Technical session 12 (room B) Chair: Rudini Menezes Sampaio |
| 3:15 PM | Antoine Genitrini, Martin Pépin and Alfredo Viola Unlabelled ordered DAGs and labelled DAGs: constructive enumeration and uniform random sampling |
Pierre Bergé and Michel Habib Diameter in linear time for constant-dimension median graphs |
| 3:35 PM | Ndiamé Ndiaye, Noah Brüstle, Sarah Clusiau, Bruce Reed, Ben Seamone and Vishnu V. Narayan The Speed and Threshold of the Biased Hamilton Cycle Game |
Roberta Rasoviti Marques Costa Moço, Alberto Alexandre Assis Miranda and Cândida Nunes da Silva The signature matrix for 6-Pfaffian graphs |
| 3:55 PM | Flavia Bonomo-Braberman and Gastón Brito Intersection models for 2-thin and proper 2-thin graphs |
Léo V. Peres and Ricardo Dahab Tutte’s 3-flow conjecture for almost even graphs |
| 4:15 PM | Josefran de O. Bastos, Hanno Lefmann, Andy Oertel, Carlos Hoppen and Dionatan R. Schmidt Maximum number of r-edge-colorings such that all copies of K_k are rainbow |
Bernardo Abrego, Julia Dandurand and Silvia Fernandez The crossing number of centrally symmetric complete geometric graphs |
| 4:35 PM | Extra Q&A for technical sessions (lobby) | |
| BRT TIME | ACTIVITY (place) | |
|---|---|---|
| 10:00 AM | Technical session 13 (room A) Chair: Sulamita Klein |
Technical session 14 (room B) Chair: Fábio Botler |
| 10:00 AM | Daniel A. Quiroz Complete immersions in graphs with independence number two and small forbidden subgraphs |
Ishay Haviv and Michal Parnas Upper Bounds on the Boolean Rank of Kronecker Products |
| 10:20 AM | Luerbio Faria, André L. P. Guedes and Lilian Markenzon On feedback vertex set in reducible flow hypergraphs |
Andrzej Lingas Consequences of APSP, triangle detection, and 3SUM hardness for separation between determinism and non-determinism |
| 10:40 AM | Claudia Gonçalves, Emerson Monte Carmelo and Irene Nakaoka Polarity graphs and C4-free multipartite graphs |
Susanna F. de Rezende Automating Tree-Like Resolution in Time no(log n) Is ETH-Hard |
| 11:00 AM | Extra Q&A for technical sessions (lobby) / Break | |
| 11:15 AM | Plenary lecture: Jayme L. Szwarcfiter (auditorium) Chair: Flavia Bonomo |
|
| 12:15 PM | Lunch break | |
| 13:00 PM | Minicourse "Some Discrete Aspects of Semidefinite Programming" Marcel Kenji de Carli Silva |
|
| 2:00 PM | Plenary lecture: Eduardo Uchoa (auditorium) Chair: Flávio Keidi Miyazawa |
|
| 3:00 PM | Break | |
| 3:15 PM | Technical session 15 (room A) Chair: Lilian Markenzon |
Technical session 16 (room B) Chair: Susanna Rezende |
| 3:15 PM | Lucas Keiler, Carlos Vinicius G. C. Lima, Ana Karolinna Maia, Rudini Sampaio and Ignasi Sau Target set selection with maximum activation time |
Mahmoud Abo Khamis, Sungjin Im, Benjamin Moseley, Kirk Pruhs and Alireza Samadian Instance Optimal Join Size Estimation |
| 3:35 PM | Márcia R. Cappelle, Guilherme de Castro Mendes Gomes and Vinicius F. dos Santos Parameterized algorithms for locating-dominating sets |
Hessa Al-Thani and Jon Lee Tridiagonal Maximum-Entropy Sampling and Tridiagonal Masks |
| 3:55 PM | Marcelo P. L. Benedito and Lehilton L. C. Pedrosa A parameterized approximation scheme for the Star k-Hub Center |
Wilder Mendes, Simone Dantas and Sylvain Gravier The (a,b)-monochromatic transversal game on biclique-hypergraphs of powers of paths and of powers of cycles |
| 4:15 PM | Extra Q&A for technical sessions (lobby) | |
| BRT TIME | ACTIVITY (place) | |
|---|---|---|
| 10:00 AM | Technical session 17 (room A) Chair: Orlando Lee |
Technical session 18 (room B) Chair: Daniel Quiroz |
| 10:00 AM | Enrico Malaguti and Vagner Pedrotti A new formulation for the Weighted Safe Set Problem |
Laura Eslava, Sarah Penington and Fiona Skerman Survival for a Galton-Watson tree with cousin mergers |
| 10:20 AM | Henrique Becker, Luciana Buriol and Olinto Araújo Extending an Integer Formulation for the Guillotine 2D Bin Packing Problem |
Daniel Bastos and Luis Kowada How to detect whether Shor's algorithm succeeds against large integers without a quantum computer |
| 10:40 AM | Manuela Blaum and Javier Marenco Valid inequalities and complete characterizations of the 2-domination and the P3-hull number polytopes |
Hessa Al-Thani and Jon Lee Tridiagonal Maximum-Entropy Sampling and Tridiagonal Masks |
| 11:00 AM | Extra Q&A for technical sessions (lobby) / Break | |
| 11:15 AM | Plenary lecture: Kristina Vušković (auditorium) Chair: Celina Figueiredo |
|
| 12:15 PM | Lunch break | |
| 2:00 PM | Plenary lecture: Martin Grötschel (auditorium) Chair: Yoshiko Wakabayashi |
|
| 3:00 PM | Break | |
| 3:15 PM | Special session 🦉 Yoshiko Wakabayashi (auditorium) | |
| 3:55 PM | Best paper award (auditorium) | |
| 4:15 PM | Closing remarks (auditorium) | |
| 4:35 PM | Business meeting (auditorium) | |