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.
EDBT 2026 Demo / reviewers in the wild / expert

Dale Youngs

dblp:03/1077 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1998
—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.

Computer networks
1 paper
Network optimization and economics · 44% Wireless networking · 44% Cellular and mobile networks · 13%

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

TopicWeightPapersLastEvidence papers
Wireless networking › cognitive radio › spectrum management
frequency assignment		 0.011998
Minimization Criteria for Frequency Planning in Cellular Radio Systems · IEEE Trans. Inf. Theory 1998
Network optimization and economics
resource allocation		 0.011998
Minimization Criteria for Frequency Planning in Cellular Radio Systems · IEEE Trans. Inf. Theory 1998
Cellular and mobile networks
interference management		 0.011998
Minimization Criteria for Frequency Planning in Cellular Radio Systems · IEEE Trans. Inf. Theory 1998

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

interference sum minimization · 0.0graph-based frequency assignment · 0.0
YearPublicationVenuePosition
1998 Minimization Criteria for Frequency Planning in Cellular Radio Systems
abstract
We ask whether the minimization criteria used in graph-based frequency-assignment algorithms are necessarily dependent upon how the corresponding interference data is interpreted, and show that any sensible interpretation of interference data allows a very simple "interference sum minimization" to be used as an appropriate criterion.
Dale Youngs
 IEEE Trans. Inf. Theory1
1990 Cycle Lengths and Graph Orientations
abstract
Those functions defined on the cycles of a finite graph G that can be the flow difference of an orientation of G are characterized. The result is applied to give a proof of Bandelt’s Theorem stating that all (Hasse-) diagram orientations of a planar graph G have zero flow difference on all cycles if and only if G has a cycle basis of 4-cycles.
Oliver Pretzel, Dale Youngs
 SIAM J. Discret. Math.2