Skip to article frontmatterSkip to article content
Site not loading correctly?

This may be due to an incorrect BASE_URL configuration. See the MyST Documentation for reference.

Hoang La

About me [1][2]

I am a researcher in graph theory.

I graduated from the Theoretical Computer Science Department of the École Normale Supérieure de Lyon (ENS Lyon), France in 2019.

I finished my Ph.D. thesis on 2-distance coloring of sparse graphs at the Laboratoire d'Informatique, de Robotique, et de Microélectronique de Montpellier (LIRMM), France under the supervision of Mickael Montassier, Alexandre Pinlou, and Petru Valicov in 2022.

I was a post-doc with Piotr Micek in the Theoretical Computer Science group at the Uniwersytet Jagielloński in Kraków, Poland between 2022 and 2023.

I became a Maître de Conférences at the Université Paris-Saclay in France in 2023. Research-wise, I work in the Graphs, Algorithms, and Combinatorics (GALaC) group at the LISN. Teaching-wise, I work at the Computer Science Department of the Institut Universitaire de Technologie d'Orsay (IUT Orsay).

Profile picture

My current projects

Structural graph theory

Graph coloring

Graph reconstruction

Poset dimension

Footnotes

  1. for research, firstname.lastname.research[at]gmail.com, firstname.lastname[at]universite-paris-saclay.fr otherwise.

    ↩

  2. not to be confused with my brother Hoan La, also working in combinatorics.

    ↩
Hoang La
Research