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 EDBT 2026 / reviewers in the wild / expert

Steven W. Reyner

dblp:73/5350 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1989
—ORCID · none

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

Theory of computation · 2 · 1 first-author

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
2 papers
Algorithms and data structures · 55% Graph algorithms and graph theory · 21% Algorithmic game theory and mechanism design · 21%

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

TopicWeightPapersLastEvidence papers
Algorithms and data structures
analysis of algorithms		 0.011989
An Analysis of a Good Algorithm for the Subtree Problem, Corrected · SIAM J. Comput. 1989
Algorithmic game theory and mechanism design › matching
bipartite matching		 0.011977
An Analysis of a Good Algorithm for the Subtree Problem · SIAM J. Comput. 1977
Graph algorithms and graph theory
graph algorithms		 0.011977
An Analysis of a Good Algorithm for the Subtree Problem · SIAM J. Comput. 1977
Algorithmic game theory and mechanism design
matching		 0.011977
An Analysis of a Good Algorithm for the Subtree Problem · SIAM J. Comput. 1977
Graph algorithms and graph theory › graph algorithms › graph pattern matching
subtree isomorphism		 0.011977
An Analysis of a Good Algorithm for the Subtree Problem · SIAM J. Comput. 1977

Methods — techniques the papers use, named apart from their topics

tighter analysis · 0.0tree decomposition · 0.0
YearPublicationVenuePosition
1989 An Analysis of a Good Algorithm for the Subtree Problem, Corrected
abstract
It is shown that the proof of the main result in Reyner’s paper, similarly titled, is incorrect. Interestingly, by combining a simple modification of the algorithm with tighter analysis, one can obtain the original result with a minor improvement.
Rakesh M. Verma, Steven W. Reyner
 SIAM J. Comput.2
1977 An Analysis of a Good Algorithm for the Subtree Problem
abstract
A good algorithm is analyzed for deciding if one tree is a subtree of another tree. If both trees are rooted, the smaller tree has n vertices and the larger has m vertices; then the total number of computations is $O(nm^{1.5})$ or better, depending on how good an algorithm one has for a maximal matching in a bipartite graph.
Steven W. Reyner
 SIAM J. Comput.1