Demo Data from EDBT 2026 / reviewers in the wild / expert
Chris Hartman
dblp:10/3440
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2010
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 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% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Parallel and multicore computing · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Graph algorithms and graph theory › dense subgraph discovery
dense subgraph enumeration |
0.1 | 1 | 2010 | ODES: an overlapping dense sub-graph algorithm · Bioinform. 2010 |
Parallel and multicore computing › parallel programming models
shared-memory parallelization |
0.0 | 1 | 2010 | ODES: an overlapping dense sub-graph algorithm · Bioinform. 2010 |
Methods — techniques the papers use, named apart from their topics
pthreads parallelization · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2010 | ODES: an overlapping dense sub-graph algorithmabstractSUMMARY: Enumeration of the dense sub-graphs of a graph is of interest in community discovery and membership problems, including dense sub-graphs that overlap each other. Described herein is ODES (Overlapping DEnse Sub-graphs), pthreads parallelized software to extract all overlapping maximal sub-graphs whose densities are greater than or equal to a specified cutoff density of at least 1/2. AVAILABILITY AND IMPLEMENTATION: http://dense.sf.net James Long 0001, Chris Hartman |
Bioinform. | 2 |