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

Carolyn Haibt Norton

dblp:75/980 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1992
—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
1 paper
Mathematical optimization · 61% Computational geometry · 30% Algorithms and data structures · 9%

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

TopicWeightPapersLastEvidence papers
Mathematical optimization
discrete optimization
0.011990
Using Separation Algorithms in Fixed Dimension · SODA 1990
Computational geometry › geometric optimization
fixed-dimension optimization
0.011990
Using Separation Algorithms in Fixed Dimension · SODA 1990
Mathematical optimization
separation algorithms
0.011990
Using Separation Algorithms in Fixed Dimension · SODA 1990
Algorithms and data structures
fixed dimension
0.011990
Using Separation Algorithms in Fixed Dimension · SODA 1990

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

separation oracle · 0.0linear programming · 0.0
YearPublicationVenuePosition
1992 Improved Algorithms for Routing on Two-Dimensional Grids
Dinesh Bhatia, Frank Thomson Leighton, Fillia Makedon, Carolyn Haibt Norton
WG4
1990 Using Separation Algorithms in Fixed Dimension
Carolyn Haibt Norton, Serge A. Plotkin, Éva Tardos
SODA1