The SCEAS System
Navigation Menu

Search the dblp DataBase


David Kuo: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. Ma-Lian Chia, David Kuo, Mei-Feng Tung
    The multiple originator broadcasting problem in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:10, pp:1188-1199 [Journal]
  4. 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]
  5. Mei-Ju Chen, David Kuo, Jing-Ho Yan
    The bandwidth sum of join and composition of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:290, n:2/3, pp:145-163 [Journal]
  6. David Kuo, Jing-Ho Yan
    On L(2, 1)-labelings of Cartesian products of paths and cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:283, n:1-3, pp:137-144 [Journal]
  7. 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]
  8. 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]
  9. 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]

  10. A 2D Barcode Validation System for Mobile Commerce. [Citation Graph (, )][DBLP]

  11. The profile of the Cartesian product of graphs. [Citation Graph (, )][DBLP]

  12. L(p, q)-labeling of digraphs. [Citation Graph (, )][DBLP]

  13. Labeling graphs with two distance constraints. [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.003secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002