The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Qian-Ping Gu: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Qian-Ping Gu, Yong Wang
    Efficient Algorithm for Embedding Hypergraphs in a Cycle. [Citation Graph (0, 0)][DBLP]
    HiPC, 2003, pp:85-94 [Conf]
  2. Qian-Ping Gu, Hisao Tamaki
    Optimal Branch-Decomposition of Planar Graphs in O(n3) Time. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:373-384 [Conf]
  3. Zhengbing Bian, Qian-Ping Gu, Xiao Zhou
    Wavelength Assignment on Bounded Degree Trees of Rings. [Citation Graph (0, 0)][DBLP]
    ICPADS, 2004, pp:73-80 [Conf]
  4. Qian-Ping Gu, Shietung Peng
    Algorithms for Node Disjoint Paths in Incomplete Star Networks. [Citation Graph (0, 0)][DBLP]
    ICPADS, 1994, pp:296-303 [Conf]
  5. Qian-Ping Gu, Shietung Peng
    An efficient algorithm for set-to-set node-disjoint paths problem in hypercubes. [Citation Graph (0, 0)][DBLP]
    ICPADS, 1996, pp:98-105 [Conf]
  6. Qian-Ping Gu, Shietung Peng
    Routing in Hypercubes with Large Number of Faulty Nodes. [Citation Graph (0, 0)][DBLP]
    ICPADS, 1998, pp:718-0 [Conf]
  7. Xinchen Liu, Qian-Ping Gu
    Multicasts on WDM All-Optical Multistage Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    ICPADS, 2001, pp:601-608 [Conf]
  8. Qian-Ping Gu
    On-line Permutation Routing on WDM All-Optical Networks. [Citation Graph (0, 0)][DBLP]
    ICPP, 2002, pp:419-0 [Conf]
  9. Qian-Ping Gu, Shietung Peng
    Efficient Protocols for Permutation Routing on All-Optical Multistage Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    ICPP, 2000, pp:513-520 [Conf]
  10. Qian-Ping Gu, Shietung Peng
    Cluster Fault Tolerant Routing in Hypercubes. [Citation Graph (0, 0)][DBLP]
    ICPP, 1998, pp:148-155 [Conf]
  11. Yong Wang, Qian-Ping Gu
    Efficient Algorithms for Traffic Grooming in SONET/WDM Networks. [Citation Graph (0, 0)][DBLP]
    ICPP, 2006, pp:355-364 [Conf]
  12. Qian-Ping Gu, Shietung Peng
    Multi-hop All-to-All Broadcast on WDM Optical Networks. [Citation Graph (0, 0)][DBLP]
    ICPP Workshops, 2001, pp:291-296 [Conf]
  13. Zhengbing Bian, Qian-Ping Gu, Xiao Zhou
    Tight Bounds for Wavelength Assignment on Trees of Rings. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2005, pp:- [Conf]
  14. Qian-Ping Gu, Shietung Peng
    Wavelengths Requirement for Permutation Routing in All-Optical Multistage Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2000, pp:761-768 [Conf]
  15. Qian-Ping Gu, Hisao Tamaki
    Routing a Permutation in the Hypercube by Two Sets of Edge-Disjoint Paths. [Citation Graph (0, 0)][DBLP]
    IPPS, 1996, pp:561-567 [Conf]
  16. Jun Gu, Qian-Ping Gu
    Average Time Complexity of the SAT 1.2 Algorithm. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:146-154 [Conf]
  17. Qian-Ping Gu, Shietung Peng
    k-Pairwise Cluster Fault Tolerant Routing in Hypercubes. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:342-350 [Conf]
  18. Qian-Ping Gu, Hisao Tamaki
    Multi-Color Routing in the Undirected Hypercube. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1997, pp:72-81 [Conf]
  19. Qian-Ping Gu, Shietung Peng
    Node-to-Node Cluster Fault Tolerant Routing in Hypercubes. [Citation Graph (0, 0)][DBLP]
    ISPAN, 1997, pp:404-409 [Conf]
  20. Qian-Ping Gu, Shietung Peng
    Finding a Routing Path of Optimal Length in Hypercubes with Fault Clusters. [Citation Graph (0, 0)][DBLP]
    Parallel and Distributed Computing and Systems, 1995, pp:229-233 [Conf]
  21. Zixue Cheng, Qian-Ping Gu
    A Distributed Algorithm for Leader Election from a Partially Ordered Set on a Coterie. [Citation Graph (0, 0)][DBLP]
    PDPTA, 1997, pp:825-847 [Conf]
  22. Qian-Ping Gu, Shietung Peng
    Optimal Algorithms for Node-to-Node Fault Tolerant Routing in Hypercubes. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1996, v:39, n:7, pp:626-629 [Journal]
  23. Qian-Ping Gu, Shietung Peng
    An Efficient Algorithm for Node-to-Node Routing in Hypercubes with Faulty Clusters. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1996, v:39, n:1, pp:14-19 [Journal]
  24. Qian-Ping Gu, Hisao Tamaki
    Multicolor routing in the undirected hypercube. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:100, n:3, pp:169-181 [Journal]
  25. Qian-Ping Gu, Shietung Peng
    Node-to-Node Cluster Fault Tolerant Routing in Star Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:56, n:1, pp:29-35 [Journal]
  26. Qian-Ping Gu, Shietung Peng
    Node-To-Set Disjoint Paths Problem in Star Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:62, n:4, pp:201-207 [Journal]
  27. Qian-Ping Gu, Shietung Peng
    An Efficient Algorithm for k-Pairwise Disjoint Paths in Star Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:67, n:6, pp:283-287 [Journal]
  28. Xinchen Liu, Qian-Ping Gu
    Multicasts on WDM All-Optical Butterfly Networks. [Citation Graph (0, 0)][DBLP]
    J. Inf. Sci. Eng., 2002, v:18, n:6, pp:1049-1058 [Journal]
  29. Qian-Ping Gu, Shietung Peng
    An Efficient Algorithm for the k-Pairwise Disjoint Paths Problem in Hypercubes. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2000, v:60, n:6, pp:764-774 [Journal]
  30. Qian-Ping Gu, Hisao Tamaki
    Routing a Permutation in the Hypercube by Two Sets of Edge Disjoint Paths. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1997, v:44, n:2, pp:147-152 [Journal]
  31. Qian-Ping Gu, Shietung Peng
    Cluster fault-tolerant routing in star graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 2000, v:35, n:1, pp:83-90 [Journal]
  32. Qian-Ping Gu, Shietung Peng
    Node-to-Set and Set-to-Set Cluster Fault Tolerant Routing in Hypercubes. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1998, v:24, n:8, pp:1245-1261 [Journal]
  33. Qian-Ping Gu, Tadao Takaoka
    A sharper analysis of a parallel algorithm for the all pairs shortest path problem. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1990, v:16, n:1, pp:61-67 [Journal]
  34. Qian-Ping Gu, Akira Maruoka
    Amplification of Bounded Depth Monotone Read-Once Boolean Formulae. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:1, pp:41-55 [Journal]
  35. Qian-Ping Gu, Akira Maruoka
    Learning Monotone Boolean Functions by Uniformly Distributed Examples. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:3, pp:587-599 [Journal]
  36. Qian-Ping Gu, Shietung Peng
    k-Pairwise Cluster Fault Tolerant Routing in Hypercubes. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1997, v:46, n:9, pp:1042-1049 [Journal]
  37. Jun Gu, Qian-Ping Gu, Ding-Zhu Du
    Convergence Properties of Optimization Algorithms for the SAT Problem. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1996, v:45, n:2, pp:209-219 [Journal]
  38. Uwe Glässer, Qian-Ping Gu
    Formal description and analysis of a distributed location service for mobile ad hoc networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:336, n:2-3, pp:285-309 [Journal]
  39. Qian-Ping Gu, Shietung Peng, Ivan Hal Sudborough
    A 2-Approximation Algorithm for Genome Rearrangements by Reversals and Transpositions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:210, n:2, pp:327-339 [Journal]
  40. Qian-Ping Gu, Jun Gu
    Algorithms and Average Time Bounds of Sorting on a Mesh-Connected Computer. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1994, v:5, n:3, pp:308-315 [Journal]
  41. Qian-Ping Gu, Jun Gu
    Two Packet Routing Algorithms on a Mesh-Connected Computer. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1995, v:6, n:4, pp:436-440 [Journal]
  42. Qian-Ping Gu, Shietung Peng
    Multihop All-to-All Broadcast on WDM Optical Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2003, v:14, n:5, pp:477-486 [Journal]
  43. Qian-Ping Gu, Shietung Peng
    Unicast in Hypercubes with Large Number of Faulty Nodes. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1999, v:10, n:10, pp:964-975 [Journal]
  44. Qian-Ping Gu, Yong Wang
    Efficient Algorithms for Minimum Congestion Hypergraph Embedding in a Cycle. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2006, v:17, n:3, pp:205-214 [Journal]

  45. Empirical Study on Branchwidth and Branch Decomposition of Planar Graphs. [Citation Graph (, )][DBLP]


  46. Wavelength Assignment in Multifiber WDM Star and Spider Networks. [Citation Graph (, )][DBLP]


  47. A Min-Max Optimization Problem on Traffic Grooming in WDM Optical Networks. [Citation Graph (, )][DBLP]


  48. Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n1 + epsilon) Time. [Citation Graph (, )][DBLP]


  49. Computing Branch Decomposition of Large Planar Graphs. [Citation Graph (, )][DBLP]


  50. Computational Study on Dominating Set Problem of Planar Graphs. [Citation Graph (, )][DBLP]


  51. Maximizing Throughput for Traffic Grooming with Limited Grooming Resources. [Citation Graph (, )][DBLP]


  52. Efficient algorithms for wavelength assignment on trees of rings. [Citation Graph (, )][DBLP]


Search in 0.038secs, Finished in 0.040secs
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