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
[2]
Hilfe
Suche: Author="Tan, Jimmy J.M."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Conditional fault Hamiltonian connectivity of the complete graph
Tung-Yang Ho
,
Yuan-Kang Shih
,
Jimmy J.M. Tan
,
Lih-Hsing Hsu
Information Processing Letters
109
(12), 2009, pp. 585-588
Embedding paths of variable lengths into hypercubes with conditional link-faults
Tz-Liang Kueng
,
Cheng-Kuan Lin
,
Tyne Liang
,
Jimmy J.M. Tan
,
Lih-Hsing Hsu
Parallel Computing
35
(8-9), 2009, pp. 441-454
On the bipanpositionable bipanconnectedness of hypercubes
Tzu-Liang Kung
,
Cheng-Kuan Lin
,
Tyne Liang
,
Lih-Hsing Hsu
,
Jimmy J.M. Tan
Theoretical Computer Science
410
(8-10), 2009, pp. 801-811
Embedding Hamiltonian paths in hypercubes with a required vertex in a fixed position
Chung-Meng Lee
,
Jimmy J.M. Tan
,
Lih-Hsing Hsu
Information Processing Letters
107
(5), 2008, pp. 171-176
Strong Menger connectivity with conditional faults on the class of hypercube-like networks
Lun-Min Shih
,
Chieh-Feng Chiang
,
Lih-Hsing Hsu
,
Jimmy J.M. Tan
Information Processing Letters
106
(2), 2008, pp. 64-69
On the spanning connectivity and spanning laceability of hypercube-like networks
Cheng-Kuan Lin
,
Jimmy J.M. Tan
,
D. Frank Hsu
,
Lih-Hsing Hsu
Theoretical Computer Science
381
(1-3), 2007, pp. 218-229
Edge-bipancyclicity of conditional faulty hypercubes
Lun-Min Shih
,
Jimmy J.M. Tan
,
Lih-Hsing Hsu
Information Processing Letters
105
(1), 2007, pp. 20-25
Panpositionable Hamiltonicity of the alternating group graphs
Yuan-Hsiang Teng
,
Jimmy J.M. Tan
,
Lih-Hsing Hsu
Networks
50
(2), 2007, pp. 146-156
Hamiltonian circuit and linear array embeddings in faulty
k
-ary
n
-cubes
Ming-Chien Yang
,
Jimmy J.M. Tan
,
Lih-Hsing Hsu
Journal Parallel Distributed Computing
67
(4), 2007, pp. 362-368
Fault Hamiltonicity of augmented cubes
Hong-Chun Hsu
,
Liang-Chih Chiang
,
Jimmy J.M. Tan
,
Lih-Hsing Hsu
Parallel Computing
31
(1), 2005, pp. 131-145
Honeycomb rectangular disks
Yuan-Hsiang Teng
,
Jimmy J.M. Tan
,
Lih-Hsing Hsu
Parallel Computing
31
(3-4), 2005, pp. 371-388
The super-connected property of recursive circulant graphs
Chang-Hsiung Tsai
,
Jimmy J.M. Tan
,
Lih-Hsing Hsu
Information Processing Letters
91
(6), 2004, pp. 293-298
Fault Hamiltonicity and fault Hamiltonian connectivity of the
(n, k)
-star graphs
Hong-Chun Hsu
,
Yi-Lin Hsieh
,
Jimmy J.M. Tan
,
Lih-Hsing Hsu
Networks
42
(4), 2003, pp. 189-201
Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
Tseng-Kuei Li
,
Chang-Hsiung Tsai
,
Jimmy J.M. Tan
,
Lih-Hsing Hsu
Information Processing Letters
87
(2), 2003, pp. 107-110
Fault-tolerant cycle-embedding of crossed cubes
Ming-Chien Yang
,
Tseng-Kuei Li
,
Jimmy J.M. Tan
,
Lih-Hsing Hsu
Information Processing Letters
88
(4), 2003, pp. 149-154
Fault-tolerant Hamiltonicity of twisted cubes
Wen-Tzeng Huang
,
Jimmy J.M. Tan
,
Chun-Nan Hung
,
Lih-Hsing Hsu
Journal Parallel Distributed Computing
62
(4), 2002, pp. 591-604
Fault-tolerant Hamiltonian laceability of hypercubes
Chang-Hsiung Tsai
,
Jimmy J.M. Tan
,
Tyne Liang
,
Lih-Hsing Hsu
Information Processing Letters
83
(6), 2002, pp. 301-306
The shuffle-cubes and their generalization
Tseng-Kuei Li
,
Jimmy J.M. Tan
,
Lih-Hsing Hsu
,
Ting-Yi Sung
Information Processing Letters
77
(1), 2001, pp. 35-41
Construction schemes for fault-tolerant Hamiltonian graphs
Jeng-Jung Wang
,
Chun-Nan Hung
,
Jimmy J.M. Tan
,
Liy-Hsing Hsu
,
Ting-Yi Sung
Networks
35
(3), 2000, pp. 233-245
A generalization of the stable matching problem
Jimmy J.M. Tan
,
Yuang-Cheh Hsueh
Discrete Applied Mathematics
59
, 1995, pp. 87-102
A necessary and sufficient condition for the existence of a complete stable matching
Jimmy J.M. Tan
Journal of Algorithms
12
, 1991, pp. 154-178