Demo Data from EDBT 2026 / reviewers in the wild / expert
Weinuo Li
dblp:408/0180
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 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.
| Databases, data mining, and information retrieval
1 paper |
Data mining · 50% Graph data management · 50% | |
| Theoretical computer science
1 paper |
Graph algorithms and graph theory · 50% Computational complexity · 50% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Graph data management › cohesive subgraph mining
biclique enumeration |
0.9 | 1 | 2025 | Scalable Approximate Biclique Counting over Large Bipartite Graphs · Proc. VLDB Endow. 2025 |
Data mining › structured data mining
graph mining |
0.9 | 1 | 2025 | Scalable Approximate Biclique Counting over Large Bipartite Graphs · Proc. VLDB Endow. 2025 |
Computational complexity › counting problems
counting algorithms |
0.3 | 1 | 2025 | Scalable Approximate Biclique Counting over Large Bipartite Graphs · Proc. VLDB Endow. 2025 |
Graph algorithms and graph theory
graph algorithms |
0.3 | 1 | 2025 | Scalable Approximate Biclique Counting over Large Bipartite Graphs · Proc. VLDB Endow. 2025 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Scalable Approximate Biclique Counting over Large Bipartite Graphs
Jingbang Chen 0001, Weinuo Li, Yingli Zhou, Hangrui Zhou, Qiuyang Mang, Can Wang 0001, Yixiang Fang, Chenhao Ma 0001 |
Proc. VLDB Endow. | 2 |