Hong Duc Bui

Orcid: 0009-0007-8656-3400

According to our database¹, Hong Duc Bui authored at least 7 papers between 2024 and 2025.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of four.

Timeline

Legend:

Book In proceedings Article PhD thesis Dataset Other

Links

On csauthors.net:

Bibliography

2025

Square packing with O(x<sup>0.6</sup>) wasted area.

[BibT_eX]

[DOI]

Hong Duc Bui

CoRR, August, 2025

On existence of a compatible triangulation with the double circle order type.

[BibT_eX]

[DOI]

Hong Duc Bui

CoRR, August, 2025

Straight-line Orthogonal Drawing of Complete Ternary Tree Requires O(n<sup>1.032</sup>) Area.

[BibT_eX]

[DOI]

Hong Duc Bui

CoRR, June, 2025

Counting Number of Triangulations of Point Sets: Reinterpreting and Generalizing the Triangulation Polynomials.

[BibT_eX]

[DOI]

Hong Duc Bui

CoRR, April, 2025

Square Packing with Asymptotically Smallest Waste Only Needs Good Squares.

[BibT_eX]

Hong Duc Bui

Proceedings of the 37th Canadian Conference on Computational Geometry (CCCG 2025), 2025

Straight-line Orthogonal Drawing of Complete Ternary Tree Requires O(n1.032) Area.

[BibT_eX]

Hong Duc Bui

Proceedings of the 37th Canadian Conference on Computational Geometry (CCCG 2025), 2025

2024

Improved All-Pairs Approximate Shortest Paths in Congested Clique.

[BibT_eX]

[DOI]

Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

Hong Duc Bui

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...