| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Bo-Jr Li, Gerard J. Chang |
The competition number of a graph with exactly two holes.  |
J. Comb. Optim.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerard J. Chang, Ting-Pang Chang, Li-Da Tong |
Hamiltonian numbers of Möbius double loop networks.  |
J. Comb. Optim.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerard J. Chang, Nicolas Roussel |
(Δ+1)-total choosability of planar graphs with no cycles of length from 4 to k and without close triangles.  |
Discrete Mathematics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Chun-Hung Liu, Gerard J. Chang |
Roman Domination on 2-Connected Graphs.  |
SIAM J. Discrete Math.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Wu-Hsiung Lin, Gerard J. Chang |
Equitable colorings of Cartesian products of graphs.  |
Discrete Applied Mathematics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerard Jennhwa Chang, Daphne Der-Fen Liu |
Strong edge-coloring for cubic Halin graphs.  |
Discrete Mathematics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Chun-Hung Liu, Gerard Jennhwa Chang |
Upper bounds on Roman domination numbers of graphs.  |
Discrete Mathematics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Hsiang-Chun Hsu, Gerard Jennhwa Chang |
Balanced k-decompositions of graphs.  |
Discrete Applied Mathematics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Wu-Hsiung Lin, Gerard J. Chang |
Resource-sharing systems and hypergraph colorings.  |
J. Comb. Optim.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerard J. Chang |
Near-automorphisms of paths.  |
Journal of Graph Theory  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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.  |
Electr. J. Comb.  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Gerard Jennhwa Chang, Jianfeng Hou, Nicolas Roussel |
Local condition for planar graphs of maximum degree 7 to be 8-totally colorable.  |
Discrete Applied Mathematics  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ching-Chi Lin, Gerard J. Chang, Gen-Huey Chen |
The degree-preserving spanning tree problem in strongly chordal and directed path graphs.  |
Networks  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerard J. Chang, Jiaojiao Wu, Xuding Zhu |
Rainbow domination on trees.  |
Discrete Applied Mathematics  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Wu-Hsiung Lin, Gerard J. Chang |
Equitable colorings of Kronecker products of graphs.  |
Discrete Applied Mathematics  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Yongqiang Zhao, Gerard J. Chang |
Consecutive Edge-Colorings of Generalized θ-Graphs.  |
CGGA  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerard Jennhwa Chang, Jianfeng Hou, Nicolas Roussel |
On the total choosability of planar graphs and of sparse graphs.  |
Inf. Process. Lett.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Lian-Hwao Huang, Gerard J. Chang |
L(h, k)-labelings of Hamming graphs.  |
Discrete Mathematics  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerard J. Chang, Chen-Ying Lin, Li-Da Tong |
Independent arcs of acyclic orientations of complete r-partite graphs.  |
Discrete Mathematics  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerard J. Chang |
A note on equitable colorings of forests.  |
Eur. J. Comb.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Bo-Jr Li, Gerard J. Chang |
The competition number of a graph with exactly h holes, all of which are independent.  |
Discrete Applied Mathematics  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yongqiang Zhao, Gerard J. Chang |
Note on the m-step competition numbers of paths and cycles.  |
Discrete Applied Mathematics  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerard J. Chang, Changhong Lu, Sanming Zhou |
Distance-two labellings of Hamming graphs.  |
Discrete Applied Mathematics  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hsin-Hao Lai, Gerard J. Chang, Ko-Wei Lih |
On fully orientability of 2-degenerate graphs.  |
Inf. Process. Lett.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ruei-Yu Wu, Gen-Huey Chen, Jung-Sheng Fu, Gerard J. Chang |
Finding cycles in hierarchical hypercube networks.  |
Inf. Process. Lett.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Bo-Jr Li, Gerard J. Chang |
Clique coverings and partitions of line graphs.  |
Discrete Mathematics  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Justie Su-tzu Juan, Gerard J. Chang |
Adaptive group testing for consecutive positives.  |
Discrete Mathematics  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerard J. Chang |
The upper bound on k-tuple domination numbers of graphs.  |
Eur. J. Comb.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jer-Jeong Chen, Gerard J. Chang |
Distance graphs on R n with 1-norm.  |
J. Comb. Optim.  |
2007 |
DBLP DOI BibTeX RDF |
Distance graph, 1-norm, Component, Metric space, Chromatic number, Degree |
| 1 | Justie Su-tzu Juan, Gerard J. Chang |
Group testing in graphs.  |
J. Comb. Optim.  |
2007 |
DBLP DOI BibTeX RDF |
Sample space, Algorithm, Graph, Bipartite graph, Group testing |
| 1 | Gerard J. Chang, Hung-Lin Fu, Xuding Zhu |
Editorial note.  |
J. Comb. Optim.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Yu-Ping Tsao, Gerard J. Chang |
Profile minimization on compositions of graphs.  |
J. Comb. Optim.  |
2007 |
DBLP DOI BibTeX RDF |
Simplicial vertex, Composition, Profile, Cycle, Join, Interval graph, Chordal graph |
| 1 | Jun-Jie Pan, Gerard J. Chang |
Induced-path partition on graphs with special blocks.  |
Theor. Comput. Sci.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerard J. Chang, Sen-Peng Eu, Chung-Heng Yeh |
On the (n, t)-antipodal Gray codes.  |
Theor. Comput. Sci.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerard J. Chang, Changhong Lu, Sanming Zhou |
No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups.  |
Discrete Mathematics  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ching-Chi Lin, Gerard J. Chang, Gen-Huey Chen |
Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs.  |
Discrete Mathematics  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ruei-Yu Wu, Gen-Huey Chen, Yu-Liang Kuo, Gerard J. Chang |
Node-disjoint paths in hierarchical hypercube networks.  |
Inf. Sci.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Guey-Yun Chang, Gen-Huey Chen, Gerard J. Chang |
(t, k) - Diagnosis for Matching Composition Networks under the MM* Model.  |
IEEE Trans. Computers  |
2007 |
DBLP DOI BibTeX RDF |
matching composition network, MM* model, precise diagnosis strategy, (t,k){hbox{-}}rm diagnosis, multiprocessor system, Diagnosability |
| 1 | Gerard J. Chang, Jer-Jeong Chen, David Kuo, Sheng-Chyang Liaw |
Distance-two labelings of digraphs.  |
Discrete Applied Mathematics  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ruei-Yu Wu, Gen-Huey Chen, Jung-Sheng Fu, Gerard J. Chang |
Bipancyclicity of Hierarchical Hypercube Networks.  |
PDPTA  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Jun-Jie Pan, Gerard J. Chang |
Isometric path numbers of graphs.  |
Discrete Mathematics  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Yu-Ping Tsao, Gerard J. Chang |
Profile minimization on products of graphs.  |
Discrete Mathematics  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Min Zhao, Liying Kang, Gerard J. Chang |
Power domination in graphs.  |
Discrete Mathematics  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Guey-Yun Chang, Gen-Huey Chen, Gerard J. Chang |
(t, k)-Diagnosis for Matching Composition Networks.  |
IEEE Trans. Computers  |
2006 |
DBLP DOI BibTeX RDF |
matching composition network, precise diagnosis strategy, (t,k){hbox{-}}{rm diagnosis}, multiprocessor system, Diagnosability, PMC model, sequential diagnosis |
| 1 | Jun-Jie Pan, Gerard J. Chang |
Isometric-path numbers of block graphs.  |
Inf. Process. Lett.  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Guey-Yun Chang, Gerard J. Chang, Gen-Huey Chen |
Diagnosabilities of Regular Networks.  |
IEEE Trans. Parallel Distrib. Syst.  |
2005 |
DBLP DOI BibTeX RDF |
diagnosis by comparison, pessimistic diagnosis strategy, precise diagnosis strategy, hypercube, Diagnosis, multiprocessor system, PMC model |
| 1 | Jun-Jie Pan, Gerard J. Chang |
Path partition for graphs with special blocks.  |
Discrete Applied Mathematics  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerard Jennhwa Chang, Ton Kloks, Sheng-Lung Peng |
Probe interval bigraphs.  |
Electronic Notes in Discrete Mathematics  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerard Jennhwa Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng |
The PIGs Full Monty - A Floor Show of Minimal Separators.  |
STACS  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerard J. Chang, Chiuyuan Chen, Yaping Chen |
Vertex and Tree Arboricities of Graphs.  |
J. Comb. Optim.  |
2004 |
DBLP DOI BibTeX RDF |
arboricity, block-cactus graph, tree, planar graph, hamiltonian cycle, cograph, acyclic, series-parallel graph, girth |
| 1 | Yung-Ling Lai, Gerard J. Chang |
On the profile of the corona of two graphs.  |
Inf. Process. Lett.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Mingjang Chen, Gerard J. Chang, Douglas B. West |
Interval numbers of powers of block graph.  |
Discrete Mathematics  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerard J. Chang, Li-Da Tong, Hong-Tsu Wang |
Geodetic spectra of graphs.  |
Eur. J. Comb.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Ching-Chi Lin, Gerard J. Chang, Gen-Huey Chen |
Locally connected spanning trees on graphs  |
CoRR  |
2004 |
DBLP BibTeX RDF |
|
| 1 | Guey-Yun Chang, Gerard J. Chang, Gen-Huey Chen |
Diagnosabilities of regular networks  |
CoRR  |
2004 |
DBLP BibTeX RDF |
|
| 1 | Gerard J. Chang |
The weighted independent domination problem is NP-complete for chordal graphs.  |
Discrete Applied Mathematics  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Chung-Shou Liao, Gerard J. Chang |
k-tuple domination in graphs.  |
Inf. Process. Lett.  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Hong-Gwa Yeh, Gerard J. Chang |
Centers and medians of distance-hereditary graphs.  |
Discrete Mathematics  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerard J. Chang, Changhong Lu |
Distance-two labelings of graphs.  |
Eur. J. Comb.  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerard J. Chang, Sheng-Chyang Liaw |
The L(2, 1)-labeling problem on ditrees.  |
Ars Comb.  |
2003 |
DBLP BibTeX RDF |
|
| 1 | Gerard J. Chang |
Corrigendum to "The path-partition problem in block graphs".  |
Inf. Process. Lett.  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerard J. Chang, Li-Da Tong, Jing-Ho Yan, Hong-Gwa Yeh |
A note on the Gallai-Roy-Vitaver Theorem.  |
Discrete Mathematics  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Mingjang Chen, Gerard J. Chang |
Total interval numbers of complete r-partite graphs.  |
Discrete Applied Mathematics  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Maw-Shang Chang, Shaur-Ching Wu, Gerard J. Chang, Hong-Gwa Yeh |
Domination in distance-hereditary graphs.  |
Discrete Applied Mathematics  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerard J. Chang, Sheng-Chyang Liaw, Hong-Gwa Yeh |
k-Subdomination in graphs.  |
Discrete Applied Mathematics  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Min-Jen Jou, Gerard J. Chang |
Algorithmic aspects of counting independent sets.  |
Ars Comb.  |
2002 |
DBLP BibTeX RDF |
|
| 1 | Li-Da Tong, Frank K. Hwang, Gerard J. Chang |
Channel graphs of bit permutation networks.  |
Theor. Comput. Sci.  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Hong-Gwa Yeh, Gerard J. Chang |
Weighted connected k-domination and weighted k-dominating clique in distance-hereditary graphs.  |
Theor. Comput. Sci.  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerard J. Chang, Michel Deza, Yannis Manoussakis, Jean-Marc Steyaert |
Preface.  |
Theor. Comput. Sci.  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, C. Pandu Rangan, Maw-Shang Chang, Gerard J. Chang, C. K. Wong |
The Kr-Packing Problem.  |
Computing  |
2001 |
DBLP DOI BibTeX RDF |
AMS Subject Classifications: 05C70, 68Q20, 05C85 |
| 1 | Mingjang Chen, Gerard J. Chang |
Families of Graphs Closed Under Taking Powers.  |
Graphs and Combinatorics  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerard J. Chang, Justie Su-tzu Juan, Daphne Der-Fen Liu |
Minimum Span of No-Hole (r+1)-Distant Colorings.  |
SIAM J. Discrete Math.  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerard J. Chang, Justie Su-tzu Juan, Daphne Der-Fen Liu |
No-hole 2-distant colorings for unit interval graphs.  |
Ars Comb.  |
2001 |
DBLP BibTeX RDF |
|
| 1 | Gerard J. Chang, Wen-Tsai Ke, David Kuo, Daphne Der-Fen Liu, Roger K. Yeh |
On L(d, 1)-labelings of graphs.  |
Discrete Mathematics  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Lingling Huang, Gerard J. Chang |
Circular Chromatic Numbers of Distance Graphs with Distance Sets Missing Multiples.  |
Eur. J. Comb.  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerard J. Chang, Bor-Liang Chen, Hung-Lin Fu, Kuo-Ching Huang |
Linear k-arboricities on trees.  |
Discrete Applied Mathematics  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerard J. Chang, Xuding Zhu |
Pseudo-Hamiltonian-connected graphs.  |
Discrete Applied Mathematics  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerard J. Chang, Daphne Der-Fen Liu, Xuding Zhu |
Distance Graphs and T-Coloring.  |
J. Comb. Theory, Ser. B  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerard J. Chang, Lingling Huang, Xuding Zhu |
Circular chromatic numbers of Mycielski's graphs.  |
Discrete Mathematics  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerard J. Chang, Min-Jen Jou |
The number of maximal independent sets in connected triangle-free graphs.  |
Discrete Mathematics  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerard J. Chang, Bhaskar DasGupta, Wayne M. Dymàcek, Martin Fürer, Matthew Koerlin, Yueh-Shin Lee, Tom Whaley |
Characterizations of bipartite Steinhaus graphs.  |
Discrete Mathematics  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Sheng-Chyang Liaw, Gerard J. Chang |
Rabin numbers of Butterfly networks.  |
Discrete Mathematics  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerard J. Chang, Frank K. Hwang, Li-Da Tong |
Characterizing bit permutation networks.  |
Networks  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Shin-Jie Hu, Justie Su-tzu Juan, Gerard J. Chang |
T-Colorings and T-Edge Spans of Graphs.  |
Graphs and Combinatorics  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Sheng-Chyang Liaw, David Kuo, Gerard J. Chang |
Integral Sum Numbers of Graphs.  |
Ars Comb.  |
1999 |
DBLP BibTeX RDF |
|
| 1 | Sheng-Chyang Liaw, Gerard J. Chang |
Generalized Diameters and Rabin Numbers of Networks.  |
J. Comb. Optim.  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | 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.  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerard J. Chang, Frank K. Hwang, Y. C. Yao |
Localizing Combinatorial Properties for Partitions on Block Graphs.  |
J. Comb. Optim.  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank K. Hwang, Gerard J. Chang |
Enumerating Consecutive and Nested Partitions for Graphs.  |
Eur. J. Comb.  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerard J. Chang, Lingling Huang, Xuding Zhu |
Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs.  |
Eur. J. Comb.  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Shiow-Fen Hwang, Gerard J. Chang |
k-Neighborhood-Covering and -Independence Problems for Chordal Graphs.  |
SIAM J. Discrete Math.  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Hong-Gwa Yeh, Gerard J. Chang |
Weighted Connected Domination and Steiner Trees in Distance-hereditary Graphs.  |
Discrete Applied Mathematics  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, C. Pandu Rangan, Maw-Shang Chang, Gerard J. Chang, C. K. Wong |
The Vertex-Disjoint Triangles Problem.  |
WG  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Chiuyuan Chen, Chin-Chen Chang, Gerard J. Chang |
Proper interval graphs and the guard problem.  |
Discrete Mathematics  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | David Kuo, Gerard J. Chang, Y. H. Harris Kwong |
Cordial labeling of mKn.  |
Discrete Mathematics  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuh-Jiuan Tsay, Gerard J. Chang |
The exact gossiping problem.  |
Discrete Mathematics  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerard J. Chang, Frank K. Hwang |
Optimality of consecutive and nested tree partitions.  |
Networks  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerard J. Chang, Pei-Hsin Ho |
The ß-assignment problem in general graphs.  |
Computers & OR  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Jing-Ho Yan, Gerard J. Chang, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi |
k-Path Partitions in Trees.  |
Discrete Applied Mathematics  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Min-Jen Jou, Gerard J. Chang |
Maximal Independent Sets in Graphs with at Most One Cycle.  |
Discrete Applied Mathematics  |
1997 |
DBLP DOI BibTeX RDF |
|