The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Gerard J. Chang: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Hong-Gwa Yeh, Gerard J. Chang
    Weighted Connected Domination and Steiner Trees in Distance-Hereditary Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics and Computer Science, 1995, pp:48-52 [Conf]
  2. Gerard J. Chang, C. Pandu Rangan, Satyan R. Coorg
    Weighted Independent Perfect Domination on Cocomparability Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:506-514 [Conf]
  3. Venkatesan Guruswami, C. Pandu Rangan, Maw-Shang Chang, Gerard J. Chang, C. K. Wong
    The Vertex-Disjoint Triangles Problem. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:26-37 [Conf]
  4. Gerard J. Chang, Su-tzu Juan, Daphne Der-Fen Liu
    No-hole 2-distant colorings for unit interval graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:61, n:, pp:- [Journal]
  5. Gerard J. Chang, Sheng-Chyang Liaw
    The L(2, 1)-labeling problem on ditrees. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:66, n:, pp:- [Journal]
  6. Min-Jen Jou, Gerard J. Chang
    Algorithmic aspects of counting independent sets. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2002, v:65, n:, pp:- [Journal]
  7. Sheng-Chyang Liaw, David Kuo, Gerard J. Chang
    Integral Sum Numbers of Graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1999, v:54, n:, pp:- [Journal]
  8. Venkatesan Guruswami, C. Pandu Rangan, Maw-Shang Chang, Gerard J. Chang, C. K. Wong
    The Kr-Packing Problem. [Citation Graph (0, 0)][DBLP]
    Computing, 2001, v:66, n:1, pp:79-89 [Journal]
  9. Gerard J. Chang, Pei-Hsin Ho
    The ß-assignment problem in general graphs. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1997, v:24, n:8, pp:757-765 [Journal]
  10. Ching-Chi Lin, Gerard J. Chang, Gen-Huey Chen
    Locally connected spanning trees on graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  11. Guey-Yun Chang, Gerard J. Chang, Gen-Huey Chen
    Diagnosabilities of regular networks [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  12. Gerard J. Chang
    The weighted independent domination problem is NP-complete for chordal graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:351-352 [Journal]
  13. Maw-Shang Chang, Yi-Hua Chen, Gerard J. Chang, Jing-Ho Yan
    Algorithmic Aspects of the Generalized Clique-transversal Problem on Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:66, n:3, pp:189-203 [Journal]
  14. Gerard J. Chang, Bor-Liang Chen, Hung-Lin Fu, Kuo-Ching Huang
    Linear k-arboricities on trees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:103, n:1-3, pp:281-287 [Journal]
  15. Gerard J. Chang, Sheng-Chyang Liaw, Hong-Gwa Yeh
    k-Subdomination in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:55-60 [Journal]
  16. Gerard J. Chang, C. Pandu Rangan, Satyan R. Coorg
    Weighted Independent Perfect Domination on Cocomparability Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:63, n:3, pp:215-222 [Journal]
  17. Maw-Shang Chang, Shaur-Ching Wu, Gerard J. Chang, Hong-Gwa Yeh
    Domination in distance-hereditary graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:116, n:1-2, pp:103-113 [Journal]
  18. Gerard J. Chang, Xuding Zhu
    Pseudo-Hamiltonian-connected graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:100, n:3, pp:145-153 [Journal]
  19. Mingjang Chen, Gerard J. Chang
    Total interval numbers of complete r-partite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:122, n:1-3, pp:83-92 [Journal]
  20. Min-Jen Jou, Gerard J. Chang
    Maximal Independent Sets in Graphs with at Most One Cycle. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:79, n:1-3, pp:67-73 [Journal]
  21. Hsun-Ming Lee, Gerard J. Chang
    Set to Set Broadcasting in Communication Networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1992, v:40, n:4, pp:411-421 [Journal]
  22. Jun-Jie Pan, Gerard J. Chang
    Path partition for graphs with special blocks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:145, n:3, pp:429-436 [Journal]
  23. Jing-Ho Yan, Jer-Jeong Chen, Gerard J. Chang
    Quasi-threshold Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:69, n:3, pp:247-255 [Journal]
  24. Jing-Ho Yan, Gerard J. Chang, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi
    k-Path Partitions in Trees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:78, n:1-3, pp:227-233 [Journal]
  25. Hong-Gwa Yeh, Gerard J. Chang
    Weighted Connected Domination and Steiner Trees in Distance-hereditary Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:87, n:1-3, pp:245-253 [Journal]
  26. Gerard J. Chang, Jer-Jeong Chen, David Kuo, Sheng-Chyang Liaw
    Distance-two labelings of digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:8, pp:1007-1013 [Journal]
  27. Gerard J. Chang, Wen-Tsai Ke, David Kuo, Daphne Der-Fen Liu, Roger K. Yeh
    On L(d, 1)-labelings of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:220, n:1-3, pp:57-66 [Journal]
  28. Gerard J. Chang, Li-Da Tong, Jing-Ho Yan, Hong-Gwa Yeh
    A note on the Gallai-Roy-Vitaver Theorem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:441-444 [Journal]
  29. Mingjang Chen, Gerard J. Chang, Douglas B. West
    Interval numbers of powers of block graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:275, n:1-3, pp:87-96 [Journal]
  30. Yu-Ping Tsao, Gerard J. Chang
    Profile minimization on products of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:8-9, pp:792-800 [Journal]
  31. Hong-Gwa Yeh, Gerard J. Chang
    Centers and medians of distance-hereditary graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:265, n:1-3, pp:279-310 [Journal]
  32. Min Zhao, Liying Kang, Gerard J. Chang
    Power domination in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:15, pp:1812-1816 [Journal]
  33. Jun-Jie Pan, Gerard J. Chang
    Isometric path numbers of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:17, pp:2091-2096 [Journal]
  34. Ching-Chi Lin, Gerard J. Chang, Gen-Huey Chen
    Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:2, pp:208-215 [Journal]
  35. Gerard J. Chang, Changhong Lu, Sanming Zhou
    No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:14, pp:1808-1817 [Journal]
  36. Gerard J. Chang, Lingling Huang, Xuding Zhu
    Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1998, v:19, n:4, pp:423-431 [Journal]
  37. Gerard J. Chang, Changhong Lu
    Distance-two labelings of graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2003, v:24, n:1, pp:53-58 [Journal]
  38. Gerard J. Chang, Li-Da Tong, Hong-Tsu Wang
    Geodetic spectra of graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2004, v:25, n:3, pp:383-391 [Journal]
  39. Lingling Huang, Gerard J. Chang
    Circular Chromatic Numbers of Distance Graphs with Distance Sets Missing Multiples. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2000, v:21, n:2, pp:241-248 [Journal]
  40. Frank K. Hwang, Gerard J. Chang
    Enumerating Consecutive and Nested Partitions for Graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1998, v:19, n:1, pp:63-70 [Journal]
  41. Mingjang Chen, Gerard J. Chang
    Families of Graphs Closed Under Taking Powers. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2001, v:17, n:2, pp:207-212 [Journal]
  42. Gerard J. Chang
    Corrigendum to "The path-partition problem in block graphs". [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:83, n:5, pp:293- [Journal]
  43. Yung-Ling Lai, Gerard J. Chang
    On the profile of the corona of two graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:89, n:6, pp:287-292 [Journal]
  44. Chung-Shou Liao, Gerard J. Chang
    k-tuple domination in graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:87, n:1, pp:45-50 [Journal]
  45. Jun-Jie Pan, Gerard J. Chang
    Isometric-path numbers of block graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:93, n:2, pp:99-102 [Journal]
  46. Jing-Ho Yan, Gerard J. Chang
    The Path-Partition Problem in Block Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:52, n:6, pp:317-322 [Journal]
  47. Gerard J. Chang, Chiuyuan Chen, Yaping Chen
    Vertex and Tree Arboricities of Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2004, v:8, n:3, pp:295-306 [Journal]
  48. 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. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1998, v:2, n:4, pp:413-427 [Journal]
  49. Gerard J. Chang, Frank K. Hwang, Y. C. Yao
    Localizing Combinatorial Properties for Partitions on Block Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1998, v:2, n:4, pp:429-441 [Journal]
  50. Sheng-Chyang Liaw, Gerard J. Chang
    Generalized Diameters and Rabin Numbers of Networks. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1998, v:2, n:4, pp:371-384 [Journal]
  51. Gerard J. Chang, Daphne Der-Fen Liu, Xuding Zhu
    Distance Graphs and T-Coloring. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1999, v:75, n:2, pp:259-269 [Journal]
  52. Feng-Chu Lai, Gerard J. Chang
    An upper bound for the transversal numbers of 4-uniform hypergraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1990, v:50, n:1, pp:129-133 [Journal]
  53. Gerard J. Chang, Frank K. Hwang
    Optimality of consecutive and nested tree partitions. [Citation Graph (0, 0)][DBLP]
    Networks, 1997, v:30, n:2, pp:75-80 [Journal]
  54. Gerard J. Chang, Frank K. Hwang, Li-Da Tong
    Characterizing bit permutation networks. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:33, n:4, pp:261-267 [Journal]
  55. David Kuo, Gerard J. Chang
    The Profile Minimization Problem in Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:1, pp:71-81 [Journal]
  56. Gerard J. Chang, Justie Su-tzu Juan, Daphne Der-Fen Liu
    Minimum Span of No-Hole (r+1)-Distant Colorings. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2001, v:14, n:3, pp:370-380 [Journal]
  57. Gerard J. Chang, David Kuo
    The L(2, 1)-Labeling Problem on Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1996, v:9, n:2, pp:309-316 [Journal]
  58. Shiow-Fen Hwang, Gerard J. Chang
    k-Neighborhood-Covering and -Independence Problems for Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1998, v:11, n:4, pp:633-643 [Journal]
  59. Tung-Lin Lu, Pei-Hsin Ho, Gerard J. Chang
    The Domatic Number Problem in Interval Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1990, v:3, n:4, pp:531-536 [Journal]
  60. Guey-Yun Chang, Gen-Huey Chen, Gerard J. Chang
    (t, k)-Diagnosis for Matching Composition Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2006, v:55, n:1, pp:88-92 [Journal]
  61. Guey-Yun Chang, Gen-Huey Chen, Gerard J. Chang
    (t, k) - Diagnosis for Matching Composition Networks under the MM* Model. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2007, v:56, n:1, pp:73-79 [Journal]
  62. Gerard J. Chang, Michel Deza, Yannis Manoussakis, Jean-Marc Steyaert
    Preface. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:263, n:1-2, pp:1- [Journal]
  63. Li-Da Tong, Frank K. Hwang, Gerard J. Chang
    Channel graphs of bit permutation networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:263, n:1-2, pp:139-143 [Journal]
  64. Hong-Gwa Yeh, Gerard J. Chang
    Weighted connected k-domination and weighted k-dominating clique in distance-hereditary graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:263, n:1-2, pp:3-8 [Journal]
  65. Jun-Jie Pan, Gerard J. Chang
    Induced-path partition on graphs with special blocks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:370, n:1-3, pp:121-130 [Journal]
  66. Gerard J. Chang, Sen-Peng Eu, Chung-Heng Yeh
    On the (n, t)-antipodal Gray codes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:374, n:1-3, pp:82-90 [Journal]
  67. Guey-Yun Chang, Gerard J. Chang, Gen-Huey Chen
    Diagnosabilities of Regular Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2005, v:16, n:4, pp:314-323 [Journal]
  68. Gerard J. Chang, Lingling Huang, Xuding Zhu
    Circular chromatic numbers of Mycielski's graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:205, n:1-3, pp:23-37 [Journal]
  69. Sheng-Chyang Liaw, Gerard J. Chang
    Rabin numbers of Butterfly networks. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:196, n:1-3, pp:219-227 [Journal]
  70. Gerard J. Chang, Min-Jen Jou
    The number of maximal independent sets in connected triangle-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:169-178 [Journal]
  71. Gerard J. Chang, Bhaskar DasGupta, Wayne M. Dymàcek, Martin Fürer, Matthew Koerlin, Yueh-Shin Lee, Tom Whaley
    Characterizations of bipartite Steinhaus graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:199, n:1-3, pp:11-25 [Journal]
  72. Yuh-Jiuan Tsay, Gerard J. Chang
    The exact gossiping problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:163, n:1-3, pp:165-172 [Journal]
  73. David Kuo, Gerard J. Chang, Y. H. Harris Kwong
    Cordial labeling of mKn. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:169, n:1-3, pp:121-131 [Journal]
  74. Chiuyuan Chen, Chin-Chen Chang, Gerard J. Chang
    Proper interval graphs and the guard problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:170, n:1-3, pp:223-230 [Journal]
  75. Gerard J. Chang, Yuh-Jiuan Tsay
    The partial gossiping problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:148, n:1-3, pp:9-14 [Journal]
  76. Ruei-Yu Wu, Gen-Huey Chen, Yu-Liang Kuo, Gerard J. Chang
    Node-disjoint paths in hierarchical hypercube networks. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 2007, v:177, n:19, pp:4200-4207 [Journal]
  77. Jer-Jeong Chen, Gerard J. Chang
    Distance graphs on R n with 1-norm. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2007, v:14, n:2-3, pp:267-274 [Journal]
  78. Gerard J. Chang, Hung-Lin Fu, Xuding Zhu
    Editorial note. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2007, v:14, n:2-3, pp:111-112 [Journal]
  79. Justie Su-tzu Juan, Gerard J. Chang
    Group testing in graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2007, v:14, n:2-3, pp:113-119 [Journal]
  80. Yu-Ping Tsao, Gerard J. Chang
    Profile minimization on compositions of graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2007, v:14, n:2-3, pp:177-190 [Journal]

  81. Bipancyclicity of Hierarchical Hypercube Networks. [Citation Graph (, )][DBLP]


  82. Labeling algorithms for domination problems in sun-free chordal graphs. [Citation Graph (, )][DBLP]


  83. Note on the m-step competition numbers of paths and cycles. [Citation Graph (, )][DBLP]


  84. The competition number of a graph with exactly h holes, all of which are independent. [Citation Graph (, )][DBLP]


  85. Distance-two labellings of Hamming graphs. [Citation Graph (, )][DBLP]


  86. Rainbow domination on trees. [Citation Graph (, )][DBLP]


  87. Equitable colorings of Kronecker products of graphs. [Citation Graph (, )][DBLP]


  88. Adaptive group testing for consecutive positives. [Citation Graph (, )][DBLP]


  89. Clique coverings and partitions of line graphs. [Citation Graph (, )][DBLP]


  90. Independent arcs of acyclic orientations of complete r-partite graphs. [Citation Graph (, )][DBLP]


  91. L(h, k)-labelings of Hamming graphs. [Citation Graph (, )][DBLP]


  92. The upper bound on k-tuple domination numbers of graphs. [Citation Graph (, )][DBLP]


  93. A note on equitable colorings of forests. [Citation Graph (, )][DBLP]


Search in 0.038secs, Finished in 0.042secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002