Demo Data from VLDB 2026 / reviewers in the wild / expert
Max Notarangelo
dblp:234/8219
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2019
—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% Graph algorithms and graph theory · 50% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational complexity
game complexity |
0.4 | 1 | 2019 | Computational Intractability and Solvability for the Birds of a Feather Game · AAAI 2019 |
Graph algorithms and graph theory
graph algorithms |
0.4 | 1 | 2019 | Computational Intractability and Solvability for the Birds of a Feather Game · AAAI 2019 |
Methods — techniques the papers use, named apart from their topics
search algorithm · 0.4graph-theoretic algorithms · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | Computational Intractability and Solvability for the Birds of a Feather GameabstractIn this paper, we analyze Birds of a Feather (BoaF), a perfectinformation one-player card game that is the subject of the 2019 EAAI Undergraduate Research Challenge. We prove that the generalized N × N BoaF game is NP-complete, and then explore the one million deals in the 4×4 BoaF testbed. We present several graph-theoretic algorithms to prove that 1880 of these million deals are unsolvable, and conclude the paper with two search algorithms that efficiently show that all of the remaining 998,120 deals are in fact solvable. Richard Hoshino, Max Notarangelo |
AAAI | 2 |