Demo Data from VLDB 2026 / reviewers in the wild / expert
Nicole Eggemann
dblp:13/5719
· DBLP profile ↗
5ranked-venue papers
3as first author
0since 2021 · last 2012
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 3 · 3 first-authorSystems, architecture and hardware · 1
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 · 100% |
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
random graphs |
0.1 | 1 | 2007 | Non-searchability of random scale-free graphs · PODC 2007 |
Graph algorithms and graph theory › network analysis › complex networks
scale-free networks |
0.1 | 1 | 2007 | Non-searchability of random scale-free graphs · PODC 2007 |
Graph algorithms and graph theory › graph algorithms
graph search |
0.0 | 1 | 2007 | Non-searchability of random scale-free graphs · PODC 2007 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2012 | The complexity of two graph orientation problems
Nicole Eggemann, Steven D. Noble |
Discret. Appl. Math. | 1 |
| 2011 | The clustering coefficient of a scale-free random graph
Nicole Eggemann, Steven D. Noble |
Discret. Appl. Math. | 1 |
| 2010 | k-L(2, 1)-labelling for planar graphs is NP-complete for k>=4
Nicole Eggemann, Frédéric Havet, Steven D. Noble |
Discret. Appl. Math. | 1 |
| 2007 | Non-Searchability of Random Power-Law Graphs
Philippe Duchon, Nicole Eggemann, Nicolas Hanusse |
OPODIS | 2 |
| 2007 | Non-searchability of random scale-free graphsabstractNo abstract available. Philippe Duchon, Nicole Eggemann, Nicolas Hanusse |
PODC | 2 |