XIII Latin American Algorithms, Graphs, and Optimization Symposium – LAGOS 2025

10–14 November 2025 | Buenos Aires, Argentina

About LAGOS 2025

The Latin American Algorithms, Graphs, and Optimization Symposium (LAGOS) is a biennial event that brings together researchers and practitioners from around the world. Since 2001, LAGOS has served as a key forum for the exchange of ideas and collaboration. It is the merger of two Latin American conferences: the Brazilian Symposium on Graphs, Algorithms, and Combinatorics (GRACO) and the Latin American Conference on Combinatorics, Graphs, and Applications (LACGA). For more information about previous symposiums, visit the LAGOS series webpage

VENUE

Pabellón Cero + Infinito, Universidad de Buenos Aires, Buenos Aires, Argentina

Dates

November 10–14, 2025
(Monday to Friday)

Honorees

This special edition of LAGOS honors three distinguished scholars in celebration of their 60th birthdays

Guillermo Durán

Universidad de Buenos Aires, Argentina

Cláudia Linhares Sales

Universidade Federal do Ceará, Brazil

Fábio Protti

Universidade Federal Fluminense, Brazil

Plenary Speakers

Flavia Bonomo-Braberman

Universidad de Buenos Aires, Argentina

Sebastián Ceria

Fundar, Argentina
Real Racing Club de Santander, Spain

Mitre Dourado

Universidade Federal do Rio de Janeiro, Brazil

Rafael Epstein

Universidad de Chile, Chile

Mariana Escalante

Universidad Nacional de Rosario, Argentina

Mario Guajardo

NHH Norwegian School of Economics, Norway

Martine Labbé

Université Libre de Bruxelles, Belgium

Martin Milanič

University of Primorska, Slovenia

Irena Penev

Charles University, Czech Republic

Bruce Reed

Academia Sinica, Taiwan

Ana Silva

Università degli Studi di Firenze, Italy
Universidade Federal do Ceará, Brazil

Zoran Stanić

University of Belgrade, Serbia

Program

The program for LAGOS 2025 is now available with detailed schedules for the plenary talks, contributed sessions, and social events.

LAGOS 2025 Program

Download Program (PDF)

Scope and Topics

LAGOS 2025 invites submissions on a broad range of topics, including but not limited to:

  • Algorithms and Complexity: Approximation algorithms, computational complexity, parallel and distributed algorithms, parameterized complexity, computational geometry, randomized algorithms.
  • Operations Research and Optimization: Combinatorial optimization, integer programming, polyhedral combinatorics, heuristics and metaheuristics.
  • Graph Theory: Cliques, independent and dominating sets, colorings, covering and packing, matchings, digraphs, graph algorithms, graphs and matrices, hypergraphs, perfect graphs, random graphs, structural characterization of graph classes.
  • Applications: Mathematical programming, combinatorial optimization applied to areas such as logistics, scheduling, resource allocation, and other real-world problems.

Event Venue

Pabellón Cero + Infinito, Universidad de Buenos Aires, Argentina

The Pabellón Cero + Infinito at the Universidad de Buenos Aires is a modern, sustainable building with an abundance of natural light, creating an ideal setting for academic exchange and collaboration.

How to Get There?

You can reach it by public transport:

  • By Bus: Lines 28, 33, 34, 37, 42, 45, 107, 160, and 166.
  • By Train: The Belgrano Norte line (from Retiro Station), stopping at Ciudad Universitaria Station.

For complete directions from your location: Check on Google Maps

Accommodation

Recommended hotels with special rates for LAGOS 2025 participants

Recommended Neighborhoods

We recommend staying in the following neighborhoods, which are pleasant, safe, and reasonably close to Ciudad Universitaria: Núñez, Belgrano, Palermo, and Colegiales.

Urbanica Hoteles

USD 120 + VAT per night

Av. del Libertador 5690, Ciudad Autónoma de Buenos Aires

Standard rooms with double bed

Code: LAGOS 2025
Visit Website

KER Belgrano

USD 100 + VAT per night

Vuelta de Obligado 2727, Ciudad Autónoma de Buenos Aires

Single/Double room

[email protected]

Code: LAGOS 2025
Visit Website

Cristal Palace

USD 70 + VAT per night

Ciudad de la Paz 2550, Ciudad Autónoma de Buenos Aires

Single room

International guests paying with international cards are exempt from VAT

Code: LAGOS 2025
Visit Website

Hotel Pedraza

ARS 110,000 final per night

Manuela Pedraza 2189, Ciudad Autónoma de Buenos Aires

Single room

Code: LAGOS 2025
Visit Website

Monroe Suites

5% Discount

Av. Monroe 1555, Ciudad Autónoma de Buenos Aires

Apartments

Code: LAGOS25
Visit Website

Hotel Alpino

10% Discount

Cabello 3318, Ciudad Autónoma de Buenos Aires

Mention you are attending LAGOS conference when booking

Visit Website

Hotel Juramento

10% Discount

Av. Juramento 2666, Ciudad Autónoma de Buenos Aires

Mention you are attending LAGOS conference when booking

Visit Website

Visitor Information

Practical details for your travel and stay in Buenos Aires.

Public transport

Public transportation in Buenos Aires and the surrounding areas consists of buses, subways, and trains.

  • Buses & Subways: Can be paid for with the SUBE card. In subways and on most buses, contactless debit or credit cards are also accepted. Cash is not accepted at boarding.
  • Trains: Can be paid for using the SUBE card or in cash.

SUBE card

The SUBE card can be purchased and recharged at both airports, most subway stations and other authorized locations (information available in Spanish only).

Travel apps

BA Taxi is the official Buenos Aires city app for requesting a taxi.

Uber, Cabify, and DiDi are also available and widely used.

More Info

Ecobici: Official City Cycling Guide

Tourism: Official City Tourism Site

Social Events

We are hosting two optional events on Wednesday, November 12. Registration is required.

Conference Excursion

A guided boat tour of the Paraná Delta and Río de la Plata.

Price: USD 40 / ARS 58,000

Payment: Cash only (USD or ARS) at registration.

Conference Dinner

Join us at La Escondida a traditional Argentine steakhouse.

Price: USD 30 / ARS 43,500

Payment: Cash only (USD or ARS) at registration.

Register for Events

Full details (times, locations, menus) and the registration form are available at the link below.

Registration closes Monday, November 10.

View Details & Registration Form

Important Dates

Please note: The Submission, Decision Notification, and Camera-Ready deadlines have been extended!

Milestone Date
Submission Deadline May 10, 2025 (extended)
Decision Notification July 30, 2025 (extended)
Camera-Ready Version Deadline August 20, 2025 (extended)
Early Bird Registration Deadline October 7, 2025
Event Dates November 10–14, 2025

All deadlines are at 23:59 Anywhere on Earth (AoE, UTC -12) Time Zone. To learn more, refer to this page.

Accepted Papers

Proceedings will be published in Procedia Computer Science (Elsevier)

We are pleased to announce the papers that have been accepted for presentation at LAGOS 2025:

  • Susanne Albers, Waldo Gálvez and Ömer Behic Özdemir. On the 2D Demand Bin Packing Problem: Hardness and Approximation Algorithms
  • Luiz Emilio Allem, Rodrigo O. Braga, Bruno Scaratti and Lucas Sibemberg. Minimum Number of Distinct Eigenvalues of Sunlet Graphs
  • Peter Allen, Julia Böttcher and Jasmin Katz. Universality for degenerate hypergraphs
  • Oleksiy Al-saadi and Joseph Natal. Diameter constraints in 2-distance graphs
  • Bruno Amezcua-Osorio, César Hernández-Cruz, Seyyed Aliasghar Hosseini, Humberto Lozano-Chávez and Gary MacGillivray. Cops and Robbers on Token Graphs
  • Sergio Anglada, Carmen Galé and Juan José Salazar-González. Generalized Capacitated Vertex Separator Problem: models and algorithms
  • Rieli Araújo, Celina Herrera de Figueiredo, Diana Sasaki and Simone Dantas. Type 1 and Type 2 Kochol superposition snarks
  • Júlio Araújo, César Hernández-Cruz and Cláudia Linhares Sales. Maya-Tupi graphs: a generalization of split graphs
  • Júlio Araújo, Nicolas Nisse and Lucas Picasarri-Arrieta. Backbone colouring of chordal graphs
  • Gabriela Araujo-Pardo and Mirabel Mendoza-Cadena. Constructions of Small Regular Mixed Graphs with Girth 5 and 6
  • Laurent Beaudou, Henry Echeverría, Florent Foucaud, Andrea Jiménez, Nikita Manuylenko and Anirudh Rachuri. A polynomial-time algorithm recognizing exact cubes of trees
  • Germán Benítez-Bobadilla, Fernando Esteban Contreras-Mendoza, Juan Carlos García-Altamirano, César Hernández-Cruz and Juan José Montellano-Ballesteros. Partitioning P5-free graphs into an independent set and a complete multipartite graph
  • Federico Bertero and Javier Marenco. An initial polyhedral study of the DR-AOV formulation for the routing and spectrum allocation problem
  • Kenny Bešter Štorgel, Nina Chiarelli, Lara Fernández, J. Pascal Gollin, Claire Hilaire, Valeria Leoni and Martin Milanič. On {k}-Roman graphs
  • Ronak Bhadra and Raghunath Tewari. Trading Determinism for Time: The k-Reach Problem
  • Flavia Bonomo-Braberman, Ignacio Maqueda and Nina Pardal. Trees with proper thinness 2
  • Prosenjit Bose, Guillermo Esteban and Tyler Tuttle. Computational aspects of disks enclosing many points
  • Guilherme Adamatti Bridi, Franklin de Lima Marquezino and Celina Herrera de Figueiredo. A Weight Function Lemma Heuristic for Graph Pebbling
  • Caroline Brosse, Nicolas Martins, Nicolas Nisse and Rudini Sampaio. The Graph Coloring Game on 4×n-Grids
  • Dipayan Chakraborty and Annegret Wagler. The Interplay Between Domination and Separation in Graphs
  • Juhi Chaudhary, Ignasi Sau and Meirav Zehavi. A Parameterized Perspective on Uniquely Restricted Matchings
  • Alexander Clifton, George Kontogeorgiou, Taruni Sai Sridhar and Ana Trujillo-Negrete. Rainbow separating path systems
  • Pablo Coll and Ernesto López. Optimized Routing for Residential Waste Collection in Mixed-Density Areas
  • Giovanna Kobus Conrado, Amir Kafshdar Goharshady, Harshit Jitendra Motwani and Sergei Novozhilov. Combinatorial Parameterized Algorithms for Chemical Descriptors based on Molecular Graph Sparsity
  • María Gracia Cornet, Tanja Dravec and Pablo Torres. Domination in Johnson graphs
  • Camilo D'Aloisio, Guillermo Durán and Nazareno Faillace Mullen. A solution approach to districting modification and route optimization in waste collection
  • Edmilson Pereira da Cruz, Marina Groshaus and André Luiz Pires Guedes. Inclusion graphs of biclique parts of K3-free graphs
  • Claudia Marlene de la Cruz Torres and Miguel Pizaña. New lower bounds for the order of cages
  • Caroline de Paula Silva, Cândida Nunes da Silva and Orlando Lee. Acyclic α-diperfect digraphs with stability number two
  • Dominique de Werra, Sebastián Urrutia and Lucas Assunção. Minimizing breaks in incomplete round-robin tournaments
  • Diego Delle Donne and Javier Marenco. A first exploration of the split-interval coloring polytope
  • Henry Echeverría, Andrea Jiménez, Suchismita Mishra, Adrián Pastine, Daniel Quiroz and Mauricio Yépez. On complete immersions and topological bounds
  • Henry Echeverría, Andrea Jiménez, Suchismita Mishra, Daniel Quiroz and Mauricio Yépez. Totally odd immersions of complete graphs in graph products
  • Manuel A. Espinosa-García, Miguel Raggi and Edgardo Roldán-Pensado. Realizable signatures in upward pointset embeddings of directed paths
  • Luerbio Faria, Mauro Nigro and Diana Sasaki. Strong conformable coloring: the conformable coloring for Type 1 graphs
  • Cristina Fernandes and Felipe Noronha. How to go from partial to full retroactivity in detail
  • Eder Figueiredo and Vinícius dos Santos. Game chromatic number of split and threshold graphs
  • Natan Figueiredo, Luerbio Faria, Vinícius dos Santos and Uéverton Souza. On musical arrangement problems time complexity
  • Constanza Gacitúa Fuentes, Nikolas Jara Cádiz, Pablo Opazo Salazar, Nicolás Sanhueza-Matamala and Christopher Thraves Caro. Partitioning problems in concave-round digraphs and tournaments
  • Ana Gargantini, Adrián Pastine and Pablo Torres. On the structure and diameter of graph associahedra of graphs with a set of true twins
  • Ana Gargantini, Adrián Pastine, Pablo Torres and Mario Valencia-Pabon. Spectral properties of stellohedra
  • Cyril Gavoille and Amaury Jacques. Lower Bounds for Induced-Universal Graphs
  • Arthur Correia Gomes and Yoshiko Wakabayashi. Minimum-density locating-dominating sets on infinite hexagonal grids with bounded height
  • Guilherme de Castro Mendes Gomes, Laila Melo Vaz Lopes and Vinícius dos Santos. Some complexity results on cycle-convex partitions
  • Mariana Escalante, Victoria Kaial and Annegret Wagler. Stretching Operations Applied to Cliques of Edge Intersection Graphs of Paths in Trees
  • Mariana Escalante, María Inés Lopez Pujato and Paola Tolomei. On total {k}-domination on caterpillar graphs
  • Milene Gutiérrez, Nicolás Sanhueza-Matamala and Christopher Thraves Caro. Vertex-separating path systems in trees
  • Daniel Jaume, Diego Martinez, Cristian Panelo and Kevin Pereyra. k-Sachs-Critical Graphs
  • Ján Karabáš, Edita Máčajová, Roman Nedela and Martin Škoviera. Colouring defect of strong snarks
  • Ján Karabáš, Edita Máčajová, Roman Nedela and Martin Škoviera. Short cycle covers and the colouring defect of a cubic graph
  • Ivo Koch, Nina Pardal and Vinícius dos Santos. Exploring subgraph complementation to bounded degree graphs
  • George Kontogeorgiou, Matías Pavez-Signé, Maya Stein, Taruni Sai Sridhar and Ana Trujillo-Negrete. Separating edges by linearly many subdivisions
  • George Kontogeorgiou, Giovanne Santos and Maya Stein. Degree conditions for embedding antidirected trees in digraphs
  • Raul Lopes and Ignasi Sau. Finding subdigraphs in digraphs of bounded directed treewidth
  • Mauro Lucci, Diego Delle Donne and Mariana Escalante. Integer linear programs for the power dominating set problem with channel limitation
  • Mauro Lucci, Graciela Nasini, Paola Tolomei and Luis Miguel Torres. New framework for conflict-free coloring of hypergraphs and other graph coloring problems
  • Robert Lukoťka and Makuochukwu Felix Oguagbaka. Perfect versus imperfect matching covers of cubic graphs
  • Edita Máčajová and Martin Škoviera. Are there any permutation snarks on 6 (mod 8) vertices?
  • Javier Marenco. A polyhedral study of the berth allocation problem with tides
  • Bruno Marinho and Ana Silva. Recognizing IO-RDV graphs in polynomial time
  • Erika Morais Martins Coelho, Hebert Coelho, Luerbio Faria, Mateus de Paula Ferreira and Sulamita Klein. The oriented chromatic number of a wheel and of the disjoint union of a wheel with a complete graph
  • Walner Mendonça, Meysam Miralaei and Guilherme Mota. Graphs with asymmetric Ramsey properties
  • Fabricio Mendoza Granada and David Manlove. Total b-chromatic Colouring of Graphs
  • Pablo Romero. Most reliable two-terminal graphs with distance constraints
  • Pablo Romero and Louis Petingi. Construction of infinitely many trace-minimal graphs with maximum number of spanning trees
  • Benjamin Rossman. Riffle Rank
  • Daniel Saad Nogueira Nunes, Felipe Louza and Guilherme Telles. Space-Efficient Lyndon Array Construction from Compressed Texts
  • Martín Safe and Martina Vergara. Graphs whose line graph square is Pk-free
  • Jiahui Shao, Dennis Wong, Ruizhe Zhou and Wei Ke. Generating a cyclic 3-Gray code for integer partitions with maximum parts in constant amortized time

Call for Papers — Submissions Now Open

Special Issue of Discrete Applied Mathematics

Milestone Date
Submission Deadline May 31, 2026

Following the tradition of the Latin American Algorithms, Graphs, and Optimization Symposia (LAGOS), a special issue of Discrete Applied Mathematics will be dedicated to LAGOS 2025.

Submissions of contributions not presented at the symposium are also welcome. If your contribution was presented at the symposium, the full version article should differ substantially from the extended abstract published in Procedia Computer Science (e.g., proofs of the results, further results, etc., can be added). All articles will be thoroughly refereed according to the high standards of Discrete Applied Mathematics.

Topics

The topics should relate to the themes of the conference:

  • Algorithms and Complexity: Algorithms and computational complexity; approximation algorithms; randomized algorithms; parameterized complexity.
  • Operations Research and Mathematical Programming: Combinatorial optimization; integer programming; operations research; management science.
  • Graph Theory: Structural graph theory; graph algorithms; extremal graph theory; spectral graph theory; probabilistic graph theory.
  • Combinatorial Geometry: Discrete geometry; convex geometry; polyhedral combinatorics; computational geometry.
  • Applications to Real-world Problems: Mathematical programming; combinatorial optimization; continuous optimization; heuristics; metaheuristics.

Submission Information

Guide for Authors:
https://www.elsevier.com/journals/discrete-applied-mathematics/0166-218x/guide-for-authors

Full papers must be submitted through the Elsevier Editorial Manager System.

Please see the Author Instructions on the Journal website if you have not yet submitted a paper through this web-based system.

When submitting your paper, be sure to specify that the paper is a contribution for the special issue by selecting the article type "LAGOS 2025".

Accepted papers will be published online individually, before print publication.

Guest Editors

  • Luciano N. Grippo, Universidad Nacional de General Sarmiento, Argentina
  • Martín D. Safe, Universidad Nacional del Sur, Argentina

We appreciate your consideration and look forward to receiving your contribution.

Committees

Steering Committee

  • Flavia Bonomo-Braberman, Universidad de Buenos Aires, Argentina
  • Manoel Campêlo, Universidade Federal do Ceará, Brazil
  • Guillermo Durán, Universidad de Buenos Aires, Argentina
  • Celina Herrera de Figueiredo, Universidade Federal do Rio de Janeiro, Brazil
  • Martín Matamala, Universidad de Chile, Chile
  • Miguel Pizaña, Universidad Autónoma Metropolitana, Mexico

Emeritus Steering Committee

  • Thomas Liebling, École Polytechnique Fédérale de Lausanne, Switzerland
  • Jayme Luiz Szwarcfiter, Universidade Federal do Rio de Janeiro, Brazil

General Chairs of LAGOS 2025

  • Luciano Grippo, Universidad Nacional de General Sarmiento, Argentina
  • Martín Safe, Universidad Nacional del Sur, Argentina

Organizing Committee

  • Ayelén Alcantar, Universidad de Buenos Aires, Argentina
  • Eric Brandwein, Universidad de Buenos Aires, Argentina
  • Lucía Busolini, Universidad de Buenos Aires, Argentina
  • Viviana Díaz, Universidad Nacional del Sur, Argentina
  • Ayelén Dinkel, Universidad de Buenos Aires, Argentina
  • Luciano Grippo, Universidad Nacional de General Sarmiento, Argentina
  • Min Chih Lin, Universidad de Buenos Aires, Argentina
  • Ignacio Maqueda, Universidad de Buenos Aires, Argentina
  • Verónica Moyano, Universidad Nacional de General Sarmiento, Argentina
  • Germán Sabatini, Universidad Nacional del Sur, Argentina
  • Martín Safe, Universidad Nacional del Sur, Argentina
  • Rocío Suárez Albanesi, Universidad Nacional del Sur, Argentina
  • Camilo Vera, Universidad de Buenos Aires, Argentina
  • Martina Vergara, Universidad Nacional del Sur, Argentina

Program Committee

  • Frédérique Bassino, Université Sorbonne Paris Nord, France
  • Julia Boettcher, The London School of Economics and Political Science, United Kingdom
  • Victor Campos, Universidade Federal do Ceará, Brazil
  • Héctor Cancela, Universidad de la República, Uruguay
  • Pablo De Caria, Universidad Nacional de La Plata, Argentina
  • José Correa, Universidad de Chile, Chile
  • Florencia Cubria, Universidad de la República, Uruguay
  • Simone Dantas, Universidade Federal Fluminense, Brazil
  • Ezequiel Dratman, Universidad Nacional de General Sarmiento, Argentina
  • Tınaz Ekim, Boğaziçi Üniversitesi, Turkey
  • Cristina G. Fernandes, Universidade de São Paulo, Brazil
  • Silvia Fernández-Merchant, California State University, USA
  • Luciano Grippo (co-chair), Universidad Nacional de General Sarmiento, Argentina
  • Marina Groshaus, Universidade Federal do Paraná, Brazil
  • Frédéric Havet, Centre Inria d'Université Côte d'Azur, France
  • Carlos Hoppen, Universidade Federal do Rio Grande do Sul, Brazil
  • Marcos Kiwi, Universidad de Chile, Chile
  • Sulamita Klein, Universidade Federal do Rio de Janeiro, Brazil
  • Valeria Leoni, Universidad Nacional de Rosario, Argentina
  • Paloma Lima, IT University of Copenhagen, Denmark
  • Min Chih Lin, Universidad de Buenos Aires, Argentina
  • Carla Lintzmayer, Universidade Federal do ABC, Brazil
  • Javier Marenco, Universidad Torcuato Di Tella, Argentina
  • Antonio Mauttone, Universidad de la República, Uruguay
  • María Pía Mazzoleni, Universidad Nacional de La Plata, Argentina
  • Amanda Montejano, Universidad Nacional Autónoma de México, Mexico
  • Natasha Morrison, University of Victoria, Canada
  • Lucia Moura, University of Ottawa, Canada
  • Verónica Moyano, Universidad Nacional de General Sarmiento, Argentina
  • Graciela Nasini, Universidad Nacional de Rosario, Argentina
  • Nicolas Nisse, Centre Inria d'Université Côte d'Azur, France
  • Deborah Oliveros, Universidad Nacional Autónoma de México, Mexico
  • Daniel Panario, Carleton University, Canada
  • Michal Parnas, Academic College of Tel-Aviv-Yaffo, Israel
  • Adrián Pastine, Universidad Nacional de San Luis, Argentina
  • Lehilton Pedrosa, Universidade Estadual de Campinas, Brazil
  • Miguel Pizaña, Universidad Autónoma Metropolitana, Mexico
  • Sergio Rajsbaum, Universidad Nacional Autónoma de México, Mexico
  • Martín Safe (co-chair), Universidad Nacional del Sur, Argentina
  • Gelasio Salazar, Universidad Autónoma de San Luis Potosí, Mexico
  • Vinicius dos Santos, Universidade Federal de Minas Gerais, Brazil
  • Roberto Solis-Oba, The University of Western Ontario, Canada
  • Sophie Spirkl, University of Waterloo, Canada
  • Nicolas Stier-Moses, Meta, USA
  • Paola Tolomei, Universidad Nacional de Rosario, Argentina
  • Mario Valencia-Pabon, Université de Lorraine, France
  • Alfredo Viola, Universidad de la República, Uruguay
  • Annegret Wagler, Université Clermont Auvergne, France
  • Yoshiko Wakabayashi, Universidade de São Paulo, Brazil
  • José Zamora, Universidad Andrés Bello, Chile

Registration

Registration Fees

Registration Type Deadline Fee (USD)
Discount Rate Until September 19, 2025 (extended) $250
Early Bird Until October 7, 2025 $280
Regular Rate After October 7, 2025 $310

Student Discount: Students receive a 50% discount on all registration rates.

Payment Confirmation Notice: After completing your payment, you will receive an official invoice/receipt via email within a few business days. Receipt generation is handled manually by an administrative team to ensure accuracy.

International Participants (Payment in USD)

Please use the following link to complete your registration and payment in USD.

Register and Pay in USD

Residents in Argentina (Payment in ARS)

Please use the following link to complete your registration and payment in ARS.

Register and Pay in ARS

Contact us