Demo Data from EDBT 2026 / reviewers in the wild / expert
T. C. Chern
dblp:35/944
· DBLP profile ↗
3ranked-venue papers
0as first author
0since 2021 · last 1992
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2Theory of computation · 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.
| Theoretical computer science
1 paper |
Graph algorithms and graph theory · 60% Computational geometry · 40% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Electronic design automation · 100% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational geometry › intersection graphs
circular-arc graphs |
0.0 | 1 | 1992 | An O(n² log n) Algorithm for the Hamiltonian Cycle Problem on Circular-Arc Graphs · SIAM J. Comput. 1992 |
Graph algorithms and graph theory
graph algorithms |
0.0 | 1 | 1992 | An O(n² log n) Algorithm for the Hamiltonian Cycle Problem on Circular-Arc Graphs · SIAM J. Comput. 1992 |
Graph algorithms and graph theory › graph theory › hamiltonicity
hamiltonian cycle |
0.0 | 1 | 1992 | An O(n² log n) Algorithm for the Hamiltonian Cycle Problem on Circular-Arc Graphs · SIAM J. Comput. 1992 |
Computational geometry › intersection graphs
interval graphs |
0.0 | 1 | 1992 | An O(n² log n) Algorithm for the Hamiltonian Cycle Problem on Circular-Arc Graphs · SIAM J. Comput. 1992 |
Graph algorithms and graph theory › graph theory › graph covering
path cover |
0.0 | 1 | 1992 | An O(n² log n) Algorithm for the Hamiltonian Cycle Problem on Circular-Arc Graphs · SIAM J. Comput. 1992 |
Electronic design automation › physical design › routing › multilayer routing
layer assignment |
0.0 | 1 | 1988 | Fast Algorithm for Optimal Layer Assignment · DAC 1988 |
Electronic design automation
physical design |
0.0 | 1 | 1988 | Fast Algorithm for Optimal Layer Assignment · DAC 1988 |
Methods — techniques the papers use, named apart from their topics
greedy algorithm · 0.0cutset proof · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1992 | An O(n² log n) Algorithm for the Hamiltonian Cycle Problem on Circular-Arc GraphsabstractA circular arc family F is a collection of arcs on a circle. A circular-arc graph is the intersection graph of an arc family. A Hamiltonian cycle (HC) in a graph is a cycle that passes through every vertex exactly once. This paper presents an $O(n^2 \log n)$ algorithm to determine whether a given circular-arc graph contains an HC. This algorithm is based on two subroutines for interval graphs: (i) a linear time greedy algorithm for the node disjoint path cover problem and (ii) a linear time HC algorithm. If the given graph does not contain an HC, this paper can produce a proof either through the deletion of an appropriate cutset or through the failure to obtain a specific type of HC. Wei-Kuan Shih, T. C. Chern, Wen-Lian Hsu |
SIAM J. Comput. | 2 |
| 1989 | Fast algorithm for optimal layer assignment
Yue-Sun Kuo, T. C. Chern, Wei-Kuan Shih |
Integr. | 2 |
| 1988 | Fast Algorithm for Optimal Layer Assignment
Yue-Sun Kuo, T. C. Chern, Wei-Kuan Shih |
DAC | 2 |