Search the dblp DataBase
Sheng-Chyang Liaw: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- 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] - 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] - 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] - 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] - Sheng-Chyang Liaw, Zhishi Pan, Xuding Zhu
Construction of Kn-minor free graphs with given circular chromatic number. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2003, v:263, n:1-3, pp:191-206 [Journal] - 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] - Frank K. Hwang, Sheng-Chyang Liaw
On nonblocking multicast three-stage Clos networks. [Citation Graph (0, 0)][DBLP]
IEEE/ACM Trans. Netw., 2000, v:8, n:4, pp:535-539 [Journal] - 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]
Search in 0.002secs, Finished in 0.002secs
| 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 |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002