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

Julie L. Johnson

dblp:68/4120 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2013
—ORCID · none

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

Theory of computation · 2 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1 · 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
Graph algorithms and graph theory · 67% Computational geometry · 33%

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

TopicWeightPapersLastEvidence papers
Graph algorithms and graph theory
graph classes		 0.012001
A polynomial time recognition algorithm for probe interval graphs · SODA 2001
Graph algorithms and graph theory › graph classes
graph recognition		 0.012001
A polynomial time recognition algorithm for probe interval graphs · SODA 2001
Computational geometry › intersection graphs
interval graphs		 0.012001
A polynomial time recognition algorithm for probe interval graphs · SODA 2001

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

polynomial-time recognition algorithm · 0.0
YearPublicationVenuePosition
2013 Making programming contest practice worthy of academic credit (abstract only)
abstract
The ACM Intercollegiate Programming Contest is probably the most prestigious competition of its kind. Decomposing problems into familiar algorithms; making tradeoffs between efficiency and complexity; working on a team under pressure; not only are these skills needed to compete successfully in such a contest, but are also highly valued in industry. The focus of this poster is to describe a course recently added to the curriculum at Vanderbilt University that centers on programming contest skills and yet, somewhat surprisingly, encompasses several significant learning objectives.
Julie L. Johnson
 SIGCSE1
2003 Recognition of Some Perfectly Orderable Graph Classes
Elaine M. Eschen, Julie L. Johnson, Jeremy P. Spinrad, R. Sritharan
 Discret. Appl. Math.2
2001 A polynomial time recognition algorithm for probe interval graphs
Julie L. Johnson, Jeremy P. Spinrad
 SODA1