Demo Data from SIGIR 2026 / reviewers in the wild / expert
Oliver Riordan
dblp:r/OliverRiordan
· DBLP profile ↗
5ranked-venue papers
1as first author
0since 2021 · last 2007
0000-0002-2934-8065ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 5 · 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
2 papers |
Graph algorithms and graph theory · 100% |
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
random graph models |
0.1 | 2 | 2003 | Directed scale-free graphs · SODA 2003 Degree Distribution of the FKP Network Model · ICALP 2003 |
Graph algorithms and graph theory › network analysis › complex networks
degree distribution |
0.0 | 1 | 2003 | Degree Distribution of the FKP Network Model · ICALP 2003 |
Graph algorithms and graph theory
graph theory |
0.0 | 1 | 2003 | Degree Distribution of the FKP Network Model · ICALP 2003 |
Graph algorithms and graph theory › network analysis › complex networks
scale-free networks |
0.0 | 1 | 2003 | Directed scale-free graphs · SODA 2003 |
Methods — techniques the papers use, named apart from their topics
preferential attachment · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2007 | Degree distribution of the FKP network model
Noam Berger, Béla Bollobás, Christian Borgs, Jennifer T. Chayes, Oliver Riordan |
Theor. Comput. Sci. | 5 |
| 2004 | The Phase Transition and Connectedness in Uniformly Grown Random Graphs
Béla Bollobás, Oliver Riordan |
WAW | 2 |
| 2003 | Degree Distribution of the FKP Network Model
Noam Berger, Béla Bollobás, Christian Borgs, Jennifer T. Chayes, Oliver Riordan |
ICALP | 5 |
| 2003 | Directed scale-free graphs
Béla Bollobás, Christian Borgs, Jennifer T. Chayes, Oliver Riordan |
SODA | 4 |
| 1998 | An Ordering on the Even Discrete TorusabstractThe even discrete torus T n (k 1 ,...,k n ) is the graph on $(\Z/k_1\Z) \times \cdots \times (\Z/k_n\Z)$, where each k i is even and x = (x 1 ,...,x n ) is joined to y = (y 1 ,...,y n ) if for some i we have x i = y i pm 1 and x j = y j for all $j\ne i$. The main aim of this paper is to describe an ordering on the even discrete torus whose initial segments give a best possible isoperimetric inequality. This extends the partial solution of Bollobás and Leader [SIAM J. Discrete Math., 3 (1990), pp. 32--37] to a problem posed by Wang and Wang [SIAM J. Appl. Math., 33 (1977), pp. 55--59]. Oliver Riordan |
SIAM J. Discret. Math. | 1 |