Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Tang, C.Y."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Graph searching on some subclasses of chordal graphs
S.-L. Peng
,
M.-T. Ko
,
C.-W. Ho
,
T.-s. Hsu
,
C.Y. Tang
Algorithmica
27
, 2000, pp. 395-426
The searchlight guarding problem on weighted split graphs and weighted cographs
William C.K. Yen
,
C.Y. Tang
Networks
35
(3), 2000, pp. 195-206
An optimal algorithm for solving the searchlight guarding problem on weighted two-terminal series-parallel graphs
William C.K. Yen
,
C.Y. Tang
Acta Informatica
36
(2), 1999, pp. 143-172
An
O(n)
algorithm for finding an optimal position with relative distances in an evolutionary tree
B.Y. Wu
,
C.Y. Tang
Information Processing Letters
63
(5), 1997, pp. 263-269
Solving the Euclidean bottleneck matching problem by
k
- relative neighborhood graphs
M.S. Chang
,
C.Y. Tang
,
R.C.T. Lee
Algorithmica
8
, 1992, pp. 177-194
Solving the Euclidean bottleneck biconnected edge subgraph problem by 2-relative neighborhood graphs
M.S. Chang
,
C.Y. Tang
,
R.C.T. Lee
Discrete Applied Mathematics
39
, 1992, pp. 1-12
Solving the satisfiability problem by using randomized approach
L.C. Wu
,
C.Y. Tang
Information Processing Letters
41
, 1992, pp. 187-190
20-relative neighborhood graphs are Hamiltonian
M.S. Chang
,
C.Y. Tang
,
R.C.T. Lee
Journal of Graph Theory
15
(5), 1991, pp. 543-557
An average case analysis of Monien and Speckenmeyer's mechanical theorem proving algorithm
T.H. Hu
,
C.Y. Tang
,
R.C.T. Lee
Lecture Notes in Computer Science
557
, 1991, pp. 116-126
Ranking, unranking, and parallel enumerating of topological orders
B.Y. Wu
,
C.Y. Tang
Proceedings of the 1991 International Conference on Parallel Processing. Vol.~III Algorithms and Applications, ICPP'91 (St.~Charles, IL, August 12-16, 1991)
, 1991, pp. 284-285
20-relative neighborhood graphs are Hamiltonian
Maw Shang Chang
,
C.Y. Tang
,
R.C.T. Lee
Lecture Notes in Computer Science
450
, 1990, pp. 53-65