Gerard J. Chang

134 papers A 1B 2Misc 1Journal 127Unranked 3
YearRankTypeTitle / Venue / Authors
2016 J jnl
Edge Roman Domination on Graphs.
Graphs Comb.
Gerard J. Chang, Sheng-Hua Chen, Chun-Hung Liu
2015 J jnl
Strong edge-coloring for jellyfish graphs.
Discret. Math.
Gerard J. Chang, Sheng-Hua Chen, Chi-Yun Hsu, Chia-Man Hung, Huei-ling Lai
2013 J jnl
A Linear-Time Algorithm for Finding Locally Connected Spanning Trees on Circular-Arc Graphs.
Algorithmica
Ching-Chi Lin, Gen-Huey Chen, Gerard J. Chang
2013 J jnl
Rainbow domination and related problems on strongly chordal graphs.
Discret. Appl. Math.
Gerard J. Chang, Bo-Jr Li, Jiaojiao Wu
2013 J jnl
Roman domination on strongly chordal graphs.
J. Comb. Optim.
Chun-Hung Liu, Gerard J. Chang
2013 J jnl
b-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture.
Discret. Appl. Math.
Wu-Hsiung Lin, Gerard J. Chang
2012 J jnl
(Δ+1)-total choosability of planar graphs with no cycles of length from 4 to k and without close triangles.
Discret. Math.
Gerard J. Chang, Nicolas Roussel
2012 J jnl
Competition numbers of complete r-partite graphs.
Discret. Appl. Math.
Bo-Jr Li, Gerard J. Chang
2012 J jnl
Complexity of distance paired-domination problem in graphs.
Theor. Comput. Sci.
Gerard J. Chang, B. S. Panda, Dinabandhu Pradhan
2012 J jnl
Equitable colorings of Cartesian products of graphs.
Discret. Appl. Math.
Wu-Hsiung Lin, Gerard J. Chang
2012 J jnl
Hamiltonian numbers of Möbius double loop networks.
J. Comb. Optim.
Gerard J. Chang, Ting-Pang Chang, Li-Da Tong
2012 J jnl
Parity and strong parity edge-colorings of graphs.
J. Comb. Optim.
Hsiang-Chun Hsu, Gerard J. Chang
2012 J jnl
Roman Domination on 2-Connected Graphs.
SIAM J. Discret. Math.
Chun-Hung Liu, Gerard J. Chang
2012 J jnl
The competition number of a graph with exactly two holes.
J. Comb. Optim.
Bo-Jr Li, Gerard J. Chang
2011 J jnl
Near-automorphisms of paths.
J. Graph Theory
Gerard J. Chang
2011 J jnl
Resource-sharing systems and hypergraph colorings.
J. Comb. Optim.
Wu-Hsiung Lin, Gerard J. Chang
2010 — conf
Consecutive Edge-Colorings of Generalized θ-Graphs.
CGGA
Yongqiang Zhao, Gerard J. Chang
2010 J jnl
Equitable colorings of Kronecker products of graphs.
Discret. Appl. Math.
Wu-Hsiung Lin, Gerard J. Chang
2010 J jnl
Multicompetition numbers of some multigraphs.
Ars Comb.
Yongqiang Zhao, Gerard J. Chang
2010 J jnl
On competition polysemy and m-competition polysemy.
Ars Comb.
Yongqiang Zhao, Gerard J. Chang
2010 J jnl
Rainbow domination on trees.
Discret. Appl. Math.
Gerard J. Chang, Jiaojiao Wu, Xuding Zhu
2010 J jnl
The degree-preserving spanning tree problem in strongly chordal and directed path graphs.
Networks
Ching-Chi Lin, Gerard J. Chang, Gen-Huey Chen
2009 J jnl
A note on equitable colorings of forests.
Eur. J. Comb.
Gerard J. Chang
2009 J jnl
Distance-two labellings of Hamming graphs.
Discret. Appl. Math.
Gerard J. Chang, Changhong Lu, Sanming Zhou
2009 J jnl
Independent arcs of acyclic orientations of complete r-partite graphs.
Discret. Math.
Gerard J. Chang, Chen-Ying Lin, Li-Da Tong
2009 J jnl
L(h, k)-labelings of Hamming graphs.
Discret. Math.
Lian-Hwao Huang, Gerard J. Chang
2009 J jnl
Note on the m-step competition numbers of paths and cycles.
Discret. Appl. Math.
Yongqiang Zhao, Gerard J. Chang
2009 J jnl
The competition number of a graph with exactly h holes, all of which are independent.
Discret. Appl. Math.
Bo-Jr Li, Gerard J. Chang
2008 J jnl
Adaptive group testing for consecutive positives.
Discret. Math.
Justie Su-tzu Juan, Gerard J. Chang
2008 J jnl
Clique coverings and partitions of line graphs.
Discret. Math.
Bo-Jr Li, Gerard J. Chang
2008 J jnl
Finding cycles in hierarchical hypercube networks.
Inf. Process. Lett.
Ruei-Yu Wu, Gen-Huey Chen, Jung-Sheng Fu, Gerard J. Chang
2008 J jnl
On fully orientability of 2-degenerate graphs.
Inf. Process. Lett.
Hsin-Hao Lai, Gerard J. Chang, Ko-Wei Lih
2008 J jnl
The upper bound on k-tuple domination numbers of graphs.
Eur. J. Comb.
Gerard J. Chang
2007 J jnl
(t, k) - Diagnosis for Matching Composition Networks under the MM* Model.
IEEE Trans. Computers
Guey-Yun Chang, Gen-Huey Chen, Gerard J. Chang
2007 Misc conf
Bipancyclicity of Hierarchical Hypercube Networks.
PDPTA
Ruei-Yu Wu, Gen-Huey Chen, Jung-Sheng Fu, Gerard J. Chang
2007 J jnl
Distance graphs on R
J. Comb. Optim.
Jer-Jeong Chen, Gerard J. Chang
2007 J jnl
Distance-two labelings of digraphs.
Discret. Appl. Math.
Gerard J. Chang, Jer-Jeong Chen, David Kuo, Sheng-Chyang Liaw
2007 J jnl
Editorial note.
J. Comb. Optim.
Gerard J. Chang, Hung-Lin Fu, Xuding Zhu
2007 J jnl
Group testing in graphs.
J. Comb. Optim.
Justie Su-tzu Juan, Gerard J. Chang
2007 J jnl
Induced-path partition on graphs with special blocks.
Theor. Comput. Sci.
Jun-Jie Pan, Gerard J. Chang
2007 J jnl
Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs.
Discret. Math.
Ching-Chi Lin, Gerard J. Chang, Gen-Huey Chen
2007 J jnl
No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups.
Discret. Math.
Gerard J. Chang, Changhong Lu, Sanming Zhou
2007 J jnl
Node-disjoint paths in hierarchical hypercube networks.
Inf. Sci.
Ruei-Yu Wu, Gen-Huey Chen, Yu-Liang Kuo, Gerard J. Chang
2007 J jnl
On the (n, t)-antipodal Gray codes.
Theor. Comput. Sci.
Gerard J. Chang, Sen-Peng Eu, Chung-Heng Yeh
2007 J jnl
Profile minimization on compositions of graphs.
J. Comb. Optim.
Yu-Ping Tsao, Gerard J. Chang
2006 J jnl
(t, k)-Diagnosis for Matching Composition Networks.
IEEE Trans. Computers
Guey-Yun Chang, Gen-Huey Chen, Gerard J. Chang
2006 J jnl
Isometric path numbers of graphs.
Discret. Math.
Jun-Jie Pan, Gerard J. Chang
2006 A conf
Node-disjoint paths in hierarchical hypercube networks.
IPDPS
Ruei-Yu Wu, Gerard J. Chang, Gen-Huey Chen
2006 J jnl
Power domination in graphs.
Discret. Math.
Min Zhao, Liying Kang, Gerard J. Chang
2006 J jnl
Profile minimization on products of graphs.
Discret. Math.
Yu-Ping Tsao, Gerard J. Chang
2005 J jnl
Diagnosabilities of Regular Networks.
IEEE Trans. Parallel Distributed Syst.
Guey-Yun Chang, Gerard J. Chang, Gen-Huey Chen
2005 J jnl
Isometric-path numbers of block graphs.
Inf. Process. Lett.
Jun-Jie Pan, Gerard J. Chang
2005 J jnl
Path partition for graphs with special blocks.
Discret. Appl. Math.
Jun-Jie Pan, Gerard J. Chang
2004 J jnl
Diagnosabilities of regular networks
CoRR
Guey-Yun Chang, Gerard J. Chang, Gen-Huey Chen
2004 J jnl
Geodetic spectra of graphs.
Eur. J. Comb.
Gerard J. Chang, Li-Da Tong, Hong-Tsu Wang
2004 J jnl
Interval numbers of powers of block graph.
Discret. Math.
Mingjang Chen, Gerard J. Chang, Douglas B. West
2004 J jnl
Locally connected spanning trees on graphs
CoRR
Ching-Chi Lin, Gerard J. Chang, Gen-Huey Chen
2004 J jnl
On the profile of the corona of two graphs.
Inf. Process. Lett.
Yung-Ling Lai, Gerard J. Chang
2004 J jnl
The weighted independent domination problem is NP-complete for chordal graphs.
Discret. Appl. Math.
Gerard J. Chang
2004 J jnl
Vertex and Tree Arboricities of Graphs.
J. Comb. Optim.
Gerard J. Chang, Chiuyuan Chen, Yaping Chen
2003 J jnl
Centers and medians of distance-hereditary graphs.
Discret. Math.
Hong-Gwa Yeh, Gerard J. Chang
2003 J jnl
Distance-two labelings of graphs.
Eur. J. Comb.
Gerard J. Chang, Changhong Lu
2003 J jnl
The L(2, 1)-labeling problem on ditrees.
Ars Comb.
Gerard J. Chang, Sheng-Chyang Liaw
2003 J jnl
k-tuple domination in graphs.
Inf. Process. Lett.
Chung-Shou Liao, Gerard J. Chang
2002 J jnl
A note on the Gallai-Roy-Vitaver Theorem.
Discret. Math.
Gerard J. Chang, Li-Da Tong, Jing-Ho Yan, Hong-Gwa Yeh
2002 J jnl
Algorithmic aspects of counting independent sets.
Ars Comb.
Min-Jen Jou, Gerard J. Chang
2002 J jnl
Corrigendum to "The path-partition problem in block graphs".
Inf. Process. Lett.
Gerard J. Chang
2002 J jnl
Domination in distance-hereditary graphs.
Discret. Appl. Math.
Maw-Shang Chang, Shaur-Ching Wu, Gerard J. Chang, Hong-Gwa Yeh
2002 J jnl
Total interval numbers of complete r-partite graphs.
Discret. Appl. Math.
Mingjang Chen, Gerard J. Chang
2002 J jnl
k-Subdomination in graphs.
Discret. Appl. Math.
Gerard J. Chang, Sheng-Chyang Liaw, Hong-Gwa Yeh
2001 J jnl
Channel graphs of bit permutation networks.
Theor. Comput. Sci.
Li-Da Tong, Frank K. Hwang, Gerard J. Chang
2001 J jnl
Families of Graphs Closed Under Taking Powers.
Graphs Comb.
Mingjang Chen, Gerard J. Chang
2001 J jnl
Minimum Span of No-Hole (r+1)-Distant Colorings.
SIAM J. Discret. Math.
Gerard J. Chang, Justie Su-tzu Juan, Daphne Der-Fen Liu
2001 J jnl
No-hole 2-distant colorings for unit interval graphs.
Ars Comb.
Gerard J. Chang, Justie Su-tzu Juan, Daphne Der-Fen Liu
2001 J jnl
Preface.
Theor. Comput. Sci.
Gerard J. Chang, Michel Deza, Yannis Manoussakis, Jean-Marc Steyaert
2001 J jnl
The K
Computing
Venkatesan Guruswami, C. Pandu Rangan, Maw-Shang Chang, Gerard J. Chang, C. K. Wong
2001 J jnl
Weighted connected k-domination and weighted k-dominating clique in distance-hereditary graphs.
Theor. Comput. Sci.
Hong-Gwa Yeh, Gerard J. Chang
2000 J jnl
Circular Chromatic Numbers of Distance Graphs with Distance Sets Missing Multiples.
Eur. J. Comb.
Lingling Huang, Gerard J. Chang
2000 J jnl
Linear k-arboricities on trees.
Discret. Appl. Math.
Gerard J. Chang, Bor-Liang Chen, Hung-Lin Fu, Kuo-Ching Huang
2000 J jnl
On
Discret. Math.
Gerard J. Chang, Wen-Tsai Ke, David Kuo, Daphne Der-Fen Liu, Roger K. Yeh
2000 J jnl
Pseudo-Hamiltonian-connected graphs.
Discret. Appl. Math.
Gerard J. Chang, Xuding Zhu
1999 J jnl
Characterizations of bipartite Steinhaus graphs.
Discret. Math.
Gerard J. Chang, Bhaskar DasGupta, Wayne M. Dymàcek, Martin Fürer, Matthew Koerlin, Yueh-Shin Lee, Tom P. Whaley
1999 J jnl
Characterizing bit permutation networks.
Networks
Gerard J. Chang, Frank K. Hwang, Li-Da Tong
1999 J jnl
Circular chromatic numbers of Mycielski's graphs.
Discret. Math.
Gerard J. Chang, Lingling Huang, Xuding Zhu
1999 J jnl
Distance Graphs and T-Coloring.
J. Comb. Theory B
Gerard J. Chang, Daphne Der-Fen Liu, Xuding Zhu
1999 J jnl
Integral Sum Numbers of Graphs.
Ars Comb.
Sheng-Chyang Liaw, David Kuo, Gerard J. Chang
1999 J jnl
On
J. Graph Theory
Xiaoyun Lu, Da-Wei Wang, Gerard J. Chang, In-Jen Lin, C. K. Wong
1999 J jnl
Rabin numbers of Butterfly networks.
Discret. Math.
Sheng-Chyang Liaw, Gerard J. Chang
1999 J jnl
T-Colorings and T-Edge Spans of Graphs.
Graphs Comb.
Shin-Jie Hu, Justie Su-tzu Juan, Gerard J. Chang
1999 J jnl
The circular chromatic number of the Mycielskian of
J. Graph Theory
Lingling Huang, Gerard J. Chang
1999 J jnl
The consecutive-4 digraphs are Hamiltonian.
J. Graph Theory
Gerard J. Chang, Frank K. Hwang, Li-Da Tong
1999 J jnl
The number of maximal independent sets in connected triangle-free graphs.
Discret. Math.
Gerard J. Chang, Min-Jen Jou
1998 J jnl
Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs.
Eur. J. Comb.
Gerard J. Chang, Lingling Huang, Xuding Zhu
1998 J jnl
Enumerating Consecutive and Nested Partitions for Graphs.
Eur. J. Comb.
Frank K. Hwang, Gerard J. Chang
1998 J jnl
Generalized Diameters and Rabin Numbers of Networks.
J. Comb. Optim.
Sheng-Chyang Liaw, Gerard J. Chang
1998 J jnl
Localizing Combinatorial Properties for Partitions on Block Graphs.
J. Comb. Optim.
Gerard J. Chang, Frank K. Hwang, Yi-Ching Yao
1998 J jnl
Sortabilities of Partition Properties.
J. Comb. Optim.
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
1998 B conf
The Vertex-Disjoint Triangles Problem.
WG
Venkatesan Guruswami, C. Pandu Rangan, Maw-Shang Chang, Gerard J. Chang, C. K. Wong
1998 J jnl
Weighted Connected Domination and Steiner Trees in Distance-hereditary Graphs.
Discret. Appl. Math.
Hong-Gwa Yeh, Gerard J. Chang
1998 J jnl
k-Neighborhood-Covering and -Independence Problems for Chordal Graphs.
SIAM J. Discret. Math.
Shiow-Fen Hwang, Gerard J. Chang
1997 — conf
Characterizing bit permutation networks.
Advances in Switching Networks
Gerard J. Chang, Frank K. Hwang, Li-Da Tong
1997 J jnl
Cordial labeling of mK
Discret. Math.
David Kuo, Gerard J. Chang, Y. H. Harris Kwong
1997 J jnl
Maximal Independent Sets in Graphs with at Most One Cycle.
Discret. Appl. Math.
Min-Jen Jou, Gerard J. Chang
1997 J jnl
Optimality of consecutive and nested tree partitions.
Networks
Gerard J. Chang, Frank K. Hwang
1997 J jnl
Proper interval graphs and the guard problem.
Discret. Math.
Chiuyuan Chen, Chin-Chen Chang, Gerard J. Chang
1997 J jnl
Signed degree sequences of signed graphs.
J. Graph Theory
Jing-Ho Yan, Ko-Wei Lih, David Kuo, Gerard J. Chang
1997 J jnl
The exact gossiping problem.
Discret. Math.
Yuh-Jiuan Tsay, Gerard J. Chang
1997 J jnl
The ß-assignment problem in general graphs.
Comput. Oper. Res.
Gerard J. Chang, Pei-Hsin Ho
1997 J jnl
k-Path Partitions in Trees.
Discret. Appl. Math.
Jing-Ho Yan, Gerard J. Chang, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi
1996 J jnl
A finiteness theorem for maximal independent sets.
Graphs Comb.
Min-Jen Jou, Gerard J. Chang, Chiang Lin, Tze-Heng Ma
1996 J jnl
Algorithmic Aspects of the Generalized Clique-transversal Problem on Chordal Graphs.
Discret. Appl. Math.
Maw-Shang Chang, Yi-Hua Chen, Gerard J. Chang, Jing-Ho Yan
1996 J jnl
Quasi-threshold Graphs.
Discret. Appl. Math.
Jing-Ho Yan, Jer-Jeong Chen, Gerard J. Chang
1996 J jnl
The L(2, 1)-Labeling Problem on Graphs.
SIAM J. Discret. Math.
Gerard J. Chang, David Kuo
1996 J jnl
The partial gossiping problem.
Discret. Math.
Gerard J. Chang, Yuh-Jiuan Tsay
1995 J jnl
The edge domination problem.
Discuss. Math. Graph Theory
Gerard J. Chang, Shiow-Fen Hwang
1995 — conf
Weighted Connected Domination and Steiner Trees in Distance-Hereditary Graphs.
Combinatorics and Computer Science
Hong-Gwa Yeh, Gerard J. Chang
1995 J jnl
Weighted Independent Perfect Domination on Cocomparability Graphs.
Discret. Appl. Math.
Gerard J. Chang, C. Pandu Rangan, Satyan R. Coorg
1994 J jnl
Edge domatic numbers of complete n- partite graphs.
Graphs Comb.
Shiow-Fen Hwang, Gerard J. Chang
1994 J jnl
The
J. Graph Theory
Hai-Yen Lee, Gerard J. Chang
1994 J jnl
The Path-Partition Problem in Block Graphs.
Inf. Process. Lett.
Jing-Ho Yan, Gerard J. Chang
1994 J jnl
The Profile Minimization Problem in Trees.
SIAM J. Comput.
David Kuo, Gerard J. Chang
1994 J jnl
The domatic number problem.
Discret. Math.
Gerard J. Chang
1993 J jnl
Algorithmic Aspects of Neighborhood Numbers.
SIAM J. Discret. Math.
Gerard J. Chang, Martin Farber, Zsolt Tuza
1993 B conf
Weighted Independent Perfect Domination on Cocomparability Graphs.
ISAAC
Gerard J. Chang, C. Pandu Rangan, Satyan R. Coorg
1992 J jnl
Set to Set Broadcasting in Communication Networks.
Discret. Appl. Math.
Hsun-Ming Lee, Gerard J. Chang
1991 J jnl
Centers of chordal graphs.
Graphs Comb.
Gerard J. Chang
1990 J jnl
An upper bound for the transversal numbers of 4-uniform hypergraphs.
J. Comb. Theory B
Feng-Chu Lai, Gerard J. Chang
1990 J jnl
The Domatic Number Problem in Interval Graphs.
SIAM J. Discret. Math.
Tung-Lin Lu, Pei-Hsin Ho, Gerard J. Chang
1989 J jnl
On the Number of SDR of a (t, n)-family.
Eur. J. Comb.
Gerard J. Chang
1988 J jnl
Labeling algorithms for domination problems in sun-free chordal graphs.
Discret. Appl. Math.
Gerard J. Chang
1985 J jnl
Diagonal and Pandiagonal Tournament Latin Squares.
Eur. J. Comb.
Gerard J. Chang, Frank K. Hwang
1982 J jnl
Group testing with two defectives.
Discret. Appl. Math.
Gerard J. Chang, Frank K. Hwang, Shen Lin
1982 J jnl
R-domination on block graphs.
Oper. Res. Lett.
Gerard J. Chang, George L. Nemhauser
1980 J jnl
A Group Testing Problem.
SIAM J. Algebraic Discret. Methods
Gerard J. Chang, Frank K. Hwang