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

Lutz Krauss

dblp:89/5387 · also Lutz Krauß · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1994
—ORCID · none

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

Computer networks · 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.

Computer networks
1 paper
Cellular and mobile networks · 33% Internet architecture and protocols · 33% Routing and switching · 33%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols › network topology
hierarchical network topology		 0.011994
On the design of a hierarchical SS7 network: a graph theoretical approach · IEEE J. Sel. Areas Commun. 1994
Routing and switching › routing algorithms
loop-free routing		 0.011994
On the design of a hierarchical SS7 network: a graph theoretical approach · IEEE J. Sel. Areas Commun. 1994
Cellular and mobile networks › mobile networks › mobile network architecture › signaling system
signaling network		 0.011994
On the design of a hierarchical SS7 network: a graph theoretical approach · IEEE J. Sel. Areas Commun. 1994

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

graph theory · 0.0
YearPublicationVenuePosition
1994 On the design of a hierarchical SS7 network: a graph theoretical approach
abstract
Discusses the design of Signaling System No. 7 networks based on graph theoretical methods. A hierarchical network topology is derived by combining the advantage of the hierarchical network structure with the realization of node disjoint routes between nodes of the network. By using specific features of this topology, the authors develop an algorithm to construct circle-free routing data and to assure bidirectionality also in case of failure situations. The methods described are based on the requirements that the network topology, as well as the routing data, may be easily changed.>
Lutz Krauss, Gerhard Rufa
 IEEE J. Sel. Areas Commun.1