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="Chang, Gerard J."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A linear-time algorithm for finding locally connected spanning trees on circular-arc graphs
Ching-Chi Lin
,
Gen-Huey Chen
,
Gerard J. Chang
Algorithmica
66
(2), 2013, pp. 369-396
Complexity of distance paired-domination problem in graphs
Gerard J. Chang
,
B.S. Panda
,
D. Pradhan
Theoretical Computer Science
459
, 2012, pp. 89-99
Roman domination on 2-connected graphs
Chun-Hung Liu
,
Gerard J. Chang
SIAM Journal on Discrete Mathematics
26
(1), 2012, pp. 193-205
Near-automorphisms of paths
Gerard J. Chang
Journal of Graph Theory
68
(4), 2011, pp. 323-325
The degree-preserving spanning tree problem in strongly chordal and directed path graphs
Ching-Chi Lin
,
Gerard J. Chang
,
Gen-Huey Chen
Networks
56
(3), 2010, pp. 183-187
Finding cycles in hierarchical hypercube networks
Ruei-Yu Wu
,
Gen-Huey Chen
,
Jung-Sheng Fu
,
Gerard J. Chang
Information Processing Letters
109
(2), 2008, pp. 112-115
On the
(n, t)
-antipodal Gray codes
Gerard J. Chang
,
Sen-Peng Eu
,
Chung-Heng Yeh
Theoretical Computer Science
374
(1-3), 2007, pp. 82-90
On fully orientability of 2-degenerate graphs
Hsin-Hao Lai
,
Gerard J. Chang
,
Ko-Wei Lih
Information Processing Letters
105
(5), 2007, pp. 177-181
Induced-path partition on graphs with special blocks
Jun-Jie Pan
,
Gerard J. Chang
Theoretical Computer Science
370
(1-3), 2007, pp. 121-130
Isometric-path numbers of block graphs
Jun-Jie Pan
,
Gerard J. Chang
Information Processing Letters
93
(2), 2005, pp. 99-102
On the profile of the corona of two graphs
Yung-Ling Lai
,
Gerard J. Chang
Information Processing Letters
89
(6), 2004, pp. 287-292
k
-tuple domination in graphs
Chung-Shou Liao
,
Gerard J. Chang
Information Processing Letters
87
(1), 2003, pp. 45-50
Domination in distance-hereditary graphs
Maw-Shang Chang
,
Shaur-Ching Wu
,
Gerard J. Chang
,
Hong-Gwa Yeh
Discrete Applied Mathematics
116
(1-2), 2002, pp. 103-113
Corrigendum to "The path-partition problem in block graphs"
Gerard J. Chang
Information Processing Letters
83
(5), 2002, pp. 293-293
Minimum span of no-hole
(r+1)
-distant colorings
Gerard J. Chang
,
Justie Su-Tzu Juan
,
Daphne Der-Fen Liu
SIAM Journal on Discrete Mathematics
14
(3), 2001, pp. 370-380
Families of graphs closed under taking powers
Mingjang Chen
,
Gerard J. Chang
Graphs and Combinatorics
17
(2), 2001, pp. 207-212
Channel graphs of bit permutation networks
Li-Da Tong
,
Frank K. Hwang
,
Gerard J. Chang
Theoretical Computer Science
263
(1-2), 2001, pp. 139-143
Weighted connected
k
-domination and weighted
k
-dominating clique in distance-hereditary graphs
Hong-Gwa Yeh
,
Gerard J. Chang
Theoretical Computer Science
263
(1-2), 2001, pp. 3-8
Linear
k
-arboricities on trees
Gerard J. Chang
,
Bor-Liang Chen
,
Hung-Lin Fu
,
Kuo-Ching Huang
Discrete Applied Mathematics
103
(1-3), 2000, pp. 281-287
Pseudo-Hamiltonian-connected graphs
Gerard J. Chang
,
Xuding Zhu
Discrete Applied Mathematics
100
(3), 2000, pp. 145-153
The consecutive-4 digraphs are Hamiltonian
Gerard J. Chang
,
Frank K. Hwang
,
Li-Da Tong
Journal of Graph Theory
31
(1), 1999, pp. 1-6
Characterizing bit permutation networks
Gerard J. Chang
,
Frank K. Hwang
,
Li-Da Tong
Networks
33
(4), 1999, pp. 261-267
Distance graphs and
T
-coloring
Gerard J. Chang
,
Daphne D.-F. Liu
,
Xuding Zhu
Journal of Combinatorial Theory Series B
75
(2), 1999, pp. 259-269
T
-colorings and
T
-edge spans of graphs
Shin-Jie Hu
,
Su-Tzu Juan
,
Gerard J. Chang
Graphs and Combinatorics
15
(3), 1999, pp. 295-301
The circular chromatic number of the Mycielskian of
G^d_k
Lingling Huang
,
Gerard J. Chang
Journal of Graph Theory
32
(1), 1999, pp. 63-71
Seiten 1
2
3
>