Demo Data from EDBT 2026 / reviewers in the wild / expert
Xianbin Zhu 0003
dblp:211/7379-3
· DBLP profile ↗
2ranked-venue papers
2as first author
2since 2021 · last 2022
0000-0003-0939-8230ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 2 · 2 first-author · 2 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 · 87% Algorithms and data structures · 13% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Graph algorithms and graph theory
graph algorithms |
0.5 | 1 | 2021 | Incremental algorithms for the maximum internal spanning tree problem · Sci. China Inf. Sci. 2021 |
Graph algorithms and graph theory
spanning tree |
0.5 | 1 | 2021 | Incremental algorithms for the maximum internal spanning tree problem · Sci. China Inf. Sci. 2021 |
Algorithms and data structures › dynamic algorithms
incremental algorithms |
0.1 | 1 | 2021 | Incremental algorithms for the maximum internal spanning tree problem · Sci. China Inf. Sci. 2021 |
Methods — techniques the papers use, named apart from their topics
maximum internal spanning tree · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Erratum to: Incremental algorithms for the maximum internal spanning tree problem
Xianbin Zhu 0003, Wenjun Li 0001, Yongjie Yang 0001, Jianxin Wang 0001 |
Sci. China Inf. Sci. | 1 |
| 2021 | Incremental algorithms for the maximum internal spanning tree problem
Xianbin Zhu 0003, Wenjun Li 0001, Yongjie Yang 0001, Jianxin Wang 0001 |
Sci. China Inf. Sci. | 1 |