Demo Data from VLDB 2026 / reviewers in the wild / expert
T. Devini de Mel
dblp:420/1526
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2026
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 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 · 67% Logic in computer science · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Logic in computer science
finite model theory |
1.0 | 1 | 2026 | A Classification of Long-Refinement Graphs for Colour Refinement · SODA 2026 |
Graph algorithms and graph theory
graph isomorphism |
1.0 | 1 | 2026 | A Classification of Long-Refinement Graphs for Colour Refinement · SODA 2026 |
Graph algorithms and graph theory › graph isomorphism
weisfeiler-leman algorithm |
1.0 | 1 | 2026 | A Classification of Long-Refinement Graphs for Colour Refinement · SODA 2026 |
Methods — techniques the papers use, named apart from their topics
graph isomorphism testing · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | A Classification of Long-Refinement Graphs for Colour RefinementabstractThe Colour Refinement algorithm is a classical procedure to detect symmetries in graphs, whose most prominent application is in graph-isomorphism tests. The algorithm and its generalisation, the Weisfeiler–Leman algorithm, evaluate local information to compute a colouring for the vertices in an iterative fashion. Different final colours of two vertices certify that no isomorphism can map one onto the other. Sandra Kiefer, T. Devini de Mel |
SODA | 2 |