
List of Accepted Papers
- Julien Bensmail, Valentin Garnero, Nicolas Nisse, Alexandre Salch and Valentin Weber.
Recovery of disrupted airline operations using k-Maximum Matching in graphs.
[slides] |
- Pavol Hell and Tomas Feder.
Correspondence Homomorphisms to Reflexive Graphs.
[slides] |
- Manoel Campelo and Daniel Severin.
Facets of the polytope of legal sequences.
[slides] |
- Luis Pedro Montejano, Jonathan Chappelon and Jorge Luis Ramírez Alfonsín.
Ramsey for complete graphs with a dropped edge or a triangle.
[slides] |
- Tien-Nam Le.
Locally self-avoiding eulerian tours.
[slides] |
- Marina Groshaus, André L. P. Guedes and Juan Pablo Puppo.
Biclique graph of bipartite permutation graphs.
[slides] |
- Wiebke Bedenknecht, Guilherme Oliveira Mota, Christian Reiher and Mathias Schacht.
On the local density problem for graphs of given odd-girth.
[slides] |
- Leonardo Coregliano, Roberto Parente and Cristiane Sato.
On the maximum density of fixed strongly connected subtournaments.
Cancelled
- Alvaro Javier Fuentes Suárez and Evelyne Hubert.
Scaffolding skeletons using spherical Voronoi diagrams.
[slides] |
- Rennan Dantas, Frédéric Havet and Rudini Sampaio.
Minimum density of identifying codes of king grids.
[slides] |
- Andreas Brandstädt and Raffaele Mosca.
On Efficient Domination for Some Classes of H-Free Chordal Graphs.
[slides] |
- Rafael Andrade, Tiberius Bonates, Manoel Campelo and Mardson Ferreira.
Minimum Linear Arrangements.
[slides] |
- Nathann Cohen, Frédéric Havet, William Lochet and Raul Lopes.
Bispindles in strongly connected digraphs with large chromatic number.
[slides] |
- Alexandre X. Martins, Christophe Duhamel and Andréa C. Santos.
A column generation approach for the strong network orientation problem.
[slides] |
- Valerio Boncompagni, Irena Penev and Kristina Vuskovic.
Clique cutsets beyond chordal graphs.
[slides] |
- Rubens Sucupira, Luerbio Faria, Sulamita Klein, Ignasi Sau and Uéverton Souza.
Maximum Cuts in Edge-colored Graphs.
[slides] |
- Phablo Moura and Yoshiko Wakabayashi.
Strong intractability of generalized convex recoloring problems.
[slides] |
- Claudson Bornstein, José Wilson Coura Pinto and Dieter Rautenbach.
Intersection Graphs of Orthodox Paths in Trees.
[slides] |
- Nathan Chadder and Antoine Deza.
Computational determination of the largest lattice polytope diameter.
[slides] |
- Maycon Sambinelli, Orlando Lee and Cândida Nunes Da Silva.
Advances in Aharoni-Hartman-Hoffman's Conjecture for Split digraphs.
[slides] |
- Rafael Veiga Pocai.
Inapproximability Ratios for Crossing Number.
[slides] |
- Simone Dantas, Rodrigo Marinho and Slobodan Tanushevski.
The Solitaire Clobber game and correducibility.
[slides] |
- Isidoro Gitler and Gustavo Antonio Sandoval-Angeles.
Delta-wye Transformations and the Efficient Reduction of Almost-Planar Graphs.
[slides] |
- Juan Gutiérrez, Cristina Fernandes, Paloma Lima, Renzo Gómez and Márcia Cerioli.
Transversals of Longest Paths.
[slides] |
- Bruno Dias, Rosiane de Freitas, Nelson Maculan and Javier Marrenco.
Facet-inducing inequalities and a cut-and-branch algorithm for the bandwidth coloring polytope based on the orientation model.
[slides] |
- Fábio Botler and Maycon Sambinelli.
Gallai’s Conjecture for graphs with treewidth 3.
[slides] |
- Matthias Koeppe and Jiawei Wang.
Structure and Interpretation of Dual-Feasible Functions.
[slides] |
- Martín Matamala and José Zamora.
Graphs admitting antimagic labeling for arbitrary sets of positive integers.
[slides] |
- Renata R. Del-Vecchio, Cybele T. M. Vinagre and Guilherme B. Pereira.
Hyper-Hamiltonicity in graphs: some sufficient conditions.
[slides] |
- Arman Boyaci and Jerome Monnot.
Weighted upper domination number.
[slides] |
- Lucas Isenmann and Timothée Pecatte.
Möbius Stanchion Systems.
[slides] |
- Camile F. Bordini and André Luís Vignatti.
An Approximation Algorithm for the $p$-Hub Median Problem.
[slides] |
- M.A. Pizaña and I.A. Robles.
On cliques and bicliques.
[slides] |
- Júlio Araújo, Julien Baste and Ignasi Sau.
Ruling out FPT algorithms for Weighted Coloring on forests.
[slides] |
- Márcio Félix Reis, Mário César San Felice, Orlando Lee and Fábio Luiz Usberti.
A 3-approximation algorithm for the maximum leaf k-forest problem.
[slides] |
- Luana Cordeiro, Simone Dantas and Diana Sasaki.
On Type 2 Snarks and Dot Products.
[slides] |
- César Hernández-Cruz and Jesús Alva-Samos.
$k$-quasi-transitive digraphs of large diameter.
[slides] |
- Johanne Cohen, Yannis Manoussakis, Hong Phong Pham and Zsolt Tuza.
Tropical matchings in vertex-colored graphs.
[slides] |
- Murilo de Lima, Mário César San Felice and Orlando Lee.
On Generalizations of the Parking Permit Problem and Network Leasing Problems.
[slides] |
- Liliana Alcón, Miguel Pizaña and Gabriela Ravenna.
On the Existence of Critical Clique-Helly Graphs.
[slides] |
- Guillaume Ducoffe, Ruxandra Marinescu-Ghemeci and Alexandru Popa.
On the (di)graphs with (directed) proper connection number two.
[slides] |
- Daniel Paulusma, Christophe Picouleau and Bernard Ries.
Reducing the Chromatic Number by Vertex or Edge Deletions.
[slides] |
- Gabriela Argiroffo, Silvia Bianchi, Yanina Lucarini and Annegret Wagler.
The identifying code number of block graphs.
[slides] |
- Bsaybes Sahar, Alain Quilliot and Annegret Wagler.
Fleet management for autonomous vehicles using flows in time-expanded networks.
[slides] |
- Cláudia Linhares Sales, Leonardo Sampaio and Ana Silva.
The lexicographic product of some chordal graphs and of cographs are b-continuous.
[slides] |
- Henri Perret Du Cray, Mourad Baiou, Laurent Beaudou and Vincent Limouzy.
Bounds on Directed star arboricity in some digraph classes.
[slides] |
- Mayara Omai, Sheila Almeida and Diana Sasaki.
AVD-edge coloring on powers of paths.
[slides] |
- Alexsander A. Melo, Celina H. M. Figueiredo and Uéverton S. Souza.
Simple Undirected Two-Commodity Integral Flow with a Unitary Demand.
[slides] |
- Pablo De Caria.
On the recognition of neighborhood inclusion posets.
[slides] |
- Stéphane Bessy, Mitre C. Dourado, Lucia D. Penso and Dieter Rautenbach.
The Geodetic Hull Number is Hard for Chordal Graphs.
[slides] |
- L. Emilio Allem, Antonio Cafure, Ezequiel Dratman, Luciano N. Grippo, Martín D. Safe and Vilmar Trevisan.
On graphs with a single large Laplacian eigenvalue.
[slides] |
- Olga Kuryatnikova and Juan Carlos Vera Lizcano.
Approximating the cone of copositive kernels to estimate the stability number of infinite graphs.
[slides] |
- M. Braga, D. Delle Donne, M. Escalante, J. Marenco, M. E. Ugarte and M. C. Varaldo.
The minimum chromatic violation problem: a polyhedral study.
[slides] |
- Ngoc Khang Le.
Detecting induced subdivision of $K_4$.
[slides] |