| 2021 | A branch-and-price algorithm for the ring/ring problem. Cecilia Lescano Osório, Edna Ayako Hoshino |
| 2021 | A new formulation for the Weighted Safe Set Problem. Enrico Malaguti, Vagner Pedrotti |
| 2021 | An Approximate Blow-up Lemma for Sparse Hypergraphs. Peter Allen, Julia Böttcher, Eng Keat Hng, Jozef Skokan, Ewan Davies |
| 2021 | An efficient parameterized approximation scheme for the Star k-Hub Center. Marcelo Pinheiro Leite Benedito, Lehilton L. C. Pedrosa |
| 2021 | Automating Tree-Like Resolution in Time Susanna F. de Rezende |
| 2021 | Biclique Graphs of Marina Groshaus, André Luiz Pires Guedes |
| 2021 | Bounds on the Diameter of Graph Associahedra. Jean Cardinal, Lionel Pournin, Mario Valencia-Pabon |
| 2021 | Cliques in exact distance powers of graphs of given maximum degree. Florent Foucaud, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Petru Valicov |
| 2021 | Codegree conditions for cycle decompositions and Euler tours in 3-uniform hypergraphs. Simón Piga, Nicolás Sanhueza-Matamala |
| 2021 | Combinatorial Properties for the Green Vehicle Routing Problem. Matheus Diógenes Andrade, Fábio Luiz Usberti |
| 2021 | Complete immersions in graphs with independence number two and small forbidden subgraphs. Daniel A. Quiroz |
| 2021 | Consequences of APSP, triangle detection, and 3SUM hardness for separation between determinism and non-determinism. Andrzej Lingas |
| 2021 | Constrained colourings of random graphs. Maurício Collares Neto, Yoshiharu Kohayakawa, Carlos Gustavo T. de A. Moreira, Guilherme Oliveira Mota |
| 2021 | Counting orientations of graphs with no strongly connected tournaments. Fábio Botler, Carlos Hoppen, Guilherme Oliveira Mota |
| 2021 | Cycle factors in randomly perturbed graphs. Julia Böttcher, Olaf Parczyk, Amedeo Sgueglia, Jozef Skokan |
| 2021 | Diameter in linear time for constant-dimension median graphs. Pierre Bergé, Michel Habib |
| 2021 | Effective Heuristics for the Perfect Awareness Problem. Felipe de Carvalho Pereira, Pedro J. de Rezende, Cid C. de Souza |
| 2021 | Extending an Integer Formulation for the Guillotine 2D Bin Packing Problem. Henrique Becker, Olinto C. B. de Araújo, Luciana S. Buriol |
| 2021 | Graphs with Two Moplexes. Clément Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic |
| 2021 | Hitting times for arc-disjoint arborescences in random digraph processes. Maurício Collares Neto, Yoshiharu Kohayakawa, Taísa Martins, Roberto Parente, Victor Souza |
| 2021 | How to detect whether Shor's algorithm succeeds against large integers without a quantum computer. Daniel Chicayban Bastos, Luis Antonio Brasil Kowada |
| 2021 | Instance Optimal Join Size Estimation. Mahmoud Abo Khamis, Sungjin Im, Benjamin Moseley, Kirk Pruhs, Alireza Samadian |
| 2021 | Intersection models for 2-thin and proper 2-thin graphs. Flavia Bonomo-Braberman, Gastón Abel Brito |
| 2021 | Kernelization results for Equitable Coloring. Guilherme de C. M. Gomes, Vinícius Fernandes dos Santos |
| 2021 | Local Construction of Connected Plane Subgraphs in Graphs Satisfying Redundancy and Coexistence. Lucas Böltz, Benjamin Becker, Hannes Frey |
| 2021 | Maximum number of r-edge-colorings such that all copies of K Josefran de Oliveira Bastos, Hanno Lefmann, Andy Oertel, Carlos Hoppen, Dionatan Ricardo Schmidt |
| 2021 | Maximum size of Pranshu Gupta, Yannick Mogge, Simón Piga, Bjarne Schülke |
| 2021 | Minimum Number of Bends of Paths of Trees in a Grid Embedding. Vitor Tocci Ferreira de Luca, Fabiano de Souza Oliveira, Jayme Luiz Szwarcfiter |
| 2021 | On equitable total coloring of snarks. Isabel F. A. Gonçalves, Simone Dantas, Diana Sasaki |
| 2021 | On feedback vertex set in reducible flow hypergraphs. Luérbio Faria, André Luiz Pires Guedes, Lilian Markenzon |
| 2021 | On structural parameterizations of the selective coloring problem. Guilherme C. M. Gomes, Vinícius Fernandes dos Santos |
| 2021 | On the Inapproximability of the Cable-Trench Problem. Marcelo Pinheiro Leite Benedito, Lehilton L. C. Pedrosa, Hugo K. K. Rosado |
| 2021 | On the diameter of Schrijver graphs. Adrián Pastine, Pablo Daniel Torres, Mario Valencia-Pabon |
| 2021 | On total coloring of 4-regular circulant graphs. Mauro Nigro, Matheus Nunes Adauto, Diana Sasaki |
| 2021 | On total coloring the direct product of complete graphs. Diane Castonguay, Celina M. H. de Figueiredo, Luis A. B. Kowada, Caroline Reis Patrão, Diana Sasaki, Mario Valencia-Pabon |
| 2021 | Parameterized algorithms for locating-dominating sets. Márcia R. Cappelle, Guilherme C. M. Gomes, Vinícius Fernandes dos Santos |
| 2021 | Partitioning Into Prescribed Number of Cycles and Mod Jordan Barrett, Salomon Bendayan, Yanjia Li, Bruce A. Reed |
| 2021 | Polarity graphs and Claudia J. F. Gonçalves, Emerson L. Monte Carmelo, Irene N. Nakaoka |
| 2021 | Preface. |
| 2021 | Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, LAGOS 2021, Online Event / São Paulo, Brazil, May 2021. Carlos E. Ferreira, Orlando Lee, Flávio Keidi Miyazawa |
| 2021 | Recursive constructions of amoebas. Adriana Hansberg, Amanda Montejano, Yair Caro |
| 2021 | Reversal and Transposition Distance of Genomes Considering Flexible Intergenic Regions. Klairton Lima Brito, Andre Rodrigues Oliveira, Alexsandro Oliveira Alexandrino, Ulisses Dias, Zanoni Dias |
| 2021 | Survival for a Galton-Watson tree with cousin mergers. Laura Eslava, Sarah Penington, Fiona Skerman |
| 2021 | Target set selection with maximum activation time. Lucas Keiler, Carlos V. G. C. Lima, Ana Karolinna Maia, Rudini Menezes Sampaio, Ignasi Sau |
| 2021 | The (a, b)-monochromatic transversal game on biclique-hypergraphs of powers of paths and of powers of cycles. Wilder P. Mendes, Simone Dantas, Sylvain Gravier |
| 2021 | The 2-Decomposition Conjecture for a new class of graphs. Fábio Botler, Andrea Jiménez, Maycon Sambinelli, Yoshiko Wakabayashi |
| 2021 | The Speed and Threshold of the Biased Hamilton Cycle Game. Noah Brüstle, Sarah Clusiau, Vishnu V. Narayan, Ndiamé Ndiaye, Bruce A. Reed, Ben Seamone |
| 2021 | The Speed and Threshold of the Biased Perfect Matching Game. Noah Brüstle, Sarah Clusiau, Vishnu V. Narayan, Ndiamé Ndiaye, Bruce A. Reed, Ben Seamone |
| 2021 | The chromatic index of split-interval graphs. Luis Gustavo da Soledade Gonzaga, Sheila Morais de Almeida, Cândida Nunes da Silva, Jadder Bismarck de Sousa Cruz |
| 2021 | The crossing number of centrally symmetric complete geometric graphs. Bernardo M. Ábrego, Julia Dandurand, Silvia Fernández-Merchant |
| 2021 | The signature matrix for 6-Pfaffian graphs. Roberta Rasoviti Marques Costa Moço, Alberto Alexandre Assis Miranda, Cândida Nunes da Silva |
| 2021 | Treelength of Series-parallel Graphs. Thomas Dissaux, Guillaume Ducoffe, Nicolas Nisse, Simon Nivelle |
| 2021 | Tridiagonal Maximum-Entropy Sampling and Tridiagonal Masks. Hessa Al-Thani, Jon Lee |
| 2021 | Tromino Tilings with Pegs via Flow Networks. Javier T. Akagi, Eduardo A. Canale, Marcos Villagra |
| 2021 | Turán density of cliques of order five in 3-uniform hypergraphs with quasirandom links. Sören Berger, Simón Piga, Christian Reiher, Vojtech Rödl, Mathias Schacht |
| 2021 | Tutte's 3-flow Conjecture for almost even graphs. Léo Vieira Peres, Ricardo Dahab |
| 2021 | Unique maximum independent sets in graphs on monomials of a fixed degree. John M. Machacek |
| 2021 | Unlabelled ordered DAGs and labelled DAGs: constructive enumeration and uniform random sampling. Antoine Genitrini, Martin Pépin, Alfredo Viola |
| 2021 | Upper Bounds on the Boolean Rank of Kronecker Products. Ishay Haviv, Michal Parnas |
| 2021 | Valid inequalities and a branch-and-cut algorithm for the routing and spectrum allocation problem. Marcelo Bianchetti, Javier Marenco |
| 2021 | Valid inequalities and complete characterizations of the 2-domination and the Manuela Blaum, Javier Marenco |