XI Latin and American Algorithms, Graphs and Optimization Symposium

LAGOS 2021 will be held on May 17-21 2021, a virtual conference, originally scheduled to be in São Paulo, Brazil. The previous editions were held in Fortaleza, Brazil (GRACO 2001), Santiago, Chile (LACGA 2004), Angra dos Reis, Brazil (GRACO 2005), Puerto Varas, Chile (LAGOS 2007), Gramado, Brazil (LAGOS 2009), Bariloche, Argentina (LAGOS 2011), Playa del Carmen, Mexico (LAGOS 2013), Fortaleza, Brazil (LAGOS 2015), Marseille, France (LAGOS 2017), and Belo Horizonte, Brazil (LAGOS 2019). More information on the history of LAGOS can be found in the memory page.

This year's edition will be very special because we will celebrate the 70th birthday of our beloved Yoshiko Wakabayashi.

Scope and topics

Conference themes include, but are not limited to, the following AMS classifications:

• Algorithms and complexity: algorithms and computational complexity; approximation algorithms; randomized algorithms; computational geometry; parameterized complexity.
• Operations Research and Mathematical Programming: combinatorial optimization; integer programming; polyhedral combinatorics; operations research and management science.
• Graph Theory: cliques, dominating and independent sets; colorings; covering and packing, factorization, matching; digraphs, tournaments; graph algorithms; graphs and matrices; hypergraphs; perfect graphs; random graphs; structural characterization of graph classes.
• Applications to real-world problems: mathematical programming, combinatorial optimization, continuous optimization, heuristics, and metaheuristics.

🆕 April 16, 2021

We are thrilled to announce two great news.
First, there will be a best paper award in this edition of LAGOS!
Second, LAGOS will be produced by Virtual Chair on the Gather platform.

April 14, 2021

A preliminary version of the program is available.

April 14, 2021

There will be a minicourse of 3 hours, given by prof. Marcel Carli da Silva, about Some Discrete Aspects of Semidefinite Programming.

March 21, 2021

Registration is now open and the list of accepted papers is available.

November 23, 2020

After careful consideration, the Local Organizing Committee and the Steering Committee have decided that LAGOS 2021 will be held online.
It is unfortunate that we cannot meet in person, but we do expect to have a great event!

November 20, 2020

All authors interested in participating in LAGOS 2021 must submit a preliminary version of the paper until November 25, 2020.
This version must contain a good presentation of problems investigated, main results obtained and approaches used.
The paper can be updated until November 29, 2020.
The acceptance or rejection of the paper will be based on the last version that was submitted.

November 9, 2020

We are monitoring the Coronavirus outbreak situation.
We have not yet discarded the possibility of doing a physical conference, but in any case we will allow remote participation.

ps.: Submission deadline was postponed to November 25!

We are thrilled to announce that LAGOS 2021 will be produced by Virtual Chair on the Gather platform.

Kernelization results for equitable coloring Guilherme de Castro Mendes Gomes and Vinicius F. dos Santos
Target set selection with maximum activation time Lucas Keiler, Carlos Vinicius G. C. Lima, Ana Karolinna Maia, Rudini Sampaio and Ignasi Sau
On total coloring the direct product of complete graphs Diane Castonguay, Celina M. H. de Figueiredo, Luis A. B. Kowada, Caroline S. R. Patrão, Diana Sasaki and Mario Valencia-Pabon
The speed and threshold of the biased perfect matching game Ndiamé Ndiaye, Noah Brustle, Sarah Clusiau, Vishnu V. Narayan, Bruce Reed and Ben Seamone
Combinatorial properties for the green vehicle routing problem Matheus Diógenes Andrade and Fábio Luiz Usberti
On the inapproximability of the cable-trench problem Hugo Kooki Kasuya Rosado, Marcelo Pinheiro Leite Benedito and Lehilton Lelis Chaves Pedrosa
Tromino tilings with pegs via flow networks Javier Akagi, Eduardo Canale and Marcos Villagra
Bounds on the diameter of graph associahedra Jean Cardinal, Lionel Pournin and Mario Valencia-Pabon
Partitioning into prescribed number of cycles and mod k T-join with slack Salomon Bendayan, Yanjia Li, Bruce Reed and Jordan Barrett
Unique maximum independent sets in graphs on monomials of a fixed degree John Machacek
The speed and threshold of the biased Hamilton cycle game Ndiamé Ndiaye, Noah Brüstle, Sarah Clusiau, Bruce Reed, Ben Seamone and Vishnu V. Narayan
Treelength of series-parallel graphs Guillaume Ducoffe, Thomas Dissaux, Nicolas Nisse and Simon Nivelle
Instance optimal join size estimation Mahmoud Abo Khamis, Sungjin Im, Benjamin Moseley, Kirk Pruhs and Alireza Samadian
Diameter in linear time for constant-dimension median graphs Pierre Bergé and Michel Habib
Upper bounds on the boolean rank of kronecker products Ishay Haviv and Michal Parnas
Parameterized algorithms for locating-dominating sets Márcia R. Cappelle, Guilherme de Castro Mendes Gomes and Vinicius F. dos Santos
Biclique graphs of K₃-free graphs and bipartite graphs Marina Groshaus and André L. P. Guedes
Effective heuristics for the perfect awareness problem Felipe de C. Pereira, Pedro J. de Rezende and Cid C. de Souza
An efficient parameterized approximation scheme for the star k-hub center Marcelo P. L. Benedito and Lehilton L. C. Pedrosa
Unlabelled ordered DAGs and labelled DAGs: constructive enumeration and uniform random sampling Antoine Genitrini, Martin Pépin and Alfredo Viola
On the diameter of Schrijver graphs Adrián Pastine, Pablo Torres and Mario Valencia-Pabon
On structural parameterizations of the selective coloring problem Guilherme de Castro Mendes Gomes and Vinicius F. dos Santos
Codegree conditions for cycle decompositions and Euler tours in 3-uniform hypergraphs Simón Piga and Nicolás Sanhueza-Matamala
Local construction of connected plane subgraphs in graphs satisfying redundancy and coexistence Lucas Böltz, Benjamin Becker and Hannes Frey
Cycle factors in randomly perturbed graphs Julia Böttcher, Olaf Parczyk, Amedeo Sgueglia and Jozef Skokan
Hitting times for arc-disjoint arborescences in random digraph processes Maurício Collares, Yoshiharu Kohayakawa, Taísa Martins, Roberto Parente and Victor Souza
On total coloring of 4-regular circulant graphs Mauro Nigro Alves Junior, Diana Sasaki and Matheus Adauto
Intersection models for 2-thin and proper 2-thin graphs Flavia Bonomo-Braberman and Gastón Brito
The chromatic index of split-interval graphs Luis Gustavo Da Soledade Gonzaga, Sheila Almeida, Cândida Nunes Da Silva and Jadder Bismarck Sousa Cruz
Valid inequalities and a branch-and-cut algorithm for the routing and spectrum allocation problem Marcelo Bianchetti and Javier Marenco
On equitable total coloring of snarks Isabel F. A. Gonçalves, Simone Dantas and Diana Sasaki
Tridiagonal maximum-entropy sampling and tridiagonal masks Hessa Al-Thani and Jon Lee
Complete immersions in graphs with independence number two and small forbidden subgraphs Daniel A. Quiroz
Survival for a Galton-Watson tree with cousin mergers Laura Eslava, Sarah Penington and Fiona Skerman
The (a,b)-monochromatic transversal game on biclique-hypergraphs of powers of paths and of powers of cycles Wilder Mendes, Simone Dantas and Sylvain Gravier
Reversal and transposition distance of genomes considering flexible intergenic regions Klairton Lima Brito, Andre Rodrigues Oliveira, Alexsandro Oliveira Alexandrino, Ulisses Dias and Zanoni Dias
On feedback vertex set in reducible flow hypergraphs Luerbio Faria, André L. P. Guedes and Lilian Markenzon
Minimum number of bends of paths of trees in a grid embedding Vitor T. F. de Luca, Fabiano Oliveira and Jayme Szwarcfiter
Counting orientations of graphs with no strongly connected tournaments Fábio Botler, Carlos Hoppen and Guilherme Mota
The 2-Decomposition conjecture for a new class of graphs Andrea Jiménez, Maycon Sambinelli, Fábio Botler and Yoshiko Wakabayashi
An approximate blow-up lemma for sparse hypergraphs Peter Allen, Julia Böttcher, Ewan Davies, Eng Keat Hng and Jozef Skokan
Cliques in exact distance powers of graphs of given maximum degree Florent Foucaud, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr and Petru Valicov
A branch-and-price algorithm for the ring/ring problem Cecília Lescano Osório and Edna Hoshino
Consequences of APSP, triangle detection, and 3SUM hardness for separation between determinism and non-determinism Andrzej Lingas
Maximum number of r-edge-colorings such that all copies of K_k are rainbow Josefran de O. Bastos, Hanno Lefmann, Andy Oertel, Carlos Hoppen and Dionatan R. Schmidt
The signature matrix for 6-Pfaffian graphs Roberta Rasoviti Marques Costa Moço, Alberto Alexandre Assis Miranda and Cândida Nunes da Silva
Automating tree-like resolution in time n^{o(log n)} is ETH-Hard Susanna F. de Rezende
Turán density of cliques of order five in 3-uniform hypergraphs with quasirandom links Sören Berger, Simon Piga, Christian Reiher, Vojtěch Rödl and Mathias Schacht
Maximum size of r-cross t-intersecting families Pranshu Gupta, Yannick Mogge, Simon Piga and Bjarne Schülke
A new formulation for the weighted safe set problem Enrico Malaguti and Vagner Pedrotti
Graphs with two moplexes Clément Dallard, Robert Ganian, Meike Hatzel, Matjaž Krnc and Martin Milanič
Extending an integer formulation for the guillotine 2D bin packing problem Henrique Becker, Luciana Buriol and Olinto Araújo
Constrained colourings of random graphs Maurício Collares, Yoshiharu Kohayakawa, Carlos Moreira and Guilherme Mota
Polarity graphs and C₄-free multipartite graphs Claudia Gonçalves, Emerson Monte Carmelo and Irene Nakaoka
Valid inequalities and complete characterizations of the 2-domination and the P3-hull number polytopes Manuela Blaum and Javier Marenco
How to detect whether Shor's algorithm succeeds against large integers without a quantum computer Daniel Bastos and Luis Kowada
Tutte's 3-flow conjecture for almost even graphs Léo V. Peres and Ricardo Dahab
Recursive constructions of amoebas Adriana Hansberg, Amanda Montejano and Yair Caro
The crossing number of centrally symmetric complete geometric graphs Bernardo Abrego, Julia Dandurand and Silvia Fernandez

Authors are invited to submit original contributions in English with eight (8) single-column letter-size pages in the Elsevier ENTCS format. The submissions are expected to be fully self-contained (including references). In the case that the 8-page format is insufficient for the whole submission, authors are encouraged to place some of the material in an optional appendix. This appendix will not be published in the proceedings and hence should not be referenced within the body of the 8-page paper, but it will be used to evaluate the submission.

Simultaneous submission of papers to any other conference with published proceedings, as well as the submission of previously published papers, is not allowed. At least one author of each accepted papers must register for the conference to be included in the program.

The submission process must be completed electronically through EasyChair.

Proceedings

As in the last edition, the proceedings of LAGOS 2021 will be published by Elsevier in the ENTCS - Electronic Notes in Theoretical Computer Science series.

Special issue

Following the tradition of LAGOS, a special issue of Discrete Applied Mathematics will be prepared for LAGOS 2021 and all interested researchers will be invited to contribute to this special issue. If the submission to this special issue of DAM is an extended version of the LAGOS 2021 submission published in ENTCS, the contribution should differ substantially from the submission published in ENTCS (e.g., further results, material from the optional appendix, etc., can be added).

Check the call for papers.

Se você é pesquisador no estado de São Paulo, veja a chamada para apoio coletivo.