| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Qian-Ping Gu, Hisao Tamaki |
Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in O(n1+ϵ) time.  |
Theor. Comput. Sci.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Chunhao Wang, Qian-Ping Gu |
Computational Study on Bidimensionality Theory Based Algorithm for Longest Path Problem. |
ISAAC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhengbing Bian, Qian-Ping Gu |
Wavelength assignment in multifiber star networks. |
Networks |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Marjan Marzban, Qian-Ping Gu, Xiaohua Jia |
Computational Study for Planar Connected Dominating Set Problem. |
COCOA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Qian-Ping Gu, Hisao Tamaki |
Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size. |
ISAAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhengbing Bian, Qian-Ping Gu |
1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Marjan Marzban, Qian-Ping Gu, Xiaohua Jia |
Computational study on planar dominating set problem. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yong Wang, Qian-Ping Gu |
Minimizing SONET Add-Drop Multiplexers in optical UPSR networks using the minimum number of wavelengths. |
Networks |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhengbing Bian, Qian-Ping Gu, Xiao Zhou |
Efficient algorithms for wavelength assignment on trees of rings. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Qian-Ping Gu, Hisao Tamaki |
Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n1 + ε) Time. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
Graph algorithms, graph minors, branch-decompositions |
| 1 | Yong Wang, Qian-Ping Gu |
On the complexity and algorithm of grooming regular traffic in WDM optical networks. |
J. Parallel Distrib. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Qian-Ping Gu, Hisao Tamaki |
Optimal branch-decomposition of planar graphs in O(n3) Time. |
ACM Transactions on Algorithms |
2008 |
DBLP DOI BibTeX RDF |
planar graphs, Branch-decompositions |
| 1 | Zhengbing Bian, Qian-Ping Gu, Marjan Marzban, Hisao Tamaki, Yumi Yoshitake |
Empirical Study on Branchwidth and Branch Decomposition of Planar Graphs. |
ALENEX |
2008 |
DBLP BibTeX RDF |
|
| 1 | Zhengbing Bian, Qian-Ping Gu |
Computing Branch Decomposition of Large Planar Graphs. |
WEA |
2008 |
DBLP DOI BibTeX RDF |
computational study, Graph algorithms, planar graphs, algorithm engineering, branch-decomposition |
| 1 | Marjan Marzban, Qian-Ping Gu, Xiaohua Jia |
Computational Study on Dominating Set Problem of Planar Graphs. |
COCOA |
2008 |
DBLP DOI BibTeX RDF |
PLANAR DOMINATING SET, computational study, data reduction, fixed-parameter algorithms, branch-decomposition |
| 1 | Yong Wang, Qian-Ping Gu |
A Min-Max Optimization Problem on Traffic Grooming in WDM Optical Networks. |
ICCCN |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhengbing Bian, Qian-Ping Gu |
Wavelength Assignment in Multifiber WDM Star and Spider Networks. |
ICC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Yong Wang, Qian-Ping Gu |
Maximizing Throughput for Traffic Grooming with Limited Grooming Resources. |
GLOBECOM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Qian-Ping Gu, Yong Wang |
Efficient Algorithms for Minimum Congestion Hypergraph Embedding in a Cycle. |
IEEE Trans. Parallel Distrib. Syst. |
2006 |
DBLP DOI BibTeX RDF |
Hypergraph embedding, communication on rings, edge congestion minimization, approximation algorithms |
| 1 | Yong Wang, Qian-Ping Gu |
Efficient Algorithms for Traffic Grooming in SONET/WDM Networks. |
ICPP |
2006 |
DBLP DOI BibTeX RDF |
SONET/WDM networks, unidirectional rings, NPcomplete, graph decomposition, Traffic grooming, regular graph |
| 1 | Uwe Glässer, Qian-Ping Gu |
Formal description and analysis of a distributed location service for mobile ad hoc networks. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Qian-Ping Gu, Hisao Tamaki |
Optimal Branch-Decomposition of Planar Graphs in O(n3) Time. |
ICALP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhengbing Bian, Qian-Ping Gu, Xiao Zhou |
Tight Bounds for Wavelength Assignment on Trees of Rings. |
IPDPS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhengbing Bian, Qian-Ping Gu, Xiao Zhou |
Wavelength Assignment on Bounded Degree Trees of Rings. |
ICPADS |
2004 |
DBLP DOI BibTeX RDF |
trees of rings, approximation algorithms, Wavelength assignment, path coloring |
| 1 | Qian-Ping Gu, Shietung Peng |
Multihop All-to-All Broadcast on WDM Optical Networks. |
IEEE Trans. Parallel Distrib. Syst. |
2003 |
DBLP DOI BibTeX RDF |
torus, rings, All-to-all communication, WDM optical networks |
| 1 | Qian-Ping Gu, Yong Wang |
Efficient Algorithm for Embedding Hypergraphs in a Cycle. |
HiPC |
2003 |
DBLP DOI BibTeX RDF |
Hypergraph embedding in a cycle, communication on rings, link congestion minimization, approximation algorithms |
| 1 | Xinchen Liu, Qian-Ping Gu |
Multicasts on WDM All-Optical Butterfly Networks. |
J. Inf. Sci. Eng. |
2002 |
DBLP BibTeX RDF |
|
| 1 | Qian-Ping Gu |
On-line Permutation Routing on WDM All-Optical Networks. (PDF / PS) |
ICPP |
2002 |
DBLP DOI BibTeX RDF |
On-line routing algorithm, WDM all-optical networks, hypercube, competitive analysis, permutation routing |
| 1 | Xinchen Liu, Qian-Ping Gu |
Multicasts on WDM All-Optical Multistage Interconnection Networks. |
ICPADS |
2001 |
DBLP BibTeX RDF |
|
| 1 | Qian-Ping Gu, Shietung Peng |
Multi-hop All-to-All Broadcast on WDM Optical Networks. |
ICPP Workshops |
2001 |
DBLP DOI BibTeX RDF |
torus, All-to-all communication, WDM optical networks |
| 1 | Qian-Ping Gu, Shietung Peng |
Cluster fault-tolerant routing in star graphs. |
Networks |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Qian-Ping Gu, Shietung Peng |
An Efficient Algorithm for the k-Pairwise Disjoint Paths Problem in Hypercubes. |
J. Parallel Distrib. Comput. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Qian-Ping Gu, Hisao Tamaki |
Multicolor routing in the undirected hypercube. |
Discrete Applied Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Qian-Ping Gu, Shietung Peng |
Wavelengths Requirement for Permutation Routing in All-Optical Multistage Interconnection Networks. (PDF / PS) |
IPDPS |
2000 |
DBLP DOI BibTeX RDF |
multistage interconnection networks, Permutation routing, all-optical networks, node-disjoint paths, wavelength routing, BPC permutations |
| 1 | Qian-Ping Gu, Shietung Peng |
Efficient Protocols for Permutation Routing on All-Optical Multistage Interconnection Networks. (PDF / PS) |
ICPP |
2000 |
DBLP DOI BibTeX RDF |
WDM all-optical networks, routing algorithms, multistage interconnection networks, Permutation routing, edge-disjoint paths, BPC permutations |
| 1 | Qian-Ping Gu, Shietung Peng, Ivan Hal Sudborough |
A 2-Approximation Algorithm for Genome Rearrangements by Reversals and Transpositions. |
Theor. Comput. Sci. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Qian-Ping Gu, Shietung Peng |
Unicast in Hypercubes with Large Number of Faulty Nodes. |
IEEE Trans. Parallel Distrib. Syst. |
1999 |
DBLP DOI BibTeX RDF |
off-line routing algorithm, Fault tolerance, interconnection network, hypercubes, unicast |
| 1 | Jun Gu, Qian-Ping Gu, Ding-Zhu Du |
On optimizing the satisfiability (SAT) problem. |
J. Comput. Sci. Technol. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Qian-Ping Gu, Shietung Peng |
An Efficient Algorithm for k-Pairwise Disjoint Paths in Star Graphs. |
Inf. Process. Lett. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Qian-Ping Gu, Shietung Peng |
Node-to-Set and Set-to-Set Cluster Fault Tolerant Routing in Hypercubes. |
Parallel Computing |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Qian-Ping Gu, Shietung Peng |
Routing in Hypercubes with Large Number of Faulty Nodes. (PDF / PS) |
ICPADS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Qian-Ping Gu, Shietung Peng |
Cluster Fault Tolerant Routing in Hypercubes. (PDF / PS) |
ICPP |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Qian-Ping Gu, Shietung Peng |
Node-To-Set Disjoint Paths Problem in Star Graphs. |
Inf. Process. Lett. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Qian-Ping Gu, Shietung Peng |
k-Pairwise Cluster Fault Tolerant Routing in Hypercubes. |
IEEE Trans. Computers |
1997 |
DBLP DOI BibTeX RDF |
node fault tolerant routing, algorithms, Interconnection networks, node-disjoint paths |
| 1 | Qian-Ping Gu, Hisao Tamaki |
Routing a Permutation in the Hypercube by Two Sets of Edge Disjoint Paths. |
J. Parallel Distrib. Comput. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Zixue Cheng, Qian-Ping Gu |
A Distributed Algorithm for Leader Election from a Partially Ordered Set on a Coterie. |
PDPTA |
1997 |
DBLP BibTeX RDF |
|
| 1 | Qian-Ping Gu, Shietung Peng |
Node-to-Node Cluster Fault Tolerant Routing in Hypercubes. |
ISPAN |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Qian-Ping Gu, Hisao Tamaki |
Multi-Color Routing in the Undirected Hypercube. |
ISAAC |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Jun Gu, Qian-Ping Gu, Ding-Zhu Du |
Convergence Properties of Optimization Algorithms for the SAT Problem. |
IEEE Trans. Computers |
1996 |
DBLP DOI BibTeX RDF |
satisfiability (SAT) problem, convergence ratio, time complexity, optimization algorithm, nonlinear programming, Conjunctive normal form (CNF) |
| 1 | Qian-Ping Gu, Shietung Peng |
Fault Tolerant Routing in Hypercubes and Star Graphs. |
Parallel Processing Letters |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Qian-Ping Gu, Shietung Peng |
Optimal Algorithms for Node-to-Node Fault Tolerant Routing in Hypercubes. |
Comput. J. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Qian-Ping Gu, Shietung Peng |
An Efficient Algorithm for Node-to-Node Routing in Hypercubes with Faulty Clusters. |
Comput. J. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Qian-Ping Gu, Hisao Tamaki |
Routing a Permutation in the Hypercube by Two Sets of Edge-Disjoint Paths. (PDF / PS) |
IPPS |
1996 |
DBLP DOI BibTeX RDF |
algorithm, Permutation routing, edge-disjoint paths, circuit-switched networks |
| 1 | Qian-Ping Gu, Shietung Peng |
An efficient algorithm for set-to-set node-disjoint paths problem in hypercubes. (PDF / PS) |
ICPADS |
1996 |
DBLP DOI BibTeX RDF |
set-to-set node-disjoint paths, interconnection networks, graph theory, hypercubes, Graph algorithms, hypercube networks, undirect graphs, node-disjoint paths |
| 1 | Qian-Ping Gu, Shietung Peng |
Node-to-Node Cluster Fault Tolerant Routing in Star Graphs. |
Inf. Process. Lett. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Qian-Ping Gu, Shietung Peng |
Linear Time Algorithms for Fault Tolerant Routing in Hypercubes and Star Graphs. |
IEICE Transactions |
1995 |
DBLP BibTeX RDF |
|
| 1 | Qian-Ping Gu, Jun Gu |
Two Packet Routing Algorithms on a Mesh-Connected Computer. |
IEEE Trans. Parallel Distrib. Syst. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Qian-Ping Gu, Shietung Peng |
Finding a Routing Path of Optimal Length in Hypercubes with Fault Clusters. |
Parallel and Distributed Computing and Systems |
1995 |
DBLP BibTeX RDF |
|
| 1 | Qian-Ping Gu, Jun Gu |
Algorithms and Average Time Bounds of Sorting on a Mesh-Connected Computer. |
IEEE Trans. Parallel Distrib. Syst. |
1994 |
DBLP DOI BibTeX RDF |
average time bounds, mesh-connectedcomputer, wraparound connections, distancebound, indexing schemes, average time complexity, parallel algorithms, parallel algorithms, computational complexity, multiprocessor interconnection networks, sorting, sorting, communication complexity, queue size, parallel sorting algorithms |
| 1 | Qian-Ping Gu, Shietung Peng |
Algorithms for Node Disjoint Paths in Incomplete Star Networks. |
ICPADS |
1994 |
DBLP BibTeX RDF |
|
| 1 | Jun Gu, Qian-Ping Gu |
Average Time Complexity of the SAT 1.2 Algorithm. |
ISAAC |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Qian-Ping Gu, Shietung Peng |
k-Pairwise Cluster Fault Tolerant Routing in Hypercubes. |
ISAAC |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Qian-Ping Gu, Akira Maruoka |
Learning Monotone Boolean Functions by Uniformly Distributed Examples. |
SIAM J. Comput. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Qian-Ping Gu, Akira Maruoka |
Amplification of Bounded Depth Monotone Read-Once Boolean Formulae. |
SIAM J. Comput. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Qian-Ping Gu, Tadao Takaoka |
A sharper analysis of a parallel algorithm for the all pairs shortest path problem. |
Parallel Computing |
1990 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")