#### XII Latin-American Algorithms, Graphs and Optimization Symposium

###### Huatulco, México. September 18-22, 2023

## Invited Speakers

### Federico Ardila, San Francisco State University, USA

Federico Ardila Mantilla is a Colombian mathematician and musician, interested in the intersection between Combinatorics, Geometry, and Algebra. Federico received his Ph.D. from the Massachusetts Institute of Technology, and he is currently a professor at the San Francisco State University, and La Universidad de Los Andes. He was an Invited Speaker at the International Congress of Mathematicians 2022, he is a Fellow of the American Mathematical Society (AMS), winner of the CAREER Award of the National Science Foundation, the National Haimo Award for Teaching of the Mathematical Association of America, and the Mathematics Programs that Make a Difference Award, of the AMS. He has been advisor of more than 50 graduate students, and he is co-director of MSRI-UP, a research program for students from racial and ethnic minorities in the United States. In all aspects of his work, Federico seeks to contribute to the construction of an increasingly inclusive and equitable mathematical community.

### Maria Axenovich, Karlsruhe Institute of Technology, Germany

Maria Axenovich was born in Novosibirsk, Russia, where she did her undergraduate studies. After completing her PhD at the University of Illinois at Urbana-Champaign, USA, in 1999, under the guidance of Zoltan Fűredi, and having a couple of long-term research visits, she was a professor at Iowa State University, Ames, IA, USA. Since 2012 she has been employed as a chair of the Discrete Mathematics group at the Karlsruhe Institute of Technology, Germany. She serves as an associate editor of the journal Order and as an editor in chief of the Electronic Journal of Combinatorics. Maria works on extremal problems in graphs and set systems.

### Jesús de Loera, University of California Davis, USA (Cancelled)

Jesús A. De Loera is a professor of Mathematics at the University of California, Davis. In recognition of his contributions to Discrete Mathematics and Optimization, he was elected fellow of both the American Mathematical Society (AMS) and the Society of Industrial and Applied Mathematics (SIAM). He is a winner of the 2020 Farkas Prize of the INFORMS optimization society. For his teaching and mentoring he won the Distinguished Teaching Award of the College of Letters and Science and the Golden Section Teaching award from the Mathematical Association of America. He is currently vice-president of AMS and editor of journals for SIAM and the Sociedad Matemática Mexicana. He has mentored more than 20 Ph.D students and 60 undergraduates.

### Ruy Fabila, Cinvestav, Instituto Politécnico Nacional, México

Ruy Fabila-Monroy obtained his B.Sc. in Computer Science from the Universidad Nacional Autónoma de México (UNAM), as well as his M.Sc. and Ph.D. in Mathematics. After receiving his Ph.D., he was awarded an Australia’s Endeavour Fellowship at the University of Melbourne. Ruy currently is a 3C researcher in the Centro de Investigación y de Estudios Avanzados del IPN (CINVESTAV). He is a Level III National Researcher at the prestigious Sistema Nacional de Investigadores (SNI) of the Consejo Nacional de Ciencia y Tecnología. His interests stand in the intersection of Combinatorial Geometry, Graph Theory and Computational Geometry; his main line of research has been Erdös-Szekeres type problems, order types on point sets, rectilinear crossing numbers and token graphs.

### Celina Figueiredo, Universidade Federal do Rio de Janeiro, Brazil

Celina Miraglia Herrera de Figueiredo received a B.Sc. and an M.Sc. in Mathematics from PUC-Rio, an M.Sc. in Mathematics from UMIST-UK, and a D.Sc. in Computer Science from COPPE-UFRJ. Celina joined the Federal University of Rio de Janeiro (UFRJ) as assistant professor in the Computer Science Department of the Mathematics Institute, and she is now a full professor at the Systems Engineering and Computer Science Program of COPPE, also at UFRJ. She is a CNPq research fellow in Computer Science and a FAPERJ "Cientista do Nosso Estado" fellow. She received the Giulio Massarani COPPE Award for Academic Merit and the COPPE Fifty Years Award. She is a member of the editorial board of RAIRO Theoretical Informatics and Applications and of RAIRO Operations Research. She has recently been elected a member of the Brazilian Academy of Sciences.

A Perfect Path from Computational Biology to Quantum Computing

### Pavol Hell, Simon Fraser University, Burnaby, Canada

Pavol Hell is a Professor Emeritus of Computing Science at Simon Fraser University in Burnaby. After his mathematical studies at Charles University in Prague, he obtained his MSc at McMaster University in Hamilton, and his PhD at the Université de Montréal. Prior to joining SFU, Pavol was an associate professor at Rutgers University in New Brunswick; he has also held visiting positions at a number of universities in Brazil, France, Italy, and the Czech Republic. He was a long term managing editor of the Journal of Graph Theory, and sits on the editorial boards of several other journals. He was named a SIAM Fellow, class of 2012. His area of interest is "computational combinatorics", including algorithmic graph theory and complexity of graph problems. His current focus is on nicely structured graph and digraph classes, and on the complexity of various versions of graph and digraph homomorphism problems.

### Deborah Oliveros, Universidad Nacional Autónoma de México, México

Deborah Oliveros Braniff received her B.A., M.A., and Ph.D. in Mathematics from the Universidad Nacional Autónoma de México (UNAM). She was a postdoctoral fellow at the University of Calgary, in Canada, where she held an academic position for 7 years. In 2005, she joined the Instituto de Matemáticas at UNAM, where she is now a “Titular B” researcher. Deborah is a fellow of the Academia Mexicana de Ciencias, a Level III national researcher at the prestigious Sistema Nacional de Investigadores (SNI), and she is founding member and current director of the Unidad Juriquilla del Instituto de Matemáticas, in Querétaro, Mexico. Her research interests center in Discrete and Computational Geometry, as well as in Convexity. Her main contributions follow paths on Helly-type Problems, Transversal Theory, Convex and Abstract Polytopes and Construction of Bodies of Constant Width.

Tverberg type Theorems: The study of partitions of points as simplicial complexes

### Gelasio Salazar, Universidad Autónoma de San Luis Potosí, México

After obtaining B.Sc. and M.Sc. degrees in Physics, Gelasio Salazar received his Ph.D. in Mathematics in Ottawa. He held a postdoctoral position at Georgia Tech, and was visiting professor at the Ohio State University and at the University of Waterloo. He has been a professor at the Institute of Physics at the Universidad Autónoma de San Luis Potosí for over 20 years. Gelasio started working in Topological Graph Theory in the boom of the early 1990s, after the Robertson and Seymour proof of Wagner's Conjecture. Later on he also got interested in Geometric Graph Theory, and in the application of Probabilistic and Extremal Graph Theory techniques in both Geometric and Topological Graph Theory. As part of a midlife crisis he has stubbornly (and sometimes successfully) tried to shed some light on some classical Knot Theory problems using elementary combinatorial techniques.

From two dimensions to three dimensions: applications of graph theory to knot theory

### Maya Stein, Universidad de Chile, Chile

Maya Stein is a full professor at the University of Chile. Her research interests include Extremal Combinatorics, Structural Graph Theory, Combinatorial Algorithms and Complexity, and Infinite Graphs and Groups. She has published over 50 research papers in internationally peer-reviewed journals, and has served on the program committees for various conferences in Discrete Mathematics and Theoretical Computer Science. She currently serves as an editor for the Electronic Journal of Combinatorics, the SIAM Journal on Discrete Mathematics, Orbita Mathematicae and the soon-to-be-launched Innovations in Graph Theory. She was recently elected vice chair of the SIAM Activity group in Discrete Mathematics, and has served on the scientific committees of the Math- and SticAmSud Program of the Chilean Mathematical Society. She has led and participated in a number of nationally or internationally funded projects, and is the deputy director as well as the academic director of the Center for Mathematical Modeling (Chile).

### Jayme Luiz Szwarcfiter, Universidade Federal do Rio de Janeiro, Brazil

Jayme Szwarcfiter received his PhD from the University of Newcastle upon Tyne, England, and held postdoctoral positions at the University of California, Berkeley, USA, and the University of Cambridge, England. Jayme is an Emeritus Professor at the Federal University of Rio de Janeiro, Brazil, and, at the moment, he is also Visiting Professor at the State University of Rio de Janeiro. He is a member of the Brazilian Academy of Sciences. Some of his former students are distinguished scholars of renowned institutions around the world. His main interests are Graph Theory and Algorithms, besides Computational Complexity.