Demo Data from EDBT 2026 / reviewers in the wild / expert
Hong Duc Bui
dblp:377/1261
· DBLP profile ↗
3ranked-venue papers
2as first author
3since 2021 · last 2026
0009-0007-8656-3400ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2 · 2 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Graph algorithms and graph theory · 75% Distributed computing theory · 25% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Graph algorithms and graph theory › shortest path
all-pairs shortest paths |
0.8 | 1 | 2024 | Improved All-Pairs Approximate Shortest Paths in Congested Clique · PODC 2024 |
Graph algorithms and graph theory › shortest path
approximate shortest paths |
0.8 | 1 | 2024 | Improved All-Pairs Approximate Shortest Paths in Congested Clique · PODC 2024 |
Distributed computing theory › distributed graph algorithms
congested clique |
0.8 | 1 | 2024 | Improved All-Pairs Approximate Shortest Paths in Congested Clique · PODC 2024 |
Graph algorithms and graph theory › graph algorithms › path problems
shortest path algorithms |
0.8 | 1 | 2024 | Improved All-Pairs Approximate Shortest Paths in Congested Clique · PODC 2024 |
Methods — techniques the papers use, named apart from their topics
randomized rounding · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Improved all-pairs approximate shortest paths in congested clique
Hong Duc Bui, Shashwat Chandra, Yi-Jun Chang, Michal Dory, Dean Leitersdorf |
Distributed Comput. | 1 |
| 2026 | Note on "Efficient Packings of Unit Squares in a Large Square"
Marat Z. Arslanov, Hong Duc Bui |
Discret. Comput. Geom. | 2 |
| 2024 | Improved All-Pairs Approximate Shortest Paths in Congested CliqueabstractIn this paper, we present new algorithms for approximating All-Pairs Shortest Paths (APSP) in the Congested Clique model. We present randomized algorithms for weighted undirected graphs. Hong Duc Bui, Shashwat Chandra, Yi-Jun Chang, Michal Dory, Dean Leitersdorf |
PODC | 1 |