A Note on Diameter of Acyclic Directed Hypercubes. - Ke Qiu 001; Henk Meijer (Inf. Process. Lett., 1990)

Parallel Routing and Sorting of the Pancake Network. - Ke Qiu 001; Henk Meijer; Selim G. Akl (ICCI, 1991)

Data communication and computational geometry on the star and pancake interconnection networks. - Selim G. Akl; Ke Qiu 001; Ivan Stojmenovic (SPDP, 1991)

On doing Todd-Coxeter coset enumeration in parallel. - Selim G. Akl; Gilles Labonté; M. Leeder; Ke Qiu 001 (Discret. Appl. Math., 1991)

Decomposing a Star Graph Into Disjoint Cycles. - Ke Qiu 001; Henk Meijer; Selim G. Akl (Inf. Process. Lett., 1991)

Parallel Minimum Spanning Forest Algorithms on the Star and Pancake Interconnection Networks. - Selim G. Akl; Ke Qiu 001 (CONPAR, 1992)

Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry. - Selim G. Akl; Ke Qiu 001; Ivan Stojmenovic (Networks, 1993)

A Novel Routing Scheme on the Star and Pancake Networks and its Applications. - Selim G. Akl; Ke Qiu 001 (Parallel Comput., 1993)

On Some Properties and Algorithms for the Star and Pancake Interconnection Networks. - Ke Qiu 001; Selim G. Akl; Henk Meijer (J. Parallel Distributed Comput., 1994)

Load Balancing, Selection and Sorting on the Star and Pancake Interconnection Networks. - Ke Qiu 001; Selim G. Akl (Parallel Algorithms Appl., 1994)

On Some Properties of the Star Graph. - Ke Qiu 001; Selim G. Akl (VLSI Design, 1995)

On Node-to-Node Disjoint Paths in the Star Interconnection Network. - Ke Qiu 001; Selim G. Akl (IASTED PDCS, 2005)

Designing Parallel Algorithms on the Star Graph Using Orthogonal Decomposition. - Ke Qiu 001 (PDCS, 2006)

A unified neighbourhood broadcasting scheme for multiple messages on interconnection networks. - Ke Qiu 001 (ACST, 2006)

On the effective paths for the general tori. - Zhizhang Shen; Ke Qiu 001 (PDCS, 2007)

On the vertex disjoint effective path for the general tori. - Zhizhang Shen; Ke Qiu 001 (PDCS, 2007)

Finding the maximum subsequence sum on interconnection networks. - Ke Qiu 001; Selim G. Akl (Int. J. Parallel Emergent Distributed Syst., 2007)

On a Unified Neighbourhood Broadcasting Scheme for Interconnection Networks. - Ke Qiu 001 (Parallel Process. Lett., 2007)

Neighbourhood Broadcasting and Broadcasting on the (n, k)-Star Graph. - L. He; Ke Qiu 001; Zhizhang Shen (ICA3PP, 2008)

An Efficient Disjoint Shortest Paths Routing Algorithm for the Hypercube. - Ke Qiu 001 (ICPADS, 2008)

On the Whitney numbers of the second kind for the star poset. - Zhizhang Shen; Ke Qiu 001 (Eur. J. Comb., 2008)

On Disjoint Shortest Paths Routing on the Hypercube. - Eddie Cheng 001; Shuhong Gao; Ke Qiu 001; Zhizhang Shen (COCOA, 2009)

Routing, Broadcasting, Prefix Sums, and Sorting Algorithms on the Arrangement Graph. - Yi Feng Li; Ke Qiu 001 (ICPADS, 2009)

A Generating Function Approach to the Surface Areas of Some Interconnection Networks. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (J. Interconnect. Networks, 2009)

A short note on the surface area of star graphs. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (Parallel Process. Lett., 2009)

On the surface area of the (n, k)-star graph. - Zhizhang Shen; Ke Qiu 001; Eddie Cheng 001 (Theor. Comput. Sci., 2009)

The Number of Shortest Paths in the (n, k)-Star Graphs. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (COCOA (1), 2010)

On deriving explicit formulas of the surface areas for the arrangement graphs and some of the related graphs. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (Int. J. Comput. Math., 2010)

Distance formula and shortest paths for the (n, k)-star graphs. - Eddie Cheng 001; Jerrold W. Grossman; László Lipták; Ke Qiu 001; Zhizhang Shen (Inf. Sci., 2010)

Guest Editor's Note: Advances in Quantum Computation. - Ke Qiu 001 (Parallel Process. Lett., 2010)

On the Surface Area of the Asymmetric Twisted Cube. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (COCOA, 2011)

On the Surface Areas and Average Distances of Meshes and Tori. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (Parallel Process. Lett., 2011)

On deriving conditional diagnosability of interconnection networks. - Eddie Cheng 001; László Lipták; Ke Qiu 001; Zhizhang Shen (Inf. Process. Lett., 2012)

A Unified Approach to the Conditional Diagnosability of Interconnection Networks. - Eddie Cheng 001; László Lipták; Ke Qiu 001; Zhizhang Shen (J. Interconnect. Networks, 2012)

A note on the alternating group network. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (J. Supercomput., 2012)

On the surface area of the augmented cubes. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (J. Supercomput., 2012)

A Generating Function Approach to the Edge Surface Area of the Arrangement Graphs. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (Comput. J., 2013)

Cyclic Vertex-Connectivity of Cayley Graphs Generated by Transposition Trees. - Eddie Cheng 001; László Lipták; Ke Qiu 001; Zhizhang Shen (Graphs Comb., 2013)

A Faster Algorithm for Finding Disjoint Ordering of Sets. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (Int. J. Netw. Comput., 2013)

The number of shortest paths in the arrangement graph. - Eddie Cheng 001; Jerrold W. Grossman; Ke Qiu 001; Zhizhang Shen (Inf. Sci., 2013)

Connectivity Results of Hierarchical Cubic Networks as Associated with Linearly Many Faults. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (CSE, 2014)

On the Hamiltonicity of the KCube Interconnection Network. - Keivan Noroozi; Lily Zhao; Ke Qiu 001 (CANDAR, 2014)

On the Surface Areas of the Alternating Group Graph and the Split-Star Graph. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (Ars Comb., 2014)

The number of shortest paths in the (n, k)-star graph. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (Discret. Math. Algorithms Appl., 2014)

Length two path-centred surface areas for the arrangement graph. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (Int. J. Comput. Math., 2014)

The edge-centered surface area of the arrangement graph. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (J. Comb. Optim., 2014)

Algorithms for the minimum diameter terminal Steiner tree problem. - Wei Ding 006; Ke Qiu 001 (J. Comb. Optim., 2014)

On the conditional diagnosability of matching composition networks. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (Theor. Comput. Sci., 2014)

Deriving length two path centered surface area for the arrangement graph: a generating function approach. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (J. Supercomput., 2014)

Some properties and algorithms for the hyper-torus network. - Jong-Seok Kim; Sung Won Kim; Ke Qiu 001; Hyeong-Ok Lee (J. Supercomput., 2014)

Dynamic Single-Source Shortest Paths in Erdös-Rényi Random Graphs. - Wei Ding 006; Ke Qiu 001 (COCOA, 2015)

On the Hamiltonicity, Connectivity, and Broadcasting Algorithm of the KCube. - Keivan Noroozi; Ke Qiu 001 (CANDAR, 2015)

Hyper-star graphs: Some topological properties and an optimal neighbourhood broadcasting algorithm. - F. Zhang; Ke Qiu 001; J. S. Kim (Concurr. Comput. Pract. Exp., 2015)

Connectivity Results of Complete Cubic Networks as Associated with Linearly Many Faults. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (J. Interconnect. Networks, 2015)

A Quadratic Time Exact Algorithm for Continuous Connected 2-Facility Location Problem in Trees (Extended Abstract). - Wei Ding 006; Ke Qiu 001 (COCOA, 2016)

Length two path centered surface areas of the (n, k)-star graph. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (Inf. Sci., 2016)

On the Conditional Diagnosability of Hyper-Buttery Graphs snd Related Networks. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (Parallel Process. Lett., 2016)

A Study of the Decycling Problem for the Generalized Exchanged Hypercube. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (ISPAN-FCST-ISCC, 2017)

A strong connectivity property of the generalized exchanged hypercube. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (Discret. Appl. Math., 2017)

Diagnosability problems of the exchanged hypercube and its generalization. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (Int. J. Comput. Math. Comput. Syst. Theory, 2017)

On Diagnosability of Interconnection Networks. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (Int. J. Unconv. Comput., 2017)

An FPTAS for generalized absolute 1-center problem in vertex-weighted graphs. - Wei Ding 006; Ke Qiu 001 (J. Comb. Optim., 2017)

Incremental single-source shortest paths in digraphs with arbitrary positive arc weights. - Wei Ding 006; Ke Qiu 001 (Theor. Comput. Sci., 2017)

On the restricted connectivity of the arrangement graph. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (J. Supercomput., 2017)

Minimum Diameter k-Steiner Forest. - Wei Ding 006; Ke Qiu 001 (AAIM, 2018)

A quadratic time exact algorithm for continuous connected 2-facility location problem in trees. - Wei Ding 006; Ke Qiu 001 (J. Comb. Optim., 2018)

Structural Properties and Fault Resiliency of Interconnection Networks. - Eddie Cheng 001; Rong-Xia Hao; Ke Qiu 001; Zhizhang Shen (From Parallel to Emergent Computing, 2019)

Constant-Factor Greedy Algorithms for the Asymmetric p-Center Problem in Parameterized Complete Digraphs. - Wei Ding 006; Ke Qiu 001 (AAIM, 2019)

Updating Matrix Polynomials. - Wei Ding 006; Ke Qiu 001 (AAIM, 2019)

Sifting Edges to Accelerate the Computation of Absolute 1-Center in Graphs. - Wei Ding 006; Ke Qiu 001 (WCGO, 2019)

A general approach to deriving the g-good-neighbor conditional diagnosability of interconnection networks. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (Theor. Comput. Sci., 2019)

Approximating the restricted 1-center in graphs. - Wei Ding 006; Ke Qiu 001 (Theor. Comput. Sci., 2019)

The divide-and-swap cube: a new hypercube variant with small network cost. - Jong-Seok Kim; Donghyun Kim; Ke Qiu 001; Hyeong-Ok Lee (J. Supercomput., 2019)

Minimum Diameter Vertex-Weighted Steiner Tree. - Wei Ding 006; Ke Qiu 001 (AAIM, 2020)

The g-extra diagnosability of the generalized exchanged hypercube. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (Int. J. Comput. Math. Comput. Syst. Theory, 2020)

Approximating the asymmetric p-center problem in parameterized complete digraphs. - Wei Ding 006; Ke Qiu 001 (J. Comb. Optim., 2020)

Preface. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (Int. J. Parallel Emergent Distributed Syst., 2020)

Diagnosability of interconnection networks: past, present and future. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (Int. J. Parallel Emergent Distributed Syst., 2020)

Preface. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen; Weihua Yang (Parallel Process. Lett., 2020)

A Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection Networks. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen; Weihua Yang (Parallel Process. Lett., 2020)

A 2-approximation algorithm and beyond for the minimum diameter k-Steiner forest problem. - Wei Ding 006; Ke Qiu 001 (Theor. Comput. Sci., 2020)

An efficient shortest path routing on the hypercube with blocking/faulty nodes. - Mehrdad Arabpour Niasari; Ke Qiu 001 (Concurr. Comput. Pract. Exp., 2021)

A Recurrence for the Surface Area of the ($n, k$)-Star Graph. - Ethan Gibbons; Ke Qiu 001 (CANDAR, 2022)

A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs. - Wei Ding 006; Ke Qiu 001; Yu Zhou; Zhou Ye (J. Comb. Optim., 2022)

A Note on Linearly Many Faults of Interconnection Networks. - Eddie Cheng 001; László Lipták; Ke Qiu 001; Zhizhang Shen (J. Interconnect. Networks, 2022)

A general approach to deriving diagnosability results of interconnection networks. - Eddie Cheng 001; Yaping Mao; Ke Qiu 001; Zhizhang Shen (Int. J. Parallel Emergent Distributed Syst., 2022)

On the g-extra diagnosability of enhanced hypercubes. - Eddie Cheng 001; Ke Qiu 001; Zhizhang Shen (Theor. Comput. Sci., 2022)

Forward Difference Properties of the (n, k)-Star Graph and Some Other Interconnection Networks. - Eddie Cheng 001; Ethan Gibbons; Ke Qiu 001; Zhizhang Shen (ICPADS, 2023)

On the g-extra connectivity of augmented cubes. - Eddie Cheng 001; László Lipták; Ke Qiu 001; Zhizhang Shen; Abhishek Vangipuram (Theor. Comput. Sci., 2023)

A recurrence for the surface area of the ( n , k ) $$ left(n,k right) $$ -star graph. - Ethan Gibbons; Ke Qiu 001 (Concurr. Comput. Pract. Exp., 2024)