default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGerard J. Chang
Gerard Jennhwa Chang
Person information
- affiliation: National Chiao Tung University, Taiwan
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j155]Alianna Singyue Yu, Gerard Jennhwa Chang:
Edge-removing games on graphs. Discret. Appl. Math. 349: 75-85 (2024)- 2021
- [j154]Juei-Yin Lin
, Chung-Ying Yang, Gerard Jennhwa Chang:
The 4-choosability of planar graphs and cycle adjacency. Discret. Math. 344(11): 112587 (2021)
2010 – 2019
- 2018
- [j153]Gerard Jennhwa Chang, Guan-Huei Duh:
On the precise value of the strong chromatic index of a planar graph with a large girth. Discret. Appl. Math. 247: 389-397 (2018) - 2017
- [j152]Gerard Jennhwa Chang, Guan-Huei Duh, Tsai-Lien Wong, Xuding Zhu:
Total Weight Choosability of Trees. SIAM J. Discret. Math. 31(2): 669-686 (2017) - 2016
- [j151]Hsiang-Chun Hsu, Gerard Jennhwa Chang:
Max-Coloring of Vertex-Weighted Graphs. Graphs Comb. 32(1): 191-198 (2016) - [j150]Gerard J. Chang, Sheng-Hua Chen, Chun-Hung Liu:
Edge Roman Domination on Graphs. Graphs Comb. 32(5): 1731-1747 (2016) - 2015
- [j149]Valentin Borozan, Gerard Jennhwa Chang, Nathann Cohen, Shinya Fujita, Narayanan Narayanan, Reza Naserasr, Petru Valicov:
From Edge-Coloring to Strong Edge-Coloring. Electron. J. Comb. 22(2): 2 (2015) - [j148]Sheng-Hua Chen, Gerard Jennhwa Chang:
The number of steps and the final configuration of relaxation procedures on graphs. Discret. Appl. Math. 181: 50-53 (2015) - [j147]Gerard J. Chang, Sheng-Hua Chen, Chi-Yun Hsu, Chia-Man Hung, Huei-Ling Lai:
Strong edge-coloring for jellyfish graphs. Discret. Math. 338(12): 2348-2355 (2015) - [j146]Gerard Jennhwa Chang, Nicolas Roussel:
On the k-power domination of hypergraphs. J. Comb. Optim. 30(4): 1095-1106 (2015) - 2014
- [j145]Bo-Jr Li, Gerard Jennhwa Chang:
Dot product dimensions of graphs. Discret. Appl. Math. 166: 159-163 (2014) - [j144]James K. Lan, Gerard Jennhwa Chang:
On the algorithmic complexity of k-tuple total domination. Discret. Appl. Math. 174: 81-91 (2014) - [j143]Gerard Jennhwa Chang, Mickaël Montassier, Arnaud Pêcher, André Raspaud:
Strong chromatic index of planar graphs with large girth. Discuss. Math. Graph Theory 34(4): 723-733 (2014) - [j142]Gerard Jennhwa Chang, Ma-Lian Chia, David Kuo, Ji-Yin Lin, Jing-Ho Yan:
Bandwidth sums of block graphs and cacti. J. Comb. Optim. 27(4): 679-687 (2014) - [j141]Hsiang-Chun Hsu, Gerard Jennhwa Chang:
Graphs with small balanced decomposition numbers. J. Comb. Optim. 28(2): 505-510 (2014) - 2013
- [j140]Ching-Chi Lin, Gen-Huey Chen, Gerard J. Chang:
A Linear-Time Algorithm for Finding Locally Connected Spanning Trees on Circular-Arc Graphs. Algorithmica 66(2): 369-396 (2013) - [j139]Wu-Hsiung Lin, Gerard J. Chang:
b-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture. Discret. Appl. Math. 161(7-8): 1060-1066 (2013) - [j138]Gerard J. Chang, Bo-Jr Li, Jiaojiao Wu:
Rainbow domination and related problems on strongly chordal graphs. Discret. Appl. Math. 161(10-11): 1395-1401 (2013) - [j137]James K. Lan, Gerard Jennhwa Chang:
Algorithmic aspects of the kk-domination problem in graphs. Discret. Appl. Math. 161(10-11): 1513-1520 (2013) - [j136]Wu-Hsiung Lin, Gerard J. Chang:
bb-chromatic numbers of powers of paths and cycles. Discret. Appl. Math. 161(16-17): 2532-2536 (2013) - [j135]Gerard Jennhwa Chang, N. Narayanan:
On a conjecture on the balanced decomposition number. Discret. Math. 313(14): 1511-1514 (2013) - [j134]Gerard Jennhwa Chang, Chan-Wei Chang, David Kuo, Sheung-Hung Poon:
Algorithmic aspect of stratified domination in graphs. Inf. Process. Lett. 113(22-24): 861-865 (2013) - [j133]Chun-Hung Liu, Gerard J. Chang:
Roman domination on strongly chordal graphs. J. Comb. Optim. 26(3): 608-619 (2013) - [j132]Gerard Jennhwa Chang, Daphne Der-Fen Liu, Xuding Zhu:
A short proof for Chen's Alternative Kneser Coloring Lemma. J. Comb. Theory A 120(1): 159-163 (2013) - [j131]Gerard Jennhwa Chang, N. Narayanan:
Strong Chromatic Index of 2-Degenerate Graphs. J. Graph Theory 73(2): 119-126 (2013) - [j130]James K. Lan, Gerard Jennhwa Chang:
On the mixed domination problem in graphs. Theor. Comput. Sci. 476: 84-93 (2013) - 2012
- [j129]Wu-Hsiung Lin, Gerard J. Chang:
Equitable colorings of Cartesian products of graphs. Discret. Appl. Math. 160(3): 239-247 (2012) - [j128]Hsiang-Chun Hsu, Gerard Jennhwa Chang:
Balanced k-decompositions of graphs. Discret. Appl. Math. 160(10-11): 1639-1642 (2012) - [j127]Gerard Jennhwa Chang, Paul Dorbec, Mickaël Montassier, André Raspaud:
Generalized power domination of graphs. Discret. Appl. Math. 160(12): 1691-1698 (2012) - [j126]Bo-Jr Li, Gerard J. Chang:
Competition numbers of complete r-partite graphs. Discret. Appl. Math. 160(15): 2271-2276 (2012) - [j125]Chun-Hung Liu, Gerard Jennhwa Chang:
Upper bounds on Roman domination numbers of graphs. Discret. Math. 312(7): 1386-1391 (2012) - [j124]Gerard Jennhwa Chang, Daphne Der-Fen Liu:
Strong edge-coloring for cubic Halin graphs. Discret. Math. 312(8): 1468-1475 (2012) - [j123]Gerard Jennhwa Chang, Hsiang-Chun Hsu:
First-fit chromatic numbers of d-degenerate graphs. Discret. Math. 312(12-13): 2088-2090 (2012) - [j122]Gerard J. Chang, Nicolas Roussel:
(Δ+1)-total choosability of planar graphs with no cycles of length from 4 to k and without close triangles. Discret. Math. 312(14): 2126-2130 (2012) - [j121]Gerard Jennhwa Chang, Paul Dorbec, Hye Kyung Kim, André Raspaud, Haichao Wang, Weiliang Zhao:
Upper k-tuple domination in graphs. Discret. Math. Theor. Comput. Sci. 14(2): 285-292 (2012) - [j120]Bo-Jr Li, Gerard J. Chang:
The competition number of a graph with exactly two holes. J. Comb. Optim. 23(1): 1-8 (2012) - [j119]Gerard J. Chang, Ting-Pang Chang, Li-Da Tong:
Hamiltonian numbers of Möbius double loop networks. J. Comb. Optim. 23(4): 462-470 (2012) - [j118]Hsiang-Chun Hsu, Gerard J. Chang:
Parity and strong parity edge-colorings of graphs. J. Comb. Optim. 24(4): 427-436 (2012) - [j117]Chun-Hung Liu, Gerard J. Chang:
Roman Domination on 2-Connected Graphs. SIAM J. Discret. Math. 26(1): 193-205 (2012) - [j116]Gerard J. Chang, B. S. Panda, Dinabandhu Pradhan:
Complexity of distance paired-domination problem in graphs. Theor. Comput. Sci. 459: 89-99 (2012) - 2011
- [j115]Gerard Jennhwa Chang, Sheng-Hua Chen, Yongke Qu, Guoqing Wang, Haiyan Zhang:
On the Number of Subsequences with a Given Sum in a Finite Abelian Group. Electron. J. Comb. 18(1) (2011) - [j114]Gerard Jennhwa Chang, Jianfeng Hou, Nicolas Roussel:
Local condition for planar graphs of maximum degree 7 to be 8-totally colorable. Discret. Appl. Math. 159(8): 760-768 (2011) - [j113]Wu-Hsiung Lin, Gerard J. Chang:
Resource-sharing systems and hypergraph colorings. J. Comb. Optim. 22(4): 499-508 (2011) - [j112]Gerard J. Chang:
Near-automorphisms of paths. J. Graph Theory 68(4): 323-325 (2011) - 2010
- [j111]Yongqiang Zhao, Gerard J. Chang:
On competition polysemy and m-competition polysemy. Ars Comb. 97 (2010) - [j110]Yongqiang Zhao, Gerard J. Chang:
Multicompetition numbers of some multigraphs. Ars Comb. 97 (2010) - [j109]Gerard J. Chang, Jiaojiao Wu, Xuding Zhu:
Rainbow domination on trees. Discret. Appl. Math. 158(1): 8-12 (2010) - [j108]Wu-Hsiung Lin, Gerard J. Chang:
Equitable colorings of Kronecker products of graphs. Discret. Appl. Math. 158(16): 1816-1826 (2010) - [j107]Gerard Jennhwa Chang, Jianfeng Hou, Nicolas Roussel:
On the total choosability of planar graphs and of sparse graphs. Inf. Process. Lett. 110(20): 849-853 (2010) - [j106]Ching-Chi Lin, Gerard J. Chang, Gen-Huey Chen:
The degree-preserving spanning tree problem in strongly chordal and directed path graphs. Networks 56(3): 183-187 (2010) - [c8]Yongqiang Zhao, Gerard J. Chang:
Consecutive Edge-Colorings of Generalized θ-Graphs. CGGA 2010: 214-225
2000 – 2009
- 2009
- [j105]Bo-Jr Li, Gerard J. Chang:
The competition number of a graph with exactly h holes, all of which are independent. Discret. Appl. Math. 157(7): 1337-1341 (2009) - [j104]Gerard J. Chang, Changhong Lu, Sanming Zhou:
Distance-two labellings of Hamming graphs. Discret. Appl. Math. 157(8): 1896-1904 (2009) - [j103]Yongqiang Zhao, Gerard J. Chang:
Note on the m-step competition numbers of paths and cycles. Discret. Appl. Math. 157(8): 1953-1958 (2009) - [j102]Lian-Hwao Huang, Gerard J. Chang:
L(h, k)-labelings of Hamming graphs. Discret. Math. 309(8): 2197-2201 (2009) - [j101]Gerard J. Chang, Chen-Ying Lin, Li-Da Tong:
Independent arcs of acyclic orientations of complete r-partite graphs. Discret. Math. 309(13): 4280-4286 (2009) - [j100]Gerard J. Chang:
A note on equitable colorings of forests. Eur. J. Comb. 30(4): 809-812 (2009) - 2008
- [j99]Justie Su-tzu Juan, Gerard J. Chang:
Adaptive group testing for consecutive positives. Discret. Math. 308(7): 1124-1129 (2008) - [j98]Bo-Jr Li, Gerard J. Chang:
Clique coverings and partitions of line graphs. Discret. Math. 308(11): 2075-2079 (2008) - [j97]Gerard J. Chang:
The upper bound on k-tuple domination numbers of graphs. Eur. J. Comb. 29(5): 1333-1336 (2008) - [j96]Hsin-Hao Lai, Gerard J. Chang, Ko-Wei Lih:
On fully orientability of 2-degenerate graphs. Inf. Process. Lett. 105(5): 177-181 (2008) - [j95]Ruei-Yu Wu, Gen-Huey Chen, Jung-Sheng Fu, Gerard J. Chang:
Finding cycles in hierarchical hypercube networks. Inf. Process. Lett. 109(2): 112-115 (2008) - 2007
- [j94]Gerard J. Chang, Jer-Jeong Chen, David Kuo, Sheng-Chyang Liaw:
Distance-two labelings of digraphs. Discret. Appl. Math. 155(8): 1007-1013 (2007) - [j93]Ching-Chi Lin, Gerard J. Chang, Gen-Huey Chen:
Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs. Discret. Math. 307(2): 208-215 (2007) - [j92]Gerard J. Chang, Changhong Lu, Sanming Zhou:
No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups. Discret. Math. 307(14): 1808-1817 (2007) - [j91]Ruei-Yu Wu, Gen-Huey Chen, Yu-Liang Kuo, Gerard J. Chang:
Node-disjoint paths in hierarchical hypercube networks. Inf. Sci. 177(19): 4200-4207 (2007) - [j90]Gerard J. Chang, Hung-Lin Fu, Xuding Zhu:
Editorial note. J. Comb. Optim. 14(2-3): 111-112 (2007) - [j89]Justie Su-tzu Juan, Gerard J. Chang:
Group testing in graphs. J. Comb. Optim. 14(2-3): 113-119 (2007) - [j88]Yu-Ping Tsao, Gerard J. Chang:
Profile minimization on compositions of graphs. J. Comb. Optim. 14(2-3): 177-190 (2007) - [j87]Jer-Jeong Chen, Gerard J. Chang:
Distance graphs on R n with 1-norm. J. Comb. Optim. 14(2-3): 267-274 (2007) - [j86]Guey-Yun Chang, Gen-Huey Chen, Gerard J. Chang:
(t, k) - Diagnosis for Matching Composition Networks under the MM* Model. IEEE Trans. Computers 56(1): 73-79 (2007) - [j85]Jun-Jie Pan, Gerard J. Chang:
Induced-path partition on graphs with special blocks. Theor. Comput. Sci. 370(1-3): 121-130 (2007) - [j84]Gerard J. Chang, Sen-Peng Eu, Chung-Heng Yeh:
On the (n, t)-antipodal Gray codes. Theor. Comput. Sci. 374(1-3): 82-90 (2007) - [c7]Ruei-Yu Wu, Gen-Huey Chen, Jung-Sheng Fu, Gerard J. Chang:
Bipancyclicity of Hierarchical Hypercube Networks. PDPTA 2007: 180-184 - 2006
- [j83]Yu-Ping Tsao, Gerard J. Chang:
Profile minimization on products of graphs. Discret. Math. 306(8-9): 792-800 (2006) - [j82]Min Zhao, Liying Kang, Gerard J. Chang:
Power domination in graphs. Discret. Math. 306(15): 1812-1816 (2006) - [j81]Jun-Jie Pan, Gerard J. Chang:
Isometric path numbers of graphs. Discret. Math. 306(17): 2091-2096 (2006) - [j80]Guey-Yun Chang, Gen-Huey Chen, Gerard J. Chang:
(t, k)-Diagnosis for Matching Composition Networks. IEEE Trans. Computers 55(1): 88-92 (2006) - [c6]Ruei-Yu Wu, Gerard J. Chang, Gen-Huey Chen:
Node-disjoint paths in hierarchical hypercube networks. IPDPS 2006 - 2005
- [j79]Jun-Jie Pan, Gerard J. Chang:
Path partition for graphs with special blocks. Discret. Appl. Math. 145(3): 429-436 (2005) - [j78]Gerard Jennhwa Chang, Ton Kloks, Sheng-Lung Peng:
Probe interval bigraphs. Electron. Notes Discret. Math. 19: 195-201 (2005) - [j77]Jun-Jie Pan, Gerard J. Chang:
Isometric-path numbers of block graphs. Inf. Process. Lett. 93(2): 99-102 (2005) - [j76]Guey-Yun Chang, Gerard J. Chang, Gen-Huey Chen:
Diagnosabilities of Regular Networks. IEEE Trans. Parallel Distributed Syst. 16(4): 314-323 (2005) - [c5]Gerard Jennhwa Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng:
The PIGs Full Monty - A Floor Show of Minimal Separators. STACS 2005: 521-532 - 2004
- [j75]Gerard J. Chang:
The weighted independent domination problem is NP-complete for chordal graphs. Discret. Appl. Math. 143(1-3): 351-352 (2004) - [j74]Mingjang Chen, Gerard J. Chang, Douglas B. West:
Interval numbers of powers of block graph. Discret. Math. 275(1-3): 87-96 (2004) - [j73]Gerard J. Chang, Li-Da Tong, Hong-Tsu Wang:
Geodetic spectra of graphs. Eur. J. Comb. 25(3): 383-391 (2004) - [j72]Yung-Ling Lai, Gerard J. Chang:
On the profile of the corona of two graphs. Inf. Process. Lett. 89(6): 287-292 (2004) - [j71]Gerard J. Chang, Chiuyuan Chen, Yaping Chen:
Vertex and Tree Arboricities of Graphs. J. Comb. Optim. 8(3): 295-306 (2004) - [i2]Ching-Chi Lin, Gerard J. Chang, Gen-Huey Chen:
Locally connected spanning trees on graphs. CoRR cs.DS/0409013 (2004) - [i1]Guey-Yun Chang, Gerard J. Chang, Gen-Huey Chen:
Diagnosabilities of regular networks. CoRR cs.NI/0408022 (2004) - 2003
- [j70]Gerard J. Chang, Sheng-Chyang Liaw:
The L(2, 1)-labeling problem on ditrees. Ars Comb. 66 (2003) - [j69]Hong-Gwa Yeh, Gerard J. Chang:
Centers and medians of distance-hereditary graphs. Discret. Math. 265(1-3): 279-310 (2003) - [j68]Gerard J. Chang, Changhong Lu:
Distance-two labelings of graphs. Eur. J. Comb. 24(1): 53-58 (2003) - [j67]Chung-Shou Liao, Gerard J. Chang:
k-tuple domination in graphs. Inf. Process. Lett. 87(1): 45-50 (2003) - 2002
- [j66]Min-Jen Jou, Gerard J. Chang:
Algorithmic aspects of counting independent sets. Ars Comb. 65 (2002) - [j65]Maw-Shang Chang, Shaur-Ching Wu, Gerard J. Chang, Hong-Gwa Yeh:
Domination in distance-hereditary graphs. Discret. Appl. Math. 116(1-2): 103-113 (2002) - [j64]Gerard J. Chang, Sheng-Chyang Liaw, Hong-Gwa Yeh:
k-Subdomination in graphs. Discret. Appl. Math. 120(1-3): 55-60 (2002) - [j63]Mingjang Chen, Gerard J. Chang:
Total interval numbers of complete r-partite graphs. Discret. Appl. Math. 122(1-3): 83-92 (2002) - [j62]Gerard J. Chang, Li-Da Tong, Jing-Ho Yan, Hong-Gwa Yeh:
A note on the Gallai-Roy-Vitaver Theorem. Discret. Math. 256(1-2): 441-444 (2002) - [j61]Gerard J. Chang:
Corrigendum to "The path-partition problem in block graphs". Inf. Process. Lett. 83(5): 293 (2002) - 2001
- [j60]Gerard J. Chang, Justie Su-tzu Juan, Daphne Der-Fen Liu:
No-hole 2-distant colorings for unit interval graphs. Ars Comb. 61 (2001) - [j59]Venkatesan Guruswami, C. Pandu Rangan, Maw-Shang Chang, Gerard J. Chang, C. K. Wong:
The Kr-Packing Problem. Computing 66(1): 79-89 (2001) - [j58]Mingjang Chen, Gerard J. Chang:
Families of Graphs Closed Under Taking Powers. Graphs Comb. 17(2): 207-212 (2001) - [j57]Gerard J. Chang, Justie Su-tzu Juan, Daphne Der-Fen Liu:
Minimum Span of No-Hole (r+1)-Distant Colorings. SIAM J. Discret. Math. 14(3): 370-380 (2001) - [j56]Gerard J. Chang, Michel Deza, Yannis Manoussakis, Jean-Marc Steyaert:
Preface. Theor. Comput. Sci. 263(1-2): 1 (2001) - [j55]Hong-Gwa Yeh, Gerard J. Chang:
Weighted connected k-domination and weighted k-dominating clique in distance-hereditary graphs. Theor. Comput. Sci. 263(1-2): 3-8 (2001) - [j54]Li-Da Tong, Frank K. Hwang, Gerard J. Chang:
Channel graphs of bit permutation networks. Theor. Comput. Sci. 263(1-2): 139-143 (2001) - 2000
- [j53]Gerard J. Chang, Xuding Zhu:
Pseudo-Hamiltonian-connected graphs. Discret. Appl. Math. 100(3): 145-153 (2000) - [j52]Gerard J. Chang, Bor-Liang Chen, Hung-Lin Fu, Kuo-Ching Huang:
Linear k-arboricities on trees. Discret. Appl. Math. 103(1-3): 281-287 (2000) - [j51]Gerard J. Chang, Wen-Tsai Ke, David Kuo, Daphne Der-Fen Liu, Roger K. Yeh:
On L(d, 1)-labelings of graphs. Discret. Math. 220(1-3): 57-66 (2000) - [j50]Lingling Huang, Gerard J. Chang:
Circular Chromatic Numbers of Distance Graphs with Distance Sets Missing Multiples. Eur. J. Comb. 21(2): 241-248 (2000)
1990 – 1999
- 1999
- [j49]Sheng-Chyang Liaw, David Kuo, Gerard J. Chang:
Integral Sum Numbers of Graphs. Ars Comb. 54 (1999) - [j48]Sheng-Chyang Liaw, Gerard J. Chang:
Rabin numbers of Butterfly networks. Discret. Math. 196(1-3): 219-227 (1999) - [j47]Gerard J. Chang, Min-Jen Jou:
The number of maximal independent sets in connected triangle-free graphs. Discret. Math. 197-198: 169-178 (1999) - [j46]Gerard J. Chang, Bhaskar DasGupta, Wayne M. Dymàcek, Martin Fürer, Matthew Koerlin, Yueh-Shin Lee, Tom Whaley:
Characterizations of bipartite Steinhaus graphs. Discret. Math. 199(1-3): 11-25 (1999) - [j45]Gerard J. Chang, Lingling Huang, Xuding Zhu:
Circular chromatic numbers of Mycielski's graphs. Discret. Math. 205(1-3): 23-37 (1999) - [j44]Shin-Jie Hu, Justie Su-tzu Juan, Gerard J. Chang:
T-Colorings and T-Edge Spans of Graphs. Graphs Comb. 15(3): 295-301 (1999) - [j43]Gerard J. Chang, Daphne Der-Fen Liu, Xuding Zhu:
Distance Graphs and T-Coloring. J. Comb. Theory B 75(2): 259-269 (1999) - [j42]Xiaoyun Lu, Da-Wei Wang, Gerard J. Chang, In-Jen Lin, C. K. Wong:
On k-ary spanning trees of tournaments. J. Graph Theory 30(3): 167-176 (1999) - [j41]Gerard J. Chang, Frank K. Hwang, Li-Da Tong:
The consecutive-4 digraphs are Hamiltonian. J. Graph Theory 31(1): 1-6 (1999) - [j40]Lingling Huang, Gerard J. Chang:
The circular chromatic number of the Mycielskian of G. J. Graph Theory 32(1): 63-71 (1999) - [j39]Gerard J. Chang, Frank K. Hwang, Li-Da Tong:
Characterizing bit permutation networks. Networks 33(4): 261-267 (1999) - 1998
- [j38]Hong-Gwa Yeh, Gerard J. Chang:
Weighted Connected Domination and Steiner Trees in Distance-hereditary Graphs. Discret. Appl. Math. 87(1-3): 245-253 (1998) - [j37]Frank K. Hwang, Gerard J. Chang:
Enumerating Consecutive and Nested Partitions for Graphs. Eur. J. Comb. 19(1): 63-70 (1998) - [j36]Gerard J. Chang, Lingling Huang, Xuding Zhu:
Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs. Eur. J. Comb. 19(4): 423-431 (1998) - [j35]Sheng-Chyang Liaw, Gerard J. Chang:
Generalized Diameters and Rabin Numbers of Networks. J. Comb. Optim. 2(4): 371-384 (1998) - [j34]Gerard J. Chang, Fu-Loong Chen, Lingling Huang, Frank K. Hwang, Su-Tzu Nuan, Uriel G. Rothblum, I-Fan Sun, Jan-Wen Wang, Hong-Gwa Yeh:
Sortabilities of Partition Properties. J. Comb. Optim. 2(4): 413-427 (1998) - [j33]Gerard J. Chang, Frank K. Hwang, Yi-Ching Yao:
Localizing Combinatorial Properties for Partitions on Block Graphs. J. Comb. Optim. 2(4): 429-441 (1998) - [j32]Shiow-Fen Hwang, Gerard J. Chang:
k-Neighborhood-Covering and -Independence Problems for Chordal Graphs. SIAM J. Discret. Math. 11(4): 633-643 (1998) - [c4]Venkatesan Guruswami, C. Pandu Rangan, Maw-Shang Chang, Gerard J. Chang, C. K. Wong:
The Vertex-Disjoint Triangles Problem. WG 1998: 26-37 - 1997
- [j31]Gerard J. Chang, Pei-Hsin Ho:
The ß-assignment problem in general graphs. Comput. Oper. Res. 24(8): 757-765 (1997) - [j30]Jing-Ho Yan, Gerard J. Chang, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi:
k-Path Partitions in Trees. Discret. Appl. Math. 78(1-3): 227-233 (1997) - [j29]Min-Jen Jou, Gerard J. Chang:
Maximal Independent Sets in Graphs with at Most One Cycle. Discret. Appl. Math. 79(1-3): 67-73 (1997) - [j28]Yuh-Jiuan Tsay, Gerard J. Chang:
The exact gossiping problem. Discret. Math. 163(1-3): 165-172 (1997) - [j27]David Kuo, Gerard J. Chang, Y. H. Harris Kwong:
Cordial labeling of mKn. Discret. Math. 169(1-3): 121-131 (1997) - [j26]Chiuyuan Chen, Chin-Chen Chang, Gerard J. Chang:
Proper interval graphs and the guard problem. Discret. Math. 170(1-3): 223-230 (1997) - [j25]Jing-Ho Yan, Ko-Wei Lih, David Kuo, Gerard J. Chang:
Signed degree sequences of signed graphs. J. Graph Theory 26(2): 111-117 (1997) - [j24]Gerard J. Chang, Frank K. Hwang:
Optimality of consecutive and nested tree partitions. Networks 30(2): 75-80 (1997) - [c3]Gerard J. Chang, Frank K. Hwang, Li-Da Tong:
Characterizing bit permutation networks. Advances in Switching Networks 1997: 157-167 - 1996
- [j23]Maw-Shang Chang, Yi-Hua Chen, Gerard J. Chang, Jing-Ho Yan:
Algorithmic Aspects of the Generalized Clique-transversal Problem on Chordal Graphs. Discret. Appl. Math. 66(3): 189-203 (1996) - [j22]Jing-Ho Yan, Jer-Jeong Chen, Gerard J. Chang:
Quasi-threshold Graphs. Discret. Appl. Math. 69(3): 247-255 (1996) - [j21]Gerard J. Chang, Yuh-Jiuan Tsay:
The partial gossiping problem. Discret. Math. 148(1-3): 9-14 (1996) - [j20]Min-Jen Jou, Gerard J. Chang, Chiang Lin, Tze-Heng Ma:
A finiteness theorem for maximal independent sets. Graphs Comb. 12(1): 321-326 (1996) - [j19]Gerard J. Chang, David Kuo:
The L(2, 1)-Labeling Problem on Graphs. SIAM J. Discret. Math. 9(2): 309-316 (1996) - 1995
- [j18]Gerard J. Chang, C. Pandu Rangan, Satyan R. Coorg:
Weighted Independent Perfect Domination on Cocomparability Graphs. Discret. Appl. Math. 63(3): 215-222 (1995) - [j17]Gerard J. Chang, Shiow-Fen Hwang:
The edge domination problem. Discuss. Math. Graph Theory 15(1): 51-57 (1995) - [c2]Hong-Gwa Yeh, Gerard J. Chang:
Weighted Connected Domination and Steiner Trees in Distance-Hereditary Graphs. Combinatorics and Computer Science 1995: 48-52 - 1994
- [j16]Gerard J. Chang:
The domatic number problem. Discret. Math. 125(1-3): 115-122 (1994) - [j15]Shiow-Fen Hwang, Gerard J. Chang:
Edge domatic numbers of complete n- partite graphs. Graphs Comb. 10(2-4): 241-248 (1994) - [j14]Jing-Ho Yan, Gerard J. Chang:
The Path-Partition Problem in Block Graphs. Inf. Process. Lett. 52(6): 317-322 (1994) - [j13]Hai-Yen Lee, Gerard J. Chang:
The w-median of a connected strongly chordal graph. J. Graph Theory 18(7): 673-680 (1994) - [j12]David Kuo, Gerard J. Chang:
The Profile Minimization Problem in Trees. SIAM J. Comput. 23(1): 71-81 (1994) - 1993
- [j11]Gerard J. Chang, Martin Farber, Zsolt Tuza:
Algorithmic Aspects of Neighborhood Numbers. SIAM J. Discret. Math. 6(1): 24-29 (1993) - [c1]Gerard J. Chang, C. Pandu Rangan, Satyan R. Coorg:
Weighted Independent Perfect Domination on Cocomparability Graphs. ISAAC 1993: 506-514 - 1992
- [j10]Hsun-Ming Lee, Gerard J. Chang:
Set to Set Broadcasting in Communication Networks. Discret. Appl. Math. 40(4): 411-421 (1992) - 1991
- [j9]Gerard J. Chang:
Centers of chordal graphs. Graphs Comb. 7(4): 305-313 (1991) - 1990
- [j8]Feng-Chu Lai, Gerard J. Chang:
An upper bound for the transversal numbers of 4-uniform hypergraphs. J. Comb. Theory B 50(1): 129-133 (1990) - [j7]Tung-Lin Lu, Pei-Hsin Ho, Gerard J. Chang:
The Domatic Number Problem in Interval Graphs. SIAM J. Discret. Math. 3(4): 531-536 (1990)
1980 – 1989
- 1989
- [j6]Gerard J. Chang:
On the Number of SDR of a (t, n)-family. Eur. J. Comb. 10(3): 231-234 (1989) - 1988
- [j5]Gerard J. Chang:
Labeling algorithms for domination problems in sun-free chordal graphs. Discret. Appl. Math. 22(1): 21-34 (1988) - 1985
- [j4]Gerard J. Chang, Frank K. Hwang:
Diagonal and Pandiagonal Tournament Latin Squares. Eur. J. Comb. 6(2): 149-155 (1985) - 1982
- [j3]Gerard J. Chang, Frank K. Hwang, Shen Lin:
Group testing with two defectives. Discret. Appl. Math. 4(2): 97-102 (1982) - [j2]Gerard J. Chang, George L. Nemhauser:
R-domination on block graphs. Oper. Res. Lett. 1(6): 214-218 (1982) - 1980
- [j1]Gerard J. Chang, Frank K. Hwang:
A Group Testing Problem. SIAM J. Algebraic Discret. Methods 1(1): 21-24 (1980)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
