Table of Contents

• Preface5-11 [doi]
• k T-join With SlackJordan Barrett, Salomon Bendayan, Yanjia Li, Bruce Reed. 12-20 [doi]
• Reversal and Transposition Distance of Genomes Considering Flexible Intergenic RegionsKlairton Lima Brito, Andre Rodrigues Oliveira, Alexsandro Oliveira Alexandrino, Ulisses Dias, Zanoni Dias. 21-29 [doi]
• Treelength of Series-parallel GraphsThomas Dissaux, Guillaume Ducoffe , Nicolas Nisse, Simon Nivelle. 30-38 [doi]
• On the Inapproximability of the Cable-Trench ProblemMarcelo Pinheiro Leite Benedito, Lehilton L. C. Pedrosa, Hugo Kooki Kasuya Rosado. 39-48 [doi]
• An efficient parameterized approximation scheme for the Star k-Hub CenterMarcelo Pinheiro Leite Benedito, Lehilton L. C. Pedrosa. 49-58 [doi]
• Kernelization results for Equitable ColoringGuilherme de C. M. Gomes, Vinícius Fernandes dos Santos. 59-67 [doi]
• Parameterized algorithms for locating-dominating setsMárcia R. Cappelle, Guilherme C. M. Gomes, Vinicius F. dos Santos. 68-76 [doi]
• On structural parameterizations of the selective coloring problemGuilherme C. M. Gomes, Vinicius F. dos Santos. 77-85 [doi]
• Target set selection with maximum activation timeLucas Keiler, Carlos V. G. C. Lima, Ana Karolinna Maia, Rudini Menezes Sampaio, Ignasi Sau. 86-96 [doi]
• Diameter in linear time for constant-dimension median graphsPierre Bergé, Michel Habib. 97-107 [doi]
• Local Construction of Connected Plane Subgraphs in Graphs Satisfying Redundancy and CoexistenceLucas Böltz, Benjamin Becker, Hannes Frey. 108-117 [doi]
• Minimum Number of Bends of Paths of Trees in a Grid EmbeddingVitor Tocci Ferreira de Luca, Fabiano de Souza Oliveira, Jayme Luiz Szwarcfiter. 118-126 [doi]
• Tridiagonal Maximum-Entropy Sampling and Tridiagonal MasksHessa Al-Thani, Jon Lee 0001. 127-134 [doi]
• Instance Optimal Join Size EstimationMahmoud Abo Khamis, Sungjin Im, Benjamin Moseley, Kirk Pruhs, Alireza Samadian. 135-144 [doi]
• How to detect whether Shor's algorithm succeeds against large integers without a quantum computerDaniel Chicayban Bastos, Luis Antonio Brasil Kowada. 145-151 [doi]
• n) Is ETH-HardSusanna F. de Rezende. 152-162 [doi]
• Consequences of APSP, triangle detection, and 3SUM hardness for separation between determinism and non-determinismAndrzej Lingas. 163-171 [doi]
• Upper Bounds on the Boolean Rank of Kronecker ProductsIshay Haviv, Michal Parnas. 172-180 [doi]
• The (a, b)-monochromatic transversal game on biclique-hypergraphs of powers of paths and of powers of cyclesWilder P. Mendes, Simone Dantas, Sylvain Gravier. 181-189 [doi]
• The Speed and Threshold of the Biased Perfect Matching GameNoah Brustle, Sarah Clusiau, Vishnu V. Narayan, Ndiamé Ndiaye, Bruce Reed, Ben Seamone. 190-199 [doi]
• The Speed and Threshold of the Biased Hamilton Cycle GameNoah Brustle, Sarah Clusiau, Vishnu V. Narayan, Ndiamé Ndiaye, Bruce Reed, Ben Seamone. 200-211 [doi]
• On feedback vertex set in reducible flow hypergraphsLuérbio Faria, André Luiz Pires Guedes, Lilian Markenzon. 212-220 [doi]
• Intersection models for 2-thin and proper 2-thin graphsFlavia Bonomo-Braberman, Gastón Abel Brito. 221-229 [doi]
• 3-free Graphs and Bipartite GraphsMarina Groshaus, André Luiz Pires Guedes. 230-238 [doi]
• Bounds on the Diameter of Graph AssociahedraJean Cardinal, Lionel Pournin, Mario Valencia-Pabon. 239-247 [doi]
• Graphs with Two MoplexesClément Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic. 248-256 [doi]
• Recursive constructions of amoebasAdriana Hansberg, Amanda Montejano, Yair Caro. 257-265 [doi]
• On the diameter of Schrijver graphsAdrián Pastine, Pablo Daniel Torres, Mario Valencia-Pabon. 266-274 [doi]
• The crossing number of centrally symmetric complete geometric graphsBernardo M. Ábrego, Julia Dandurand, Silvia Fernández-Merchant. 275-279 [doi]
• Tutte's 3-flow Conjecture for almost even graphsLéo Vieira Peres, Ricardo Dahab. 280-288 [doi]
• Unique maximum independent sets in graphs on monomials of a fixed degreeJohn Machacek. 289-297 [doi]
• The signature matrix for 6-Pfaffian graphsRoberta Rasoviti Marques Costa Moço, Alberto Alexandre Assis Miranda, Cândida Nunes da Silva. 298-305 [doi]
• On total coloring the direct product of complete graphsDiane Castonguay, C. M. H. de Figueiredo, Luis Antonio Brasil Kowada, Caroline Reis Patrão, D. Sasaki, Mario Valencia-Pabon. 306-314 [doi]
• On total coloring of 4-regular circulant graphsMauro Nigro, Matheus Nunes Adauto, Diana Sasaki. 315-324 [doi]
• The chromatic index of split-interval graphsLuis Gustavo da Soledade Gonzaga, Sheila Morais de Almeida, Cândida Nunes da Silva, Jadder Bismarck de Sousa Cruz. 325-333 [doi]
• On equitable total coloring of snarksIsabel F. A. Gonçalves, Simone Dantas, Diana Sasaki. 334-342 [doi]
• Complete immersions in graphs with independence number two and small forbidden subgraphsDaniel A. Quiroz. 343-349 [doi]
• Codegree conditions for cycle decompositions and Euler tours in 3-uniform hypergraphsSimón Piga, Nicolás Sanhueza-Matamala. 350-358 [doi]
• The 2-Decomposition Conjecture for a new class of graphsFábio Botler, Andrea Jiménez, Maycon Sambinelli, Yoshiko Wakabayashi. 359-367 [doi]
• Constrained colourings of random graphsMaurício Collares Neto, Yoshiharu Kohayakawa, Carlos Gustavo T. de A. Moreira, Guilherme Oliveira Mota. 368-375 [doi]
• Hitting times for arc-disjoint arborescences in random digraph processesMaurício Collares Neto, Yoshiharu Kohayakawa, Taísa Martins, Roberto Parente, Victor Souza. 376-384 [doi]
• Counting orientations of graphs with no strongly connected tournamentsFábio Botler, Carlos Hoppen, Guilherme Oliveira Mota. 385-393 [doi]
• An Approximate Blow-up Lemma for Sparse HypergraphsPeter Allen, Julia Böttcher, Eng Keat Hng, Jozef Skokan, Ewan Davies. 394-403 [doi]
• Cycle factors in randomly perturbed graphsJulia Böttcher, Olaf Parczyk, Amedeo Sgueglia, Jozef Skokan. 404-411 [doi]
• Turán density of cliques of order five in 3-uniform hypergraphs with quasirandom linksSören Berger, Simón Piga, Christian Reiher, Vojtech Rödl, Mathias Schacht. 412-418 [doi]
• k are rainbowJosefran de Oliveira Bastos, Hanno Lefmann, Andy Oertel, Carlos Hoppen, Dionatan Ricardo Schmidt. 419-426 [doi]
• Cliques in exact distance powers of graphs of given maximum degreeFlorent Foucaud, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Petru Valicov. 427-436 [doi]
• 4-free multipartite graphsClaudia J. F. Gonçalves, Emerson L. Monte Carmelo, Irene N. Nakaoka. 437-444 [doi]
• Survival for a Galton-Watson tree with cousin mergersLaura Eslava, Sarah Penington, Fiona Skerman. 445-452 [doi]
• t-intersecting familiesPranshu Gupta, Yannick Mogge, Simón Piga, Bjarne Schülke. 453-458 [doi]
• Tromino Tilings with Pegs via Flow NetworksJavier T. Akagi, Eduardo A. Canale, Marcos Villagra. 459-467 [doi]
• Unlabelled ordered DAGs and labelled DAGs: constructive enumeration and uniform random samplingAntoine Genitrini, Martin Pépin, Alfredo Viola. 468-477 [doi]
• Combinatorial Properties for the Green Vehicle Routing ProblemMatheus Diógenes Andrade, Fabio Luiz Usberti. 478-488 [doi]
• Effective Heuristics for the Perfect Awareness ProblemFelipe de C. Pereira, Pedro J. de Rezende, Cid C. de Souza. 489-498 [doi]
• Extending an Integer Formulation for the Guillotine 2D Bin Packing ProblemHenrique Becker, Olinto Araujo, Luciana S. Buriol. 499-507 [doi]
• A new formulation for the Weighted Safe Set ProblemEnrico Malaguti, Vagner Pedrotti. 508-515 [doi]
• A branch-and-price algorithm for the ring/ring problemCecilia Lescano Osório, Edna Ayako Hoshino. 516-522 [doi]
• Valid inequalities and a branch-and-cut algorithm for the routing and spectrum allocation problemMarcelo Bianchetti, Javier Marenco. 523-531 [doi]
• 3-hull number polytopesManuela Blaum, Javier Marenco. 532-542 [doi]