Demo Data from EDBT 2026 / reviewers in the wild / expert
Susanne Hemmann
dblp:08/7442
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2009
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1Graphics, computer vision, multimedia, augmented reality and games · 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 |
Computational complexity · 50% Algorithmic game theory and mechanism design · 50% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Algorithmic game theory and mechanism design › social choice
computational social choice |
0.1 | 1 | 2009 | A Multivariate Complexity Analysis of Determining Possible Winners Given Incomplete Votes · IJCAI 2009 |
Computational complexity › parameterized complexity
multivariate complexity analysis |
0.1 | 1 | 2009 | A Multivariate Complexity Analysis of Determining Possible Winners Given Incomplete Votes · IJCAI 2009 |
Computational complexity
parameterized complexity |
0.1 | 1 | 2009 | A Multivariate Complexity Analysis of Determining Possible Winners Given Incomplete Votes · IJCAI 2009 |
Algorithmic game theory and mechanism design › social choice › computational social choice
possible winner problem |
0.1 | 1 | 2009 | A Multivariate Complexity Analysis of Determining Possible Winners Given Incomplete Votes · IJCAI 2009 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2009 | A Multivariate Complexity Analysis of Determining Possible Winners Given Incomplete Votes
Nadja Betzler, Susanne Hemmann, Rolf Niedermeier |
IJCAI | 2 |