Research

Publications¶

1. Paul Bastide, Jędrzej Hodor, and Hoang La.
   Dimension of planar posets with bounded number of minimal elements.
   Coming Soon.

2. Thomas Delépine, Hoang La, and François Pirot.
   Elimination depth.
   Coming Soon.

3. Quentin Chuet, Maxime Flin, Hoang La, and François Pirot.
   LOCAL non-repetitive colorings.
   Coming Soon.

4. Paul Bastide, Hoang La, Matthieu Petiteau, and Jialu Zhu.
   Graph reconstruction via edge number parity queries.
   Coming Soon.

5. Quentin Chuet, Selma Djelloul, Hoang La, François Pirot, and Hossein Zaredehabadi.
   Packing many dominating sets into a graph excluding an induced subgraph.
   Coming Soon.

6. Jędrzej Hodor, Hoang La, Piotr Micek, and Clément Rambaud.
   Centered colorings and weak coloring numbers of minor-closed graph classes.
   Coming Soon.

7. Florian Galliot, Hoang La, Raphaëlle Maistre, Matthieu Petiteau, and Dimitri Watel.
   Graph reconstruction from queries on triples.
   Coming Soon.

8. Paul Bastide, Jędrzej Hodor, Hoang La, and William T. Trotter.
   Cube Height, Cube Width and Related Extremal Problems for Posets.
   arXiv:2510.00928

9. Quentin Chuet, Hugo Demaret, Hoang La, and François Pirot.
   Fractional domatic number and minimum degree.
   arXiv:2508.19617

10. Jędrzej Hodor, Hoang La, Piotr Micek, and Clément Rambaud.
    Centered colorings of minor-closed graph classes.
    SODA, 2026.

11. Stijn Cambie, François Dross, Kolja Knauer, Hoang La, and Petru Valicov.
    Partitions of planar (oriented) graphs into a connected acyclic and an independent set.
    Accepted at Electronic Journal of Combinatorics, 2025.

12. Jędrzej Hodor, Hoang La, Piotr Micek, and Clément Rambaud.
    Weak coloring numbers of minor-closed graph classes.
    SODA, 2025.

13. Jędrzej Hodor, Hoang La, Piotr Micek, and Clément Rambaud.
    Quickly excluding an apex forest.
    Accepted at SIAM Journal on Discrete Mathematics, 2025.

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.
    Discrete & Computational Geometry, 74:758–770, 2025.

15. Vida Dujmović, Robert Hickingbotham, Jędrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek, Pat Morin, Clément Rambaud, and David R. Wood.
    The grid-minor theorem revisited.
    SODA, 2024.

16. Kacper Kluk, Hoang La, and Marta Piecyk.
    Graph Reconstruction with Connectivity Queries.
    WG, 2024.

17. Marcin Briański, Jędrzej Hodor, Hoang La, Piotr Micek, and Katzper Michno.
    Boolean Dimension of a Boolean Lattice.
    Order, 2024.

18. 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.

19. Hoang La and Petru Valicov.
    Computer assisted discharging procedure on planar graphs: application to 2-distance coloring.
    arXiv:2202.03885

20. 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.

21. Hoang La, Borut Luzar, and Kenny Storgel.
    Further extensions of Grötzsch Theorem.
    Discrete Mathematics, 345(6):112849, 2022.

22. 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.

23. Hoang La and Mickael Montassier.
    2-distance (Δ + 2)-coloring of sparse graphs.
    arXiv:2109.11927

24. Hoang La and Mickael Montassier.
    2-distance 4-coloring of planar subcubic graphs with girth at least 21.
    Discrete Mathematics & Theoretical Computer Science, 26:3, 2025.

25. Hoang La.
    2-distance list (Δ + 3)-coloring of sparse graphs.
    Graphs and Combinatorics, 38:167, 2022.

26. Hoang La and Mickael Montassier.
    2-distance (Δ + 1)-coloring of sparse graphs using the potential method.
    Discrete Mathematics, 348(1):114292, 2025

27. 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.

28. 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¶

• Sino-French International Conference on Graph Theory, Combinatorics and Algorithms, Jinan, China, October 2025.
  Graph reconstruction via subgraph queries.

• (10PCC) The 10th Polish Combinatorial Conference, Będlewo, Poland, September 2024.
  Fractional domatic number and minimum degree.

• (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, Kraków, Poland, April 23, 2025.
  LOCAL non-repetitive colorings of graphs.
  Video.

• TCS, Jagiellonian University, Kraków, Poland, April 17, 2024.
  Graph reconstruction with connectivity queries.
  Video.

• School of Mathematics, Shandong University, Jinan, China, March 5, 2024.
  The χ-binding function of d-directional segment graphs.

• 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, Kraków, Poland, November 16, 2022.
  On Barnette’s Conjecture for directed graphs.
  Video.

• 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.