Joe Brandenburg

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

dblp:88/3746 · DBLP profile ↗

← Back

2ranked-venue papers

1as first author

0since 2021 · last 1993

—ORCID · none

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

Systems, architecture and hardware · 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

Graph algorithms and graph theory · 100%

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

Topic	Weight	Papers	Last	Evidence papers
Graph algorithms and graph theory graph embedding	0.0	1	1988	Minimal mesh embeddings in binary hypercubes · IEEE Trans. Computers 1988
Graph algorithms and graph theory › graph embedding hypercube embedding	0.0	1	1988	Minimal mesh embeddings in binary hypercubes · IEEE Trans. Computers 1988

Year	Publication	Venue	Position
1993	Technology Advances in the Intel Paragon System abstract No abstract available. Joe Brandenburg	SPAA	1
1988	Minimal mesh embeddings in binary hypercubes abstract The authors state and prove a result about minimal graph embeddings of meshes into hypercubes. This corrects a flaw in a previously published proof by D.W. Krumme and K.N. Venkataraman (1986).> David S. Scott, Joe Brandenburg	IEEE Trans. Computers	2