EDBT 2026 Demo / reviewers in the wild / expert
Taek-Jin Choi
dblp:132/8724
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1997
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 1
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 |
Wireless networking · 100% | |
| Theoretical computer science
1 paper |
Mathematical optimization · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Wireless networking › cognitive radio › spectrum management
frequency assignment |
0.0 | 1 | 1997 | A new lower bound for the frequency assignment problem · IEEE/ACM Trans. Netw. 1997 |
Mathematical optimization
combinatorial optimization |
0.0 | 1 | 1997 | A new lower bound for the frequency assignment problem · IEEE/ACM Trans. Netw. 1997 |
Methods — techniques the papers use, named apart from their topics
lower bound derivation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1997 | A new lower bound for the frequency assignment problemabstractWe propose a new lower bound on the number of frequencies required to meet the frequency demands in a cellular network. It extends Gamst's (1986) work by devising a procedure of frequency insertion, which makes the best of unexploited frequency spaces between the assigned frequencies. Our lower bound is claimed to have much wider and easier real-world applicability due to its relaxed prerequisite condition. Furthermore, it is shown via an illustrative example to be much tighter than its previous counterpart. Dong-Wan Tcha, Taek-Jin Choi |
IEEE/ACM Trans. Netw. | 3 |