Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
EDBT 2026 Demo / reviewers in the wild / expert

Dan Alden Baterisna

dblp:399/1916 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
0009-0002-8102-2895ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021

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
Distributed computing theory · 87% Logic in computer science · 13%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Distributed computing theory
distributed verification		 0.912025
Optimal Local Certification on Graphs of Bounded Pathwidth · PODC 2025
Distributed computing theory › distributed verification
proof labeling scheme		 0.912025
Optimal Local Certification on Graphs of Bounded Pathwidth · PODC 2025
Logic in computer science
monadic second-order logic		 0.312025
Optimal Local Certification on Graphs of Bounded Pathwidth · PODC 2025
YearPublicationVenuePosition
2025 Optimal Local Certification on Graphs of Bounded Pathwidth
abstract
We present proof labeling schemes for graphs with bounded path-width that can decide any graph property expressible in monadic second-order (MSO2) logic using O(log n)-bit vertex labels. Examples of such properties include planarity, Hamiltonicity, k-colorability H-minor-freeness, admitting a perfect matching, and having a vertex cover of a given size.
Dan Alden Baterisna, Yi-Jun Chang
 PODC1