First week
July 19
- Adam Wagner, University of Illinois at Urbana-Champaign, US
Tutorial on the Container Method: A simple guide to solve (not so simple) problems
- Alberto Miranda, IFNMG, BR
Pfaffian graphs
- Alexandre Abreu, UFRJ, BR
Staggered Quantum Algorithm for Element Distinctness
- Alvaro Franco, UFSC, BR
A new kinship machine: characteristics, use and perspectives
- Ioannis Lamprou, University of Liverpool, UK
Fast Two-Robot Disk Evacuation
- Raul Lopes, UFC, BR
A Proof for a Conjecture of Gorgol
- Yingjie Qian, McGill University, CA
Teaching dimension, VC dimension and critical sets for Latin squares
July 20
- Frederik Garbe, University of Birmingham, UK
Hamilton cycles in hypergraphs below the Dirac threshold
- Johanna Strömberg, Vanderbilt University, CA
Multicoloured Containers and Graphon Entropy
- Lizeth Riascos-Alvarez, Universidad Autónoma de Nuevo León, MX
The Kidney Exchange Problem
- Richard Lang, Universidad de Chile, CL
Chromatic index, treewidth and maximum degree
- Robert Aduviri Choque, PUC Peru, PE
An Evolutionary Optimization Approach for Disaster Relief Supplies Distribution
- Veronica Moyano, Universidad de Buenos Aires, AR
Solvable cases for the perfect edge domination problem
July 21
- Anton Bernshteyn, University of Illinois at Urbana-Champaign, US
The asymptotic behavior of the correspondence chromatic number
- Dafne García de Armas, University of Havana, CU
Route Selection Strategy applied to Heterogeneous and Multi-Compartment Vehicle Routing Problem
- David Narváez, Rochester Institute of Technology, US
C5-Free k-Colorings of Complete Graphs
- Liana Yepremyan, McGill University, CA
The Local Stability Method and its applications: New Turán Numbers
- Julian Romero, University of Waterloo, CA
Applied Hilbert’s Nullstellensatz for Combinatorial Problems
- Małgorzata Sulkowska, Wrocław University of Technology, PL
Best choice problem for powers of paths
- Omar Latorre Vilca, UFAM, BR
An efficient algorithm for the Closest String Problem
July 22
- Andrea Visentin, University College Cork, IE
Robust Principal Component Analysis by Reverse Iterative Linear Programming
- Daniel Rorabaugh, Queen’s University, CA
Densities of Unavoidable Words
- Gleb Nenashev, Stockholm University, SE
“K-theoretic” analog of Postnikov-Shapiro algebra distinguishes graphs
- He Guo, Georgia Institute of Technology, US
Maximum number of triangles in wheel-free graphs and its relation with Turán number of expansion of wheels in 3-graphs
- Lucas de Oliveira Contiero, UFRGS, BR
Advances in a Hypergraph Coloring Conjecture
- Pablo Terlisky, Universidad de Buenos Aires, AR
Integrality of Minimal Circular Arc Models
- Yaqiao Li, McGill University, CA
A characterization of functions with vanishing averages over products of disjoint sets
Second week
July 25
- César Hernández Vélez, Universidad Autónoma de San Luis Potosí, MX
Hamiltonian Cycles in the Matroid Basis Graph
- Diego Delle Donne, Universidad Nacional de General Sarmiento, AR
Polyhedral studies of vertex coloring problems
- Gabriel Sobral, UFPR, BR
Study of k-biclique edge-choosability in some graph classes
- László Papp, Budapest University of Technology and Economics, HU
Optimal pebbling number
- Nicolás Sanhueza Matamala, University of Birmingham, UK
Minimum codegree threshold for covering with tight cycles in k-uniform hypergraphs
- Sebastián Bustamante, Universidad de Chile, CL
Monochromatic tree covers and Ramsey numbers for set-coloured graphs
- Victor Verdugo, École normale supérieure and University of Chile, CL
SDP and LP integrality gaps for scheduling identical machines
July 26
- Edin Husić, University of Primorska, SI
Minimum conflict-free row split problem: a model for reconstructing perfect phylogeny
- Igor Carboni Oliveira, Charles University in Prague, CZ
Circuit lower bounds from nontrivial learning algorithms
- Luís Doin, USP, BR
Legitimate Coloring of Finite Projective Planes via Entropy Compression
- Marko Savić, University of Novi Sad, SR
Faster bottleneck non-crossing matchings of points in convex position
- Natália Pedroza, UFRJ, BR
Variable-length error correcting codes
- Santiago Viertel, UFPR, BR
Compact routing schemes in complex networks
- Yanina Lucarini, Universidad Nacional de Rosario, AR
Polyhedra associated with identifying codes in graphs
July 27
- Daniel Severin, Universidad Nacional de Rosario, AR
The additive coloring problem on graphs
- Katherine Edwards, Princeton University, US
Fast approximations for p-centres in δ-hyperbolic graphs
- Lilian Cavalet, UFRGS, BR
Applying Spectral Graph Theory to classical extremal problems
- Murilo de Lima, UNICAMP, BR
Online Network Leasing Problems
- Nikolai Karpov, Saint Petersburg Academic University, RU
Parameterized Complexity of Secluded Connectivity Problems
- Renan Pinto, UFRJ, BR
The problem of covering solids by spheres of different radii
- Ruth Luo, University of Illinois at Urbana Champaign, US
A stability version for a theorem of Erdős on nonhamiltonian graphs
July 28
- Christopher Kusch, FU Berlin, DE
Strong Ramsey Games: Drawing on an infinite board
- Diogo Braga, UFF, BR
Combinatorial Optimization Models for Global Value Chains
- Fiona Skerman, University of Oxford, UK
Modularity of Random Graphs
- Guilherme Porto da Silva, UFRGS, BR
The Sum of Signless Laplacian Eigenvalues of a Graph
- Jefferson Elbert Simões, UFRJ, BR
Local symmetry in random graphs
- Josimar Chire Saire, San Pablo Catholic University, PE
An approach using probability density function and rewarding criteria for numerical optimization
- Rodrigo Martins, UTFPR, BR
On the cycle structure of mappings with restriction on the indegrees