IX Latin and American Algorithms, Graphs and Optimization Symposium

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