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.
? Tutorial for this page
Demo Data from VLDB 2026 / reviewers in the wild / expert

Charles M. Grinstead

dblp:85/1667 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1983
—ORCID · none

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

Artificial intelligence and machine learning · 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%

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

TopicWeightPapersLastEvidence papers
Graph algorithms and graph theory › graph isomorphism
graph automorphism		 0.011983
Efficient Graph Automorphism by Vertex Partitioning · Artif. Intell. 1983
YearPublicationVenuePosition
1983 Efficient Graph Automorphism by Vertex Partitioning
Glenn S. Fowler, Robert M. Haralick, F. Gail Gray, Charles Feustel, Charles M. Grinstead
 Artif. Intell.5