Hoang La

Orcid: 0000-0002-3602-0519

According to our database1, Hoang La authored at least 23 papers between 2021 and 2026.

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

2026
Centered colorings and weak coloring numbers in minor-closed graph classes.
CoRR, March, 2026

Quickly Excluding an Apex-Forest.
SIAM J. Discret. Math., 2026

Partitions of Planar (Oriented) Graphs into a Connected Acyclic and an Independent Set.
Electron. J. Comb., 2026

Centered colorings in minor-closed graph classes.
Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025
The χ-Binding Function of d-Directional Segment Graphs.
Discret. Comput. Geom., October, 2025

Cube Height, Cube Width and Related Extremal Problems for Posets.
CoRR, October, 2025

Fractional domatic number and minimum degree.
CoRR, August, 2025

Boolean Dimension of a Boolean Lattice.
Order, April, 2025

2-Distance (Δ + 1)-coloring of sparse graphs using the potential method.
Discret. Math., 2025

Weak coloring numbers of minor-closed graph classes.
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

2024
Graph Reconstruction with Connectivity Queries.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2024

The Grid-Minor Theorem Revisited.
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.
Discret. Math., August, 2023

2022
2-Distance list (Δ +2)-coloring of planar graphs with girth at least 10.
J. Comb. Optim., 2022

2-Distance List (Δ+3)$-Coloring of Sparse Graphs.
Graphs Comb., 2022

Further extensions of the Grötzsch Theorem.
Discret. Math., 2022

Computer assisted discharging procedure on planar graphs: application to 2-distance coloring.
CoRR, 2022

Feedback Vertex Sets in (Directed) Graphs of Bounded Degeneracy or Treewidth.
Electron. J. Comb., 2022

2021
r-hued (r+1)-coloring of planar graphs with girth at least 8 for r≥9.
Eur. J. Comb., 2021

A note on deterministic zombies.
Discret. Appl. Math., 2021

2-distance (Δ+2)-coloring of sparse graphs.
CoRR, 2021

2-distance 4-coloring of planar subcubic graphs with girth at least 21.
CoRR, 2021

2-distance (Δ+1)-coloring of sparse graphs using the potential method.
CoRR, 2021


  Loading...