Hoang La (Lã Xuân Hoàng)
Researcher in combinatorics,
currently Maître de Conférences at the University of Paris-Saclay in France.
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 started my position as a Maître de Conférences at the Université Paris-Saclay in France in 2023. Research-wise, I work at the Laboratoire Interdisciplinaire des Sciences du Numérique (LISN) in the Graphs, Algorithms, and Combinatorics (GALaC) group. Teaching-wise, I work at the Institut Universitaire de Technologie d'Orsay (IUT Orsay).
My research interest
Graph coloring in sparse graphs.
Structural graph theory.
Poset dimension theory.
My current projects
Weak coloring numbers of minor-closed graph classes.
Dimension of planar posets with bounded number of minimum elements.
Graph reconstruction with subgraph queries.
Elimination distance.
Fractional domatic numbers.
Diameter coloring.
Odd coloring.
Publications
17) Jędrzej Hodor, Hoang La, Piotr Micek, and Clément Rambaud.
Weak coloring numbers of minor-closed graph classes.
Preprint: Coming Soon.
16) Jędrzej Hodor, Hoang La, Piotr Micek, and Clément Rambaud.
Quickly excluding an apex forest.
Preprint: Coming Soon.
15) Kacper Kluk, Hoang La, and Marta Piecyk.
Graph Reconstruction with Connectivity Queries.
Preprint: Coming Soon.
14) Lech Duraj, Ross J. Kang, Hoang La, Jonathan Narboni, Filip Pokrývka, Clément Rambaud, and Amadeus Reinald.
The χ-binding function of d-directional segment graphs.
Preprint: arXiv:2309.06072
13) Vida Dujmović, Robert Hickingbotham, Jędrzej Hodor, Gweanël Joret, Hoang La, Piotr Micek, Pat Morin, Clément Rambaud, and David R. Wood.
The grid-minor theorem revisited.
Conference version: SODA, 2024.
12) Marcin Briański, Jędrzej Hodor, Hoang La, Piotr Micek, and Katzper Michno.
Boolean Dimension of a Boolean Lattice.
Order, 2024.
11) Hoang La and Kenny Storgel.
2-distance, injective, and exact square coloring of planar graphs with maximum degree 4.
Discrete Mathematics, 346(8):113405, 2023.
10) Hoang La and Petru Valicov.
Computer assisted discharging procedure on planar graphs: application to 2-distance coloring.
Preprint: arXiv:2202.03885
9) Kolja Knauer, Hoang La, and Petru Valicov.
Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth.
Electronic Journal of Combinatorics, 29(4):P4.16, 2022.
8) Hoang La, Borut Luzar, and Kenny Storgel.
Further extensions of Grötzsch Theorem.
Discrete Mathematics, 345(6):112849, 2022.
7) Hoang La and Mickael Montassier.
2-distance list (Δ+2)-coloring of planar graphs with girth at least 10.
Journal of Combinatorial Optimization. 44:1356–1375, 2022.
6) Hoang La and Mickael Montassier.
2-distance (Δ + 2)-coloring of sparse graphs.
Preprint: arXiv:2109.11927
5) Hoang La and Mickael Montassier.
2-distance 4-coloring of planar subcubic graphs with girth at least 21.
Preprint: arXiv:2106.03587v1
4) Hoang La.
2-distance list (Δ + 3)-coloring of sparse graphs.
Graphs and Combinatorics, 38:167, 2022.
3) Hoang La and Mickael Montassier.
2-distance (Δ + 1)-coloring of sparse graphs using the potential method.
Preprint: arXiv:2103.11687v2
2) Valentin Bartier, Laurine Bénéteau, Marthe Bonamy, Hoang La, and Jonathan Narboni.
A note on deterministic zombies.
Discrete Applied Mathematics, 301:65-68, 2021.
1) Hoang La, Mickael Montassier, Alexandre Pinlou, and Petru Valicov.
r-hued (r + 1)-coloring of planar graphs with girth at least 8 for r ≥ 9.
European Journal of Combinatorics, 91:103219, 2021.
Talks
Conferences
(9PCC) The 9th Polish Combinatorial Conference, Będlewo, Poland, September 2022.
Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth.(ICGT22) The 11th International Colloquium on Graph Theory and combinatorics, Montpellier, France, July 2022.
Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth.(JGA21) Journées Graphes et Algorithmes 2021, Online, November 2021.
2-distance (Δ + 1)-coloring of sparse graphs using the potential method.(EUROCOMB21) European Conference on Combinatorics, Graph Theory and Applications 2021, Barcelona, Spain, September 2021.
2-distance (Δ + 1)-coloring of sparse graphs using the potential method.(JGA20) Journées Graphes et Algorithmes 2020, Online, November 2020.
A computer-assisted discharging method: application to 2-distance coloring.(BGW19) Bordeaux Graph Workshop 2019, Bordeaux, France, October 2019.
r-hued (r + 1)-coloring of planar graphs with girth at least 8 for r ≥ 9.(JGA19) Journées Graphes et Algorithmes 2019, Brussels, Belgium, November 2019.
r-hued (r + 1)-coloring of planar graphs with girth at least 8 for r ≥ 9.
Seminars
TCS, Jagiellonian University, Krakow, Poland, April 17, 2024.
Graph reconstruction with connectivity queries.Combinatorics, Graph Theory, and Ordered Sets, Faculty of Mathematics and Information Science, Warsaw, Poland, January 21, 2024.
The χ-binding function of d-directional segment graphs.GALaC, LISN, Gif-sur-Yvette, France, November 10, 2023.
The χ-binding function of d-directional segment graphs.GALaC, LISN, Gif-sur-Yvette, France, April 28, 2023.
Boolean dimension of boolean lattices.TCS, Jagiellonian University, Krakow, Poland, November 16, 2022.
On Barnette's Conjecture for directed graphs.AlGCo, LIRMM, Montpellier, France, March 10, 2022.
The potential method in graphs with a bounded maximum average degree.GT Graphes et Optimisation, LABRI, Bordeaux, France, October 29, 2021.
Further extensions of Grötzsch Theorem.AlGCo, LIRMM, Montpellier, France, December 17, 2020.
A computer-assisted discharging method: application to 2-distance coloring.
Teaching
IUT Orsay
Fall 2023 – Spring 2024. Unity Coding Project for third-year Bachelor students.
Spring 2024. Code Quality. Lessons and practical sessions for first-year Bachelor students.
Fall 2023. Databases: ER Diagram/SQL. Exercises, and practical sessions for first-year Bachelor students.
Uniwersytet Jagielloński
Spring 2023. Graph coloring and decompositions. Lessons and exercises for Master students.
IUT Montpellier-Sète
Spring 2022. Databases: ER Diagram/SQL. Lessons, exercises, and practical sessions for first-year Bachelor students.
Spring 2022. Web Development: Client (Javascript). Practical sessions for second-year Bachelor students.
Fall 2020 – Spring 2021. Web Development: Server (PHP/MySQL/MVC). Practical sessions for second-year Bachelor students.
Winter 2019. Writing and supervising a Java Coding Project for second-year Bachelor students.
Fall 2019. Web Development: HTML/CSS. Practical sessions for first-year Bachelor students.
Fall 2019. Algorithms and JAVA programming. Exercises sessions for first-year Bachelor students.