We stand with Ukraine  

Hoang La

Orcid: 0000-0002-3602-0519

According to our database1, Hoang La authored at least 22 papers between 2021 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
The χ-Binding Function of d-Directional Segment Graphs.
[BibTeX]
[DOI]
Lech Duraj
,
Ross J. Kang
,
Hoang La
,
Jonathan Narboni
,
Filip Pokrývka
,
Clément Rambaud
,
Amadeus Reinald
Discret. Comput. Geom., October, 2025

Cube Height, Cube Width and Related Extremal Problems for Posets.
[BibTeX]
[DOI]
Paul Bastide
,
Jedrzej Hodor
,
Hoang La
,
William T. Trotter
CoRR, October, 2025

Fractional domatic number and minimum degree.
[BibTeX]
[DOI]
Quentin Chuet
,
Hugo Demaret
,
Hoang La
,
François Pirot
CoRR, August, 2025

Boolean Dimension of a Boolean Lattice.
[BibTeX]
[DOI]
Marcin Brianski
,
Jedrzej Hodor
,
Hoang La
,
Piotr Micek
,
Katzper Michno
Order, April, 2025

2-Distance (Δ + 1)-coloring of sparse graphs using the potential method.
[BibTeX]
[DOI]
Hoang La
,
Mickaël Montassier
Discret. Math., 2025

Weak coloring numbers of minor-closed graph classes.
[BibTeX]
[DOI]
Jedrzej Hodor
,
Hoang La
,
Piotr Micek
,
Clément Rambaud
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

2024
Partitions of planar (oriented) graphs into a connected acyclic and an independent set.
[BibTeX]
[DOI]
Stijn Cambie
,
François Dross
,
Kolja Knauer
,
Hoang La
,
Petru Valicov
CoRR, 2024

Centered colorings in minor-closed graph classes.
[BibTeX]
[DOI]
Jedrzej Hodor
,
Hoang La
,
Piotr Micek
,
Clément Rambaud
CoRR, 2024

Quickly excluding an apex-forest.
[BibTeX]
[DOI]
Jedrzej Hodor
,
Hoang La
,
Piotr Micek
,
Clément Rambaud
CoRR, 2024

Graph Reconstruction with Connectivity Queries.
[BibTeX]
[DOI]
Kacper Kluk
,
Hoang La
,
Marta Piecyk
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2024

The Grid-Minor Theorem Revisited.
[BibTeX]
[DOI]
Vida Dujmovic
,
Robert Hickingbotham
,
Jedrzej Hodor
,
Gwenaël Joret
,
Hoang La
,
Piotr Micek
,
Pat Morin
,
Clément Rambaud
,
David R. Wood
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
2-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4.
[BibTeX]
[DOI]
Hoang La
,
Kenny Storgel
Discret. Math., August, 2023

2022
2-Distance list (Δ +2)-coloring of planar graphs with girth at least 10.
[BibTeX]
[DOI]
Hoang La
,
Mickaël Montassier
J. Comb. Optim., 2022

2-Distance List (Δ+3)$-Coloring of Sparse Graphs.
[BibTeX]
[DOI]
Hoang La
Graphs Comb., 2022

Further extensions of the Grötzsch Theorem.
[BibTeX]
[DOI]
Hoang La
,
Borut Luzar
,
Kenny Storgel
Discret. Math., 2022

Computer assisted discharging procedure on planar graphs: application to 2-distance coloring.
[BibTeX]
[DOI]
Hoang La
,
Petru Valicov
CoRR, 2022

Feedback Vertex Sets in (Directed) Graphs of Bounded Degeneracy or Treewidth.
[BibTeX]
[DOI]
Kolja Knauer
,
Hoang La
,
Petru Valicov
Electron. J. Comb., 2022

2021
r-hued (r+1)-coloring of planar graphs with girth at least 8 for r≥9.
[BibTeX]
[DOI]
Hoang La
,
Mickaël Montassier
,
Alexandre Pinlou
,
Petru Valicov
Eur. J. Comb., 2021

A note on deterministic zombies.
[BibTeX]
[DOI]
Valentin Bartier
,
Laurine Bénéteau
,
Marthe Bonamy
,
Hoang La
,
Jonathan Narboni
Discret. Appl. Math., 2021

2-distance (Δ+2)-coloring of sparse graphs.
[BibTeX]
[DOI]
Hoang La
,
Mickaël Montassier
CoRR, 2021

2-distance 4-coloring of planar subcubic graphs with girth at least 21.
[BibTeX]
[DOI]
Hoang La
,
Mickaël Montassier
CoRR, 2021

2-distance (Δ+1)-coloring of sparse graphs using the potential method.
[BibTeX]
[DOI]
Hoang La
,
Mickaël Montassier
CoRR, 2021


  Loading...