The SCEAS System
Navigation Menu

Search the dblp DataBase


Qiao Li: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Yonghong Chen, Qiao Li
    They are Just Butterflies. [Citation Graph (0, 0)][DBLP]
    COCOON, 1997, pp:512-513 [Conf]
  2. Qiao Li, Sung-Mo Kang
    Technology independent arbitrary device extractor. [Citation Graph (0, 0)][DBLP]
    ACM Great Lakes Symposium on VLSI, 2000, pp:143-146 [Conf]
  3. Qiao Li, Sung-Mo Kang
    Efficient algorithms for polygon to trapezoid decomposition and trapezoid corner stitching. [Citation Graph (0, 0)][DBLP]
    ACM Great Lakes Symposium on VLSI, 2000, pp:183-188 [Conf]
  4. Lihua Feng, Qiao Li, Xiao-Dong Zhang
    Spectral radii of graphs with given chromatic number. [Citation Graph (0, 0)][DBLP]
    Appl. Math. Lett., 2007, v:20, n:2, pp:158-162 [Journal]
  5. Wenlong Su, Qiao Li, Haipeng Luo, Guiqing Li
    Lower bounds of Ramsey numbers based on cubic residues. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:250, n:1-3, pp:197-209 [Journal]
  6. Ming Wang, Qiao Li
    Conditional edge connectivity properties, reliability comparisons and transitivity of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:258, n:1-3, pp:205-214 [Journal]
  7. Qiaoliang Li, Qiao Li
    Super edge connectivity properties of connected edge symmetric graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:33, n:2, pp:157-159 [Journal]
  8. Qiao Li, Dominique Sotteau, Junming Xu
    2-diameter of de Bruijn graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 1996, v:28, n:1, pp:7-14 [Journal]
  9. Qiaoliang Li, Qiao Li
    Reliability analysis of circulant graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 1998, v:31, n:2, pp:61-65 [Journal]
  10. Xuewen Bao, Frank K. Hwang, Qiao Li
    Rearrangeability of bit permutation networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:352, n:1-3, pp:197-214 [Journal]
  11. Qiao Li, Jiayu Shao
    The index set problem for Boolean (or nonnegative) matrices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:123, n:1-3, pp:75-92 [Journal]

  12. A Hybrid Method of Multidimensional Scaling and Clustering for Determining Genetic Influence on Phenotypes. [Citation Graph (, )][DBLP]

  13. A Polynomial-Time Approximation Algorithm for Weighted Sum-Rate Maximization in UWB Networks. [Citation Graph (, )][DBLP]

  14. Maximal Scheduling in a Hypergraph Model for Wireless Networks. [Citation Graph (, )][DBLP]

  15. Energy Efficient Routing in Ad Hoc Networks with Nakagami-m Fading Channels. [Citation Graph (, )][DBLP]

  16. Speech Synthesis for Error Training Models in CALL. [Citation Graph (, )][DBLP]

  17. Research on innovation capability of high-tech industry clusters in Hebei Province based on data envelopment analysis. [Citation Graph (, )][DBLP]

  18. Improved methods for detecting main components of heart sounds. [Citation Graph (, )][DBLP]

  19. RBF neural networks analysis on electrical signal in Chrysanthemum coronarium. [Citation Graph (, )][DBLP]

  20. Scheduling in Multi-Hop Wireless Networks with Priorities. [Citation Graph (, )][DBLP]

  21. A Graph-Based Algorithm for Scheduling with Sum-Interference in Wireless Networks. [Citation Graph (, )][DBLP]

  22. Prioritized Maximal Scheduling in Wireless Networks. [Citation Graph (, )][DBLP]

  23. Scheduling in Multi-hop Wireless Networks with Priorities [Citation Graph (, )][DBLP]

  24. Optimal Scheduling in Wireless Networks: Towards a General Framework [Citation Graph (, )][DBLP]

  25. Greedy Maximal Scheduling in Wireless Networks [Citation Graph (, )][DBLP]

Search in 0.003secs, Finished in 0.004secs
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