Demo Data from EDBT 2026 / reviewers in the wild / expert
Yannic S. Tognetti
dblp:86/6487
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2001
—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 · 33% Algorithms and data structures · 33% Graph algorithms and graph theory · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Algorithms and data structures › search algorithms
backtracking |
0.0 | 1 | 2001 | Backtracking Through Biconnected Components of a Constraint Graph · IJCAI 2001 |
Graph algorithms and graph theory › graph connectivity
biconnected components |
0.0 | 1 | 2001 | Backtracking Through Biconnected Components of a Constraint Graph · IJCAI 2001 |
Computational complexity
constraint satisfaction |
0.0 | 1 | 2001 | Backtracking Through Biconnected Components of a Constraint Graph · IJCAI 2001 |
Methods — techniques the papers use, named apart from their topics
constraint graph decomposition · 0.0backtracking · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2001 | Backtracking Through Biconnected Components of a Constraint Graph
Jean-François Baget, Yannic S. Tognetti |
IJCAI | 2 |