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

Ronald H. Rosen

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

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

Applied, interdisciplinary, general and emerging computing · 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 · 67% Algorithms and data structures · 33%

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

TopicWeightPapersLastEvidence papers
Algorithms and data structures › polynomial-time algorithms
linear-time algorithms		 0.011979
A Linear Time Planarity Algorithm for 2-Complexes · J. ACM 1979
Graph algorithms and graph theory › planar graphs
planarity testing		 0.011979
A Linear Time Planarity Algorithm for 2-Complexes · J. ACM 1979
Graph algorithms and graph theory › topological graph theory
topological graph algorithms		 0.011979
A Linear Time Planarity Algorithm for 2-Complexes · J. ACM 1979

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

depth-first search · 0.0
YearPublicationVenuePosition
1979 A Linear Time Planarity Algorithm for 2-Complexes
abstract
A hnear time algorithm to decide whether a given finite 2-complex is planar is described Topological results of Gross, Harary, and Rosen are the mathematical basis for the algorithm Opttmal running time is achieved by constructing various hsts simultaneously and keeping their ordermgs compatible If the complex is stmphcial with p vertices, then the algorithm has O(p) time and space bounds The algorithm uses depth-first search both m application of the graph plananty algorithm of Hopcroft and Tarjan and elsewhere
Jonathan L. Gross, Ronald H. Rosen
 J. ACM2