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