Demo Data from EDBT 2026 / reviewers in the wild / expert
Julie Anne Cain
dblp:99/6759
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2007
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 1 · 1 first-author
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 · 50% Approximation and online algorithms · 25% Algorithms and data structures · 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
graph algorithms |
0.1 | 1 | 2007 | The random graph threshold for k-orientiability and a fast algorithm for optimal multiple-choice allocation · SODA 2007 |
Graph algorithms and graph theory › directed graph
graph orientation |
0.1 | 1 | 2007 | The random graph threshold for k-orientiability and a fast algorithm for optimal multiple-choice allocation · SODA 2007 |
Algorithms and data structures › load balancing
multiple-choice allocation |
0.1 | 1 | 2007 | The random graph threshold for k-orientiability and a fast algorithm for optimal multiple-choice allocation · SODA 2007 |
Approximation and online algorithms
online algorithms |
0.1 | 1 | 2007 | The random graph threshold for k-orientiability and a fast algorithm for optimal multiple-choice allocation · SODA 2007 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2007 | The random graph threshold for k-orientiability and a fast algorithm for optimal multiple-choice allocation
Julie Anne Cain, Peter Sanders 0001, Nicholas C. Wormald |
SODA | 1 |