Ke Qiu

Concurr. Comput. Pract. Exp., May, 2024

2023

On the g-extra connectivity of augmented cubes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., August, 2023

Forward Difference Properties of the (n, k)-Star Graph and Some Other Interconnection Networks.

[BibT_eX]

[DOI]

Proceedings of the 29th IEEE International Conference on Parallel and Distributed Systems, 2023

2022

On the g-extra diagnosability of enhanced hypercubes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

A general approach to deriving diagnosability results of interconnection networks.

[BibT_eX]

[DOI]

Int. J. Parallel Emergent Distributed Syst., 2022

A Note on Linearly Many Faults of Interconnection Networks.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2022

A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

A Recurrence for the Surface Area of the ($n, k$)-Star Graph.

[BibT_eX]

[DOI]

Ethan Gibbons

Proceedings of the Tenth International Symposium on Computing and Networking, 2022

2021

An efficient shortest path routing on the hypercube with blocking/faulty nodes.

[BibT_eX]

[DOI]

Mehrdad Arabpour Niasari

Concurr. Comput. Pract. Exp., 2021

2020

A 2-approximation algorithm and beyond for the minimum diameter k-Steiner forest problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

A Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection Networks.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2020

Preface.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2020

Diagnosability of interconnection networks: past, present and future.

[BibT_eX]

[DOI]

Int. J. Parallel Emergent Distributed Syst., 2020

Preface.

[BibT_eX]

[DOI]

Int. J. Parallel Emergent Distributed Syst., 2020

Approximating the asymmetric p-center problem in parameterized complete digraphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2020

The g-extra diagnosability of the generalized exchanged hypercube.

[BibT_eX]

[DOI]

Int. J. Comput. Math. Comput. Syst. Theory, 2020

Minimum Diameter Vertex-Weighted Steiner Tree.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2020

2019

The divide-and-swap cube: a new hypercube variant with small network cost.

[BibT_eX]

[DOI]

J. Supercomput., 2019

Approximating the restricted 1-center in graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

A general approach to deriving the g-good-neighbor conditional diagnosability of interconnection networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Sifting Edges to Accelerate the Computation of Absolute 1-Center in Graphs.

[BibT_eX]

[DOI]

Proceedings of the Optimization of Complex Systems: Theory, 2019

Updating Matrix Polynomials.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2019

Constant-Factor Greedy Algorithms for the Asymmetric p-Center Problem in Parameterized Complete Digraphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2019

Structural Properties and Fault Resiliency of Interconnection Networks.

[BibT_eX]

[DOI]

Proceedings of the From Parallel to Emergent Computing, 1st Edition, 2019

2018

A quadratic time exact algorithm for continuous connected 2-facility location problem in trees.

[BibT_eX]

[DOI]

J. Comb. Optim., 2018

Minimum Diameter k-Steiner Forest.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2018

2017

On the restricted connectivity of the arrangement graph.

[BibT_eX]

[DOI]

J. Supercomput., 2017

Incremental single-source shortest paths in digraphs with arbitrary positive arc weights.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

An FPTAS for generalized absolute 1-center problem in vertex-weighted graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

On Diagnosability of Interconnection Networks.

[BibT_eX]

[DOI]

Int. J. Unconv. Comput., 2017

Diagnosability problems of the exchanged hypercube and its generalization.

[BibT_eX]

[DOI]

Int. J. Comput. Math. Comput. Syst. Theory, 2017

A strong connectivity property of the generalized exchanged hypercube.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

A Study of the Decycling Problem for the Generalized Exchanged Hypercube.

[BibT_eX]

[DOI]

Proceedings of the 14th International Symposium on Pervasive Systems, 2017

2016

On the Conditional Diagnosability of Hyper-Buttery Graphs snd Related Networks.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2016

Length two path centered surface areas of the (n, k)-star graph.

[BibT_eX]

[DOI]

Inf. Sci., 2016

A Quadratic Time Exact Algorithm for Continuous Connected 2-Facility Location Problem in Trees (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2016

2015

Connectivity Results of Complete Cubic Networks as Associated with Linearly Many Faults.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2015

Hyper-star graphs: Some topological properties and an optimal neighbourhood broadcasting algorithm.

[BibT_eX]

[DOI]

F. Zhang

J. S. Kim

Concurr. Comput. Pract. Exp., 2015

On the Hamiltonicity, Connectivity, and Broadcasting Algorithm of the KCube.

[BibT_eX]

[DOI]

Keivan Noroozi

Proceedings of the Third International Symposium on Computing and Networking, 2015

Dynamic Single-Source Shortest Paths in Erdös-Rényi Random Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2015

2014

Some properties and algorithms for the hyper-torus network.

[BibT_eX]

[DOI]

J. Supercomput., 2014

Deriving length two path centered surface area for the arrangement graph: a generating function approach.

[BibT_eX]

[DOI]

J. Supercomput., 2014

On the conditional diagnosability of matching composition networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Algorithms for the minimum diameter terminal Steiner tree problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 2014

The edge-centered surface area of the arrangement graph.

[BibT_eX]

[DOI]

J. Comb. Optim., 2014

Length two path-centred surface areas for the arrangement graph.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2014

The number of shortest paths in the (n, k)-star graph.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2014

On the Surface Areas of the Alternating Group Graph and the Split-Star Graph.

[BibT_eX]

Ars Comb., 2014

On the Hamiltonicity of the KCube Interconnection Network.

[BibT_eX]

[DOI]

Keivan Noroozi

Lily Zhao

Proceedings of the Second International Symposium on Computing and Networking, 2014

Connectivity Results of Hierarchical Cubic Networks as Associated with Linearly Many Faults.

[BibT_eX]

[DOI]

Proceedings of the 17th IEEE International Conference on Computational Science and Engineering, 2014

2013

The number of shortest paths in the arrangement graph.

[BibT_eX]

[DOI]

Inf. Sci., 2013

A Faster Algorithm for Finding Disjoint Ordering of Sets.

[BibT_eX]

[DOI]

Int. J. Netw. Comput., 2013

Cyclic Vertex-Connectivity of Cayley Graphs Generated by Transposition Trees.

[BibT_eX]

[DOI]

Graphs Comb., 2013

A Generating Function Approach to the Edge Surface Area of the Arrangement Graphs.

[BibT_eX]

[DOI]

Comput. J., 2013

2012

On the surface area of the augmented cubes.

[BibT_eX]

[DOI]

J. Supercomput., 2012

A note on the alternating group network.

[BibT_eX]

[DOI]

J. Supercomput., 2012

A Unified Approach to the Conditional Diagnosability of Interconnection Networks.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2012

On deriving conditional diagnosability of interconnection networks.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

2011

On the Surface Areas and Average Distances of Meshes and Tori.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2011

On the Surface Area of the Asymmetric Twisted Cube.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2011

2010

Guest Editor's Note: Advances in Quantum Computation.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2010

Distance formula and shortest paths for the (n, k)-star graphs.

[BibT_eX]

[DOI]

Inf. Sci., 2010

On deriving explicit formulas of the surface areas for the arrangement graphs and some of the related graphs.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2010

The Number of Shortest Paths in the (n, k)-Star Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2010

2009

On the surface area of the (n, k)-star graph.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

A short note on the surface area of star graphs.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2009

A Generating Function Approach to the Surface Areas of Some Interconnection Networks.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2009

Routing, Broadcasting, Prefix Sums, and Sorting Algorithms on the Arrangement Graph.

[BibT_eX]

[DOI]

Yi Feng Li

Proceedings of the 15th IEEE International Conference on Parallel and Distributed Systems, 2009

On Disjoint Shortest Paths Routing on the Hypercube.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2009

2008

On the Whitney numbers of the second kind for the star poset.

[BibT_eX]

[DOI]

Eur. J. Comb., 2008

An Efficient Disjoint Shortest Paths Routing Algorithm for the Hypercube.

[BibT_eX]

[DOI]

Proceedings of the 14th International Conference on Parallel and Distributed Systems, 2008

Neighbourhood Broadcasting and Broadcasting on the (n, k)-Star Graph.

[BibT_eX]

[DOI]

L. He

Proceedings of the Algorithms and Architectures for Parallel Processing, 2008

2007

On a Unified Neighbourhood Broadcasting Scheme for Interconnection Networks.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2007

Finding the maximum subsequence sum on interconnection networks.

[BibT_eX]

[DOI]

Int. J. Parallel Emergent Distributed Syst., 2007

On the vertex disjoint effective path for the general tori.

[BibT_eX]

Proceedings of the ISCA 20th International Conference on Parallel and Distributed Computing Systems, 2007

On the effective paths for the general tori.

[BibT_eX]

Proceedings of the ISCA 20th International Conference on Parallel and Distributed Computing Systems, 2007

2006

A unified neighbourhood broadcasting scheme for multiple messages on interconnection networks.

[BibT_eX]

Proceedings of the IASTED International Conference on Advances in Computer Science and Technology, 2006

Designing Parallel Algorithms on the Star Graph Using Orthogonal Decomposition.

[BibT_eX]

Proceedings of the ISCA 19th International Conference on Parallel and Distributed Computing Systems, 2006

2005

On Node-to-Node Disjoint Paths in the Star Interconnection Network.

[BibT_eX]

Proceedings of the International Conference on Parallel and Distributed Computing Systems, 2005

1995

On Some Properties of the Star Graph.

[BibT_eX]

[DOI]

VLSI Design, 1995

1994

Load Balancing, Selection and Sorting on the Star and Pancake Interconnection Networks.

[BibT_eX]

[DOI]

Parallel Algorithms Appl., 1994

On Some Properties and Algorithms for the Star and Pancake Interconnection Networks.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1994

1993

A Novel Routing Scheme on the Star and Pancake Networks and its Applications.

[BibT_eX]

[DOI]

Parallel Comput., 1993

Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry.

[BibT_eX]

[DOI]

Ivan Stojmenovic

Networks, 1993

1992

Parallel Minimum Spanning Forest Algorithms on the Star and Pancake Interconnection Networks.

[BibT_eX]

[DOI]

Proceedings of the Parallel Processing: CONPAR 92, 1992

1991

Decomposing a Star Graph Into Disjoint Cycles.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1991

On doing Todd-Coxeter coset enumeration in parallel.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1991

Data communication and computational geometry on the star and pancake interconnection networks.

[BibT_eX]

[DOI]

Ivan Stojmenovic

Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991

Parallel Routing and Sorting of the Pancake Network.

[BibT_eX]

[DOI]

Proceedings of the Advances in Computing and Information, 1991

1990

A Note on Diameter of Acyclic Directed Hypercubes.

[BibT_eX]

[DOI]