default search action
Ke Qiu 0001
Person information
- affiliation: Brock University, St. Catharines, ON, Canada
- affiliation (PhD): Queen's University, Kingston, ON, Canada
Other persons with the same name
- Ke Qiu — disambiguation page
- Ke Qiu 0002 — Acadia University, Wolfville, NS, Canada (and 1 more)
- Ke Qiu 0003 — Peking University, Shenzhen Graduate School, School of Electronic and Computer Engineering, China
- Ke Qiu 0004 — Worcester Polytechnic Institute, Worcester, MA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j62]Ethan Gibbons, Ke Qiu
:
A recurrence for the surface area of the ( n , k ) $$ \left(n,k\right) $$ -star graph. Concurr. Comput. Pract. Exp. 36(12) (2024) - 2023
- [j61]Eddie Cheng, László Lipták, Ke Qiu, Zhizhang Shen
On the g-extra connectivity of augmented cubes. Theor. Comput. Sci. 970: 114059 (2023) - [c33]Eddie Cheng, Ethan Gibbons, Ke Qiu, Zhizhang Shen:
Forward Difference Properties of the (n, k)-Star Graph and Some Other Interconnection Networks. ICPADS 2023: 138-145 - 2022
- [j60]Wei Ding
A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs. J. Comb. Optim. 44(2): 905-920 (2022) - [j59]Eddie Cheng, László Lipták, Ke Qiu, Zhizhang Shen
A Note on Linearly Many Faults of Interconnection Networks. J. Interconnect. Networks 22(1): 2142017:1-2142017:6 (2022) - [j58]Eddie Cheng, Yaping Mao
A general approach to deriving diagnosability results of interconnection networks. Int. J. Parallel Emergent Distributed Syst. 37(4): 369-397 (2022) - [j57]Eddie Cheng, Ke Qiu, Zhizhang Shen
On the g-extra diagnosability of enhanced hypercubes. Theor. Comput. Sci. 921: 6-19 (2022) - [c32]Ethan Gibbons, Ke Qiu:
A Recurrence for the Surface Area of the ($n, k$)-Star Graph. CANDAR 2022: 19-26 - [i1]Eddie Cheng, Yaping Mao, Ke Qiu, Zhizhang Shen
A general approach to deriving diagnosability results of interconnection networks. CoRR abs/2205.01631 (2022) - 2021
- [j56]Mehrdad Arabpour Niasari
An efficient shortest path routing on the hypercube with blocking/faulty nodes. Concurr. Comput. Pract. Exp. 33(12) (2021) - 2020
- [j55]Eddie Cheng, Ke Qiu, Zhizhang Shen
The g-extra diagnosability of the generalized exchanged hypercube. Int. J. Comput. Math. Comput. Syst. Theory 5(2): 112-123 (2020) - [j54]Wei Ding
Approximating the asymmetric p-center problem in parameterized complete digraphs. J. Comb. Optim. 40(1): 21-35 (2020) - [j53]Eddie Cheng, Ke Qiu, Zhizhang Shen:
Preface. Int. J. Parallel Emergent Distributed Syst. 35(1): 1 (2020) - [j52]Eddie Cheng, Ke Qiu, Zhizhang Shen
Diagnosability of interconnection networks: past, present and future. Int. J. Parallel Emergent Distributed Syst. 35(1): 2-8 (2020) - [j51]Eddie Cheng, Ke Qiu, Zhizhang Shen, Weihua Yang:
Preface. Parallel Process. Lett. 30(3): 2002001:1 (2020) - [j50]Eddie Cheng
A Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection Networks. Parallel Process. Lett. 30(3): 2040009:1-2040009:14 (2020) - [j49]Wei Ding
A 2-approximation algorithm and beyond for the minimum diameter k-Steiner forest problem. Theor. Comput. Sci. 840: 1-15 (2020) - [c31]Wei Ding
Minimum Diameter Vertex-Weighted Steiner Tree. AAIM 2020: 62-72
2010 – 2019
- 2019
- [j48]Eddie Cheng
A general approach to deriving the g-good-neighbor conditional diagnosability of interconnection networks. Theor. Comput. Sci. 757: 56-67 (2019) - [j47]Wei Ding
Approximating the restricted 1-center in graphs. Theor. Comput. Sci. 774: 31-43 (2019) - [j46]Jong-Seok Kim, Donghyun Kim, Ke Qiu, Hyeong-Ok Lee:
The divide-and-swap cube: a new hypercube variant with small network cost. J. Supercomput. 75(7): 3621-3639 (2019) - [c30]Wei Ding
Constant-Factor Greedy Algorithms for the Asymmetric p-Center Problem in Parameterized Complete Digraphs. AAIM 2019: 62-71 - [c29]Wei Ding
Updating Matrix Polynomials. AAIM 2019: 72-82 - [c28]Wei Ding
Sifting Edges to Accelerate the Computation of Absolute 1-Center in Graphs. WCGO 2019: 468-476 - [p1]Eddie Cheng, Rong-Xia Hao, Ke Qiu, Zhizhang Shen:
Structural Properties and Fault Resiliency of Interconnection Networks. From Parallel to Emergent Computing 2019: 77-102 - 2018
- [j45]Wei Ding
A quadratic time exact algorithm for continuous connected 2-facility location problem in trees. J. Comb. Optim. 36(4): 1262-1298 (2018) - [c27]Wei Ding
Minimum Diameter k-Steiner Forest. AAIM 2018: 1-11 - [c26]Mehrdad Arabpour Niasari, Ke Qiu:
An Efficient Shortest Path Routing on the Hypercube with Blocking/Faulty Nodes. CANDAR 2018: 39-46 - 2017
- [j44]Eddie Cheng
A strong connectivity property of the generalized exchanged hypercube. Discret. Appl. Math. 216: 529-536 (2017) - [j43]Eddie Cheng
Diagnosability problems of the exchanged hypercube and its generalization. Int. J. Comput. Math. Comput. Syst. Theory 2(2): 39-52 (2017) - [j42]Eddie Cheng, Ke Qiu, Zhizhang Shen:
On Diagnosability of Interconnection Networks. Int. J. Unconv. Comput. 13(3): 245-251 (2017) - [j41]Wei Ding
An FPTAS for generalized absolute 1-center problem in vertex-weighted graphs. J. Comb. Optim. 34(4): 1084-1095 (2017) - [j40]Wei Ding
Incremental single-source shortest paths in digraphs with arbitrary positive arc weights. Theor. Comput. Sci. 674: 16-31 (2017) - [j39]Eddie Cheng
On the restricted connectivity of the arrangement graph. J. Supercomput. 73(8): 3669-3682 (2017) - [c25]Eddie Cheng
A Study of the Decycling Problem for the Generalized Exchanged Hypercube. ISPAN-FCST-ISCC 2017: 93-99 - 2016
- [j38]Eddie Cheng
Length two path centered surface areas of the (n, k)-star graph. Inf. Sci. 332: 115-130 (2016) - [j37]Eddie Cheng
On the Conditional Diagnosability of Hyper-Buttery Graphs snd Related Networks. Parallel Process. Lett. 26(1): 1650005:1-1650005:18 (2016) - [c24]Wei Ding
A Quadratic Time Exact Algorithm for Continuous Connected 2-Facility Location Problem in Trees (Extended Abstract). COCOA 2016: 408-420 - 2015
- [j36]F. Zhang, Ke Qiu, J. S. Kim:
Hyper-star graphs: Some topological properties and an optimal neighbourhood broadcasting algorithm. Concurr. Comput. Pract. Exp. 27(16): 4186-4193 (2015) - [j35]Eddie Cheng
Connectivity Results of Complete Cubic Networks as Associated with Linearly Many Faults. J. Interconnect. Networks 15(1-2): 1550007:1-1550007:23 (2015) - [c23]Wei Ding
Dynamic Single-Source Shortest Paths in Erdös-Rényi Random Graphs. COCOA 2015: 537-550 - [c22]Wei Ding
Approximating the Restricted 1-Center in Graphs. COCOA 2015: 647-659 - [c21]Keivan Noroozi, Ke Qiu:
On the Hamiltonicity, Connectivity, and Broadcasting Algorithm of the KCube. CANDAR 2015: 174-180 - 2014
- [j34]Eddie Cheng, Ke Qiu, Zhizhang Shen:
On the Surface Areas of the Alternating Group Graph and the Split-Star Graph. Ars Comb. 115: 239-260 (2014) - [j33]Eddie Cheng, Ke Qiu, Zhizhang Shen
The number of shortest paths in the (n, k)-star graph. Discret. Math. Algorithms Appl. 6(4) (2014) - [j32]Eddie Cheng
Length two path-centred surface areas for the arrangement graph. Int. J. Comput. Math. 91(6): 1170-1189 (2014) - [j31]Eddie Cheng
The edge-centered surface area of the arrangement graph. J. Comb. Optim. 27(1): 49-64 (2014) - [j30]Wei Ding
Algorithms for the minimum diameter terminal Steiner tree problem. J. Comb. Optim. 28(4): 837-853 (2014) - [j29]Eddie Cheng
On the conditional diagnosability of matching composition networks. Theor. Comput. Sci. 557: 101-114 (2014) - [j28]Eddie Cheng
Deriving length two path centered surface area for the arrangement graph: a generating function approach. J. Supercomput. 68(3): 1241-1264 (2014) - [j27]Jong-Seok Kim, Sung Won Kim, Ke Qiu, Hyeong-Ok Lee:
Some properties and algorithms for the hyper-torus network. J. Supercomput. 69(1): 121-138 (2014) - [c20]Eddie Cheng
Connectivity Results of Hierarchical Cubic Networks as Associated with Linearly Many Faults. CSE 2014: 1213-1220 - [c19]Keivan Noroozi, Lily Zhao, Ke Qiu:
On the Hamiltonicity of the KCube Interconnection Network. CANDAR 2014: 577-581 - [c18]F. Zhang, Ke Qiu, J. S. Kim:
Hyper-Star Graphs: Some Topological Properties and an Optimal Neighbourhood Broadcasting Algorithm. ICA3PP (1) 2014: 526-534 - 2013
- [j26]Eddie Cheng
A Generating Function Approach to the Edge Surface Area of the Arrangement Graphs. Comput. J. 56(7): 871-881 (2013) - [j25]Eddie Cheng
Cyclic Vertex-Connectivity of Cayley Graphs Generated by Transposition Trees. Graphs Comb. 29(4): 835-841 (2013) - [j24]Eddie Cheng, Ke Qiu, Zhizhang Shen:
A Faster Algorithm for Finding Disjoint Ordering of Sets. Int. J. Netw. Comput. 3(2): 182-191 (2013) - [j23]Eddie Cheng
The number of shortest paths in the arrangement graph. Inf. Sci. 240: 191-204 (2013) - 2012
- [j22]Eddie Cheng
On deriving conditional diagnosability of interconnection networks. Inf. Process. Lett. 112(17-18): 674-677 (2012) - [j21]Eddie Cheng
A Unified Approach to the Conditional Diagnosability of Interconnection Networks. J. Interconnect. Networks 13(3-4) (2012) - [j20]Eddie Cheng
A note on the alternating group network. J. Supercomput. 59(1): 246-248 (2012) - [j19]Eddie Cheng
On the surface area of the augmented cubes. J. Supercomput. 61(3): 856-868 (2012) - [c17]Eddie Cheng
The Edge-Centered Surface Area of the Arrangement Graph. COCOA 2012: 49-60 - [c16]Eddie Cheng
A Faster Algorithm for Finding Disjoint Ordering of Sets. ICNC 2012: 118-124 - 2011
- [j18]Eddie Cheng
On the Surface Areas and Average Distances of Meshes and Tori. Parallel Process. Lett. 21(1): 61-75 (2011) - [c15]Eddie Cheng
On the Surface Area of the Asymmetric Twisted Cube. COCOA 2011: 411-423 - 2010
- [j17]Eddie Cheng
On deriving explicit formulas of the surface areas for the arrangement graphs and some of the related graphs. Int. J. Comput. Math. 87(13): 2903-2914 (2010) - [j16]Eddie Cheng
Distance formula and shortest paths for the (n, k)-star graphs. Inf. Sci. 180(9): 1671-1680 (2010) - [j15]Ke Qiu:
Guest Editor's Note: Advances in Quantum Computation. Parallel Process. Lett. 20(3): 211-212 (2010) - [c14]Eddie Cheng
The Number of Shortest Paths in the (n, k)-Star Graphs. COCOA (1) 2010: 222-236
2000 – 2009
- 2009
- [j14]Eddie Cheng, Ke Qiu, Zhizhang Shen
A Generating Function Approach to the Surface Areas of Some Interconnection Networks. J. Interconnect. Networks 10(3): 189-204 (2009) - [j13]Eddie Cheng
A short note on the surface area of star graphs. Parallel Process. Lett. 19(1): 19-22 (2009) - [j12]Zhizhang Shen
On the surface area of the (n, k)-star graph. Theor. Comput. Sci. 410(52): 5481-5490 (2009) - [c13]Eddie Cheng
On Disjoint Shortest Paths Routing on the Hypercube. COCOA 2009: 375-383 - [c12]Yi Feng Li, Ke Qiu:
Routing, Broadcasting, Prefix Sums, and Sorting Algorithms on the Arrangement Graph. ICPADS 2009: 324-331 - 2008
- [j11]Zhizhang Shen
On the Whitney numbers of the second kind for the star poset. Eur. J. Comb. 29(7): 1585-1586 (2008) - [c11]Zhizhang Shen
On the Surface Area of the (n, k)-Star Graph. COCOA 2008: 393-404 - [c10]L. He, Ke Qiu, Zhizhang Shen
Neighbourhood Broadcasting and Broadcasting on the (n, k)-Star Graph. ICA3PP 2008: 70-78 - [c9]Ke Qiu:
An Efficient Disjoint Shortest Paths Routing Algorithm for the Hypercube. ICPADS 2008: 43-47 - 2007
- [j10]Ke Qiu, Selim G. Akl:
Finding the maximum subsequence sum on interconnection networks. Int. J. Parallel Emergent Distributed Syst. 22(5): 371-385 (2007) - [j9]Ke Qiu:
On a Unified Neighbourhood Broadcasting Scheme for Interconnection Networks. Parallel Process. Lett. 17(4): 425-437 (2007) - [c8]Zhizhang Shen, Ke Qiu:
On the effective paths for the general tori. PDCS 2007: 230-235 - [c7]Zhizhang Shen, Ke Qiu:
On the vertex disjoint effective path for the general tori. PDCS 2007: 236-241 - 2006
- [c6]Ke Qiu:
Designing Parallel Algorithms on the Star Graph Using Orthogonal Decomposition. PDCS 2006: 19-23 - [c5]Ke Qiu:
A unified neighbourhood broadcasting scheme for multiple messages on interconnection networks. ACST 2006: 235-239 - 2005
- [c4]Ke Qiu, Selim G. Akl:
On Node-to-Node Disjoint Paths in the Star Interconnection Network. IASTED PDCS 2005: 731-735
1990 – 1999
- 1995
- [j8]Ke Qiu, Selim G. Akl:
On Some Properties of the Star Graph. VLSI Design 2(4): 389-396 (1995) - 1994
- [j7]Ke Qiu, Selim G. Akl, Henk Meijer:
On Some Properties and Algorithms for the Star and Pancake Interconnection Networks. J. Parallel Distributed Comput. 22(1): 16-25 (1994) - [j6]Ke Qiu, Selim G. Akl:
Load Balancing, Selection and Sorting on the Star and Pancake Interconnection Networks. Parallel Algorithms Appl. 2(1-2): 27-42 (1994) - 1993
- [j5]Selim G. Akl, Ke Qiu, Ivan Stojmenovic:
Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry. Networks 23(4): 215-225 (1993) - [j4]Selim G. Akl, Ke Qiu:
A Novel Routing Scheme on the Star and Pancake Networks and its Applications. Parallel Comput. 19(1): 95-101 (1993) - 1992
- [c3]Selim G. Akl, Ke Qiu:
Parallel Minimum Spanning Forest Algorithms on the Star and Pancake Interconnection Networks. CONPAR 1992: 565-570 - 1991
- [j3]Selim G. Akl, Gilles Labonté, M. Leeder, Ke Qiu:
On doing Todd-Coxeter coset enumeration in parallel. Discret. Appl. Math. 34(1-3): 27-35 (1991) - [j2]Ke Qiu, Henk Meijer, Selim G. Akl:
Decomposing a Star Graph Into Disjoint Cycles. Inf. Process. Lett. 39(3): 125-129 (1991) - [c2]Ke Qiu, Henk Meijer, Selim G. Akl:
Parallel Routing and Sorting of the Pancake Network. ICCI 1991: 360-371 - [c1]Selim G. Akl, Ke Qiu, Ivan Stojmenovic:
Data communication and computational geometry on the star and pancake interconnection networks. SPDP 1991: 415-422 - 1990
- [j1]Ke Qiu, Henk Meijer:
A Note on Diameter of Acyclic Directed Hypercubes. Inf. Process. Lett. 36(1): 51-52 (1990)
Coauthor Index
[j61] [c33] [j59] [j58] [j57] [i1] [j55] [j53] [j52] [j51] [j50] [j48] [p1] [j44] [j43] [j42] [j39] [c25] [j38] [j37] [j35] [j34] [j33] [j32] [j31] [j29] [j28] [c20] [j26] [j25] [j24] [j23] [j22] [j21] [j20] [j19] [c17] [c16] [j18] [c15] [j17] [j16] [c14] [j14] [j13] [j12] [c13] [j11] [c11] [c10] [c8] [c7]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: