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

Walter Schnyder

dblp:25/2422 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1990
—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
Graph algorithms and graph theory · 73% Computational geometry · 27%

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

TopicWeightPapersLastEvidence papers
Computational geometry
graph drawing		 0.011990
Embedding Planar Graphs on the Grid · SODA 1990
Graph algorithms and graph theory › graph embedding
grid embedding		 0.011990
Embedding Planar Graphs on the Grid · SODA 1990
Graph algorithms and graph theory › planar graphs
planarity testing		 0.011990
Embedding Planar Graphs on the Grid · SODA 1990
Graph algorithms and graph theory › graph classes › sparse graphs
bounded degree graphs		 0.011983
Normal Forms for Trivalent Graphs and Graphs of Bounded Valence · STOC 1983
Graph algorithms and graph theory
graph isomorphism		 0.011983
Normal Forms for Trivalent Graphs and Graphs of Bounded Valence · STOC 1983

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

planar graph embedding · 0.0canonical labeling · 0.0
YearPublicationVenuePosition
1990 Embedding Planar Graphs on the Grid
Walter Schnyder
 SODA1
1983 Normal Forms for Trivalent Graphs and Graphs of Bounded Valence
abstract
A function f is defined, mapping graphs with n vertices onto graphs with vertex set {1,...,n} . f(X) is isomorphic to X and X is isomorphic to Y iff f(X) = f(Y). For each d, the restriction of f to graphs of valence d is computable in time O(nτ(d)) for a suitable integer τ(d).
Martin Fürer, Walter Schnyder, Ernst Specker
 STOC2