Jianxi Fan

Zhiyong Pan

Proceedings of the Algorithms and Architectures for Parallel Processing, 2021

Parallel Construction of Independent Spanning Trees on Folded Crossed Cubes.

[BibT_eX]

[DOI]

Proceedings of the 32nd IEEE International Conference on Application-specific Systems, 2021

Edge-disjoint spanning trees in the line graph of hypercubes.

[BibT_eX]

[DOI]

Proceedings of the 32nd IEEE International Conference on Application-specific Systems, 2021

2020

A Novel Low Cost Interconnection Architecture Based on the Generalized Hypercube.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2020

The extra connectivity and extra diagnosability of regular interconnection networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

The reliability analysis of k-ary n-cube networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Reliability analysis of data center networks based on precise and imprecise diagnosis strategies.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

基于地址空间的树型网络地址分配 (Address Assignment Algorithm for Tree Network Based on Address Space).

[BibT_eX]

[DOI]

Ningning Liu

Chengkuan Lin

计算机科学, 2020

Fault-Tolerant Hamiltonicity and Hamiltonian Connectivity of BCube with Various Faulty Elements.

[BibT_eX]

[DOI]

J. Comput. Sci. Technol., 2020

Communication Performance Evaluation of the Locally Twisted Cube.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2020

The Conditional-(g, d, k)-Connectivity and Conditional-(g, d, k)-edge-Connectivity on the Hypercubes.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2020

Constructing Node-Independent Spanning Trees in Augmented Cubes.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2020

An improved algorithm to construct edge-independent spanning trees in augmented cubes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Connectivity and Routing Algorithm of the Data Center Network HSDC.

[BibT_eX]

[DOI]

Proceedings of the Network and Parallel Computing, 2020

Embedding Augmented Cubes into Grid Networks for Minimum Wirelength.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Architectures for Parallel Processing, 2020

Representation Learning on Networks for Community Detection.

[BibT_eX]

[DOI]

Proceedings of the Eighth International Conference on Advanced Cloud and Big Data, 2020

2019

Cost-efficient viral marketing in online social networks.

[BibT_eX]

[DOI]

World Wide Web, 2019

A Live Migration Algorithm for Containers Based on Resource Locality.

[BibT_eX]

[DOI]

J. Signal Process. Syst., 2019

An efficient algorithm for embedding exchanged hypercubes into grids.

[BibT_eX]

[DOI]

J. Supercomput., 2019

The extra connectivity, extra conditional diagnosability and t/k-diagnosability of the data center network DCell.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Constructing node-independent spanning trees on the line graph of the hypercube by an independent forest scheme.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2019

A Cost-Efficient Approach to Storing Users' Data for Online Social Networks.

[BibT_eX]

[DOI]

J. Comput. Sci. Technol., 2019

Optimally Embedding 3-Ary n-Cubes into Grids.

[BibT_eX]

[DOI]

J. Comput. Sci. Technol., 2019

Dynamic service deployment for budget-constrained mobile edge computing.

[BibT_eX]

[DOI]

Concurr. Comput. Pract. Exp., 2019

Structure Fault-Tolerance of the Generalized Hypercube.

[BibT_eX]

[DOI]

Comput. J., 2019

TransLink: User Identity Linkage across Heterogeneous Social Networks via Translating Embeddings.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE Conference on Computer Communications, 2019

Cosin: Controllable Social Influence Maximization and Its Distributed Implementation in Large-scale Social Networks.

[BibT_eX]

[DOI]

Jin Wang

Proceedings of the 48th International Conference on Parallel Processing, 2019

Vertex-Disjoint Paths in the Generalized Hypercube under 1-Restricted Connectivity.

[BibT_eX]

[DOI]

Proceedings of the 21st IEEE International Conference on High Performance Computing and Communications; 17th IEEE International Conference on Smart City; 5th IEEE International Conference on Data Science and Systems, 2019

Task Offloading for Social Sensing Applications in Mobile Edge Computing.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Conference on Advanced Cloud and Big Data, 2019

2018

Super spanning connectivity on WK-recursive networks.

[BibT_eX]

[DOI]

Lantao You

Yuejuan Han

Theor. Comput. Sci., 2018

Hamiltonian cycle and path embeddings in 3-ary n-cubes based on K1, 3-structure faults.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2018

Optimizing cost for geo-distributed storage systems in online social networks.

[BibT_eX]

[DOI]

J. Comput. Sci., 2018

BCDC: A High-Performance, Server-Centric Data Center Network.

[BibT_eX]

[DOI]

J. Comput. Sci. Technol., 2018

Structure connectivity and substructure connectivity of k-ary n-cube networks.

[BibT_eX]

[DOI]

Inf. Sci., 2018

Diagnosability of the exchanged crossed cube.

[BibT_eX]

[DOI]

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

Constructing independent spanning trees with height n on the n-dimensional crossed cube.

[BibT_eX]

[DOI]

Future Gener. Comput. Syst., 2018

Diagnosability Evaluation of the Data Center Network DCell.

[BibT_eX]

[DOI]

Comput. J., 2018

Embedding Exchanged Hypercubes into Rings and Ladders.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Architectures for Parallel Processing, 2018

Towards the Independent Spanning Trees in the Line Graphs of Interconnection Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Architectures for Parallel Processing, 2018

2017

Edge-independent spanning trees in augmented cubes.

[BibT_eX]

[DOI]

Yan Wang

Hong Shen

Theor. Comput. Sci., 2017

基于顶点度数的完全独立生成树研究 (Research on Completely Independent Spanning Trees Based on Degree of Vertices).

[BibT_eX]

[DOI]

计算机科学, 2017

Fault-tolerant embedding of complete binary trees in locally twisted cubes.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2017

Optimal Path Embedding in the Exchanged Crossed Cube.

[BibT_eX]

[DOI]

J. Comput. Sci. Technol., 2017

Cycles Embedding in Exchanged Crossed Cube.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2017

A Fault-Free Unicast Algorithm in the Generalized Hypercube with Restricted Faulty Vertices.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2017

Constructing completely independent spanning trees in crossed cubes.

[BibT_eX]

[DOI]

Baolei Cheng

Dajin Wang

Discret. Appl. Math., 2017

Towards traffic minimization for data placement in online social networks.

[BibT_eX]

[DOI]

Concurr. Comput. Pract. Exp., 2017

Hamiltonian Cycle and Path Embeddings in k-Ary n-Cubes Based on Structure Faults.

[BibT_eX]

[DOI]

Yali Lv

Cheng-Kuan Lin

Comput. J., 2017

JPR: Exploring Joint Partitioning and Replication for Traffic Minimization in Online Social Networks.

[BibT_eX]

[DOI]

Proceedings of the 37th IEEE International Conference on Distributed Computing Systems, 2017

Cost-Efficient Influence Maximization in Online Social Networks.

[BibT_eX]

[DOI]

Proceedings of the Fifth International Conference on Advanced Cloud and Big Data, 2017

2016

An efficient algorithm to construct disjoint path covers of DCell networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Structure connectivity and substructure connectivity of hypercubes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Vertex-disjoint paths in DCell networks.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2016

Complete binary trees embeddings in Möbius cubes.

[BibT_eX]

[DOI]

Zhao Liu

J. Comput. Syst. Sci., 2016

IRIBE: Intrusion-resilient identity-based encryption.

[BibT_eX]

[DOI]

Inf. Sci., 2016

In-band bootstrapping in database-driven multi-hop cognitive radio networks.

[BibT_eX]

[DOI]

Int. J. Commun. Syst., 2016

Conditional fault-tolerant routing of (n, k)-star graphs.

[BibT_eX]

[DOI]

Yali Lv

Yonghong Xiang

Int. J. Comput. Math., 2016

The restricted h-connectivity of the data center network DCell.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

A cost-efficient resource provisioning algorithm for DHT-based cloud storage systems.

[BibT_eX]

[DOI]

Juncheng Jia

Concurr. Comput. Pract. Exp., 2016

Efficient Rendezvous Schemes for Mobile Collector in Wireless Sensor Networks with Relay Hop Constraint.

[BibT_eX]

[DOI]

Wenjun Liu

Ad Hoc Sens. Wirel. Networks, 2016

Hamiltonian Cycle and Path Embeddings in 3-Ary n-Cubes Based on K1, 2-Structure Faults.

[BibT_eX]

[DOI]

Yali Lv

Cheng-Kuan Lin

Proceedings of the 2016 IEEE Trustcom/BigDataSE/ISPA, 2016

Optimizing Inter-server Communications by Exploiting Overlapping Communities in Online Social Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Architectures for Parallel Processing, 2016

Location-Aware Data Placement for Geo-Distributed Online Social Networks.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Advanced Cloud and Big Data, 2016

Support path with time constraint in wireless sensor networks.

[BibT_eX]

[DOI]

Proceedings of the 18th Asia-Pacific Network Operations and Management Symposium, 2016

2015

Dimensional-Permutation-Based Independent Spanning Trees in Bijective Connection Networks.

[BibT_eX]

[DOI]

Baolei Cheng

IEEE Trans. Parallel Distributed Syst., 2015

Embedding complete binary trees into parity cubes.

[BibT_eX]

[DOI]

Zhao Liu

J. Supercomput., 2015

One-to-one disjoint path covers on alternating group graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

An efficient communication relay placement algorithm for content-centric wireless mesh networks.

[BibT_eX]

[DOI]

Int. J. Commun. Syst., 2015

Hamiltonian Properties of DCell Networks.

[BibT_eX]

[DOI]

Comput. J., 2015

Approximate Algorithms for Vertex Cover Problems in WSN Topology Design.

[BibT_eX]

[DOI]

Ad Hoc Sens. Wirel. Networks, 2015

The Minimal Exposure Path in Mobile Wireless Sensor Network.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Symposium on Parallel Architectures, 2015

Dynamic Reconfiguration of Complete Binary Trees in Faulty Locally Twisted Cubes.

[BibT_eX]

[DOI]

Proceedings of the 11th International Conference on Mobile Ad-hoc and Sensor Networks, 2015

One-to-One Disjoint Path Covers on Mesh.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Architectures for Parallel Processing, 2015

A Reliable Broadcasting Algorithm in Locally Twisted Cubes.

[BibT_eX]

[DOI]

Proceedings of the IEEE 2nd International Conference on Cyber Security and Cloud Computing, 2015

Traffic-Aware Data Placement for Online Social Networks.

[BibT_eX]

[DOI]

Proceedings of the Third International Conference on Advanced Cloud and Big Data, 2015

2014

On the metric dimension of HDN.

[BibT_eX]

[DOI]

Dacheng Xu

J. Discrete Algorithms, 2014

A model based on crossed cubes for VoD services.

[BibT_eX]

[DOI]

Proceedings of the 2nd International Conference on Systems and Informatics, 2014

PTAS for Minimum k-Path Connected Vertex Cover in Growth-Bounded Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Architectures for Parallel Processing, 2014

Conditional Connectivity with Distance Requirement on Hypercube.

[BibT_eX]

[DOI]

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

In-band bootstrapping in database-driven multi-hop cognitive radio networks.

[BibT_eX]

[DOI]

Proceedings of the 11th IEEE Consumer Communications and Networking Conference, 2014

A Node-to-Set Disjoint Path Routing Algorithm in DCell Networks.

[BibT_eX]

[DOI]

Xi Wang

Proceedings of the Second International Conference on Advanced Cloud and Big Data, 2014

2013

Parallel construction of independent spanning trees and an application in diagnosis on Möbius cubes.

[BibT_eX]

[DOI]

J. Supercomput., 2013

Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2013

Hamiltonian properties of honeycomb meshes.

[BibT_eX]

[DOI]

Inf. Sci., 2013

Independent spanning trees in crossed cubes.

[BibT_eX]

[DOI]

Inf. Sci., 2013

Resilient Multipath Routing Mechanism Based on Clustering with Intrusion Tolerance.

[BibT_eX]

[DOI]

Int. J. Distributed Sens. Networks, 2013

Uncertainty-Aware Sensor Deployment Strategy in Mixed Wireless Sensor Networks.

[BibT_eX]

[DOI]

Int. J. Distributed Sens. Networks, 2013

Changing the diameter of the locally twisted cube.

[BibT_eX]

[DOI]

Yuejuan Han

Shukui Zhang

Int. J. Comput. Math., 2013

Constructive Algorithm of Independent Spanning Trees on Möbius Cubes.

[BibT_eX]

[DOI]

Comput. J., 2013

One-to-One Disjoint Path Covers in DCell.

[BibT_eX]

[DOI]

Proceedings of the Network and Parallel Computing - 10th IFIP International Conference, 2013

Circular Dimensional-Permutations and Reliable Broadcasting for Hypercubes and Möbius Cubes.

[BibT_eX]

[DOI]

Proceedings of the Network and Parallel Computing - 10th IFIP International Conference, 2013

Grid-Based Real-Time Data Gathering Protocol in Wireless Sensor Network with Mobile Sink.

[BibT_eX]

[DOI]

Proceedings of the 10th IEEE International Conference on High Performance Computing and Communications & 2013 IEEE International Conference on Embedded and Ubiquitous Computing, 2013

2012

An algorithm to construct independent spanning trees on parity cubes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Intrusion-resilient identity-based signature: Security definition and construction.

[BibT_eX]

[DOI]

J. Syst. Softw., 2012

Independent spanning trees on twisted cubes.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2012

Cooperative Data Processing Algorithm Based on Mobile Agent in Wireless Sensor Networks.

[BibT_eX]

[DOI]

Int. J. Distributed Sens. Networks, 2012

An Efficient Clustering Algorithm in Wireless Sensor Networks Using Cooperative Communication.

[BibT_eX]

[DOI]

Int. J. Distributed Sens. Networks, 2012

A Path Planning Algorithm with a Guaranteed Distance Cost in Wireless Sensor Networks.

[BibT_eX]

[DOI]

Int. J. Distributed Sens. Networks, 2012

A Diagnosis-Based Clustering and Multipath Routing Protocol for Wireless Sensor Networks.

[BibT_eX]

[DOI]

Wenjun Liu

Shukui Zhang

Int. J. Distributed Sens. Networks, 2012

Erratum to the paper: Forward-Secure Identity-Based Public-Key Encryption without Random Oracles.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2012

Adaptive Diagnosis in the Locally Twisted Cube.

[BibT_eX]

[DOI]

Proceedings of the Fifth International Symposium on Parallel Architectures, 2012

2011

An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

New Forward-Secure Signature Scheme with Untrusted Update.

[BibT_eX]

[DOI]

J. Inf. Sci. Eng., 2011

Forward-secure identity-based signature: Security notions and construction.

[BibT_eX]

[DOI]

Inf. Sci., 2011

Embedding meshes into twisted-cubes.

[BibT_eX]

[DOI]

Inf. Sci., 2011

Efficient unicast in bijective connection networks with the restricted faulty node set.

[BibT_eX]

[DOI]

Inf. Sci., 2011

Tree kernel-based semantic role labeling with enriched parse tree structure.

[BibT_eX]

[DOI]

Inf. Process. Manag., 2011

The spined cube: A new hypercube variant with smaller diameter.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

Forward-Secure Identity-Based Public-Key Encryption without Random Oracles.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2011

An Algorithm to Find Optimal Independent Spanning Trees on Twisted-Cubes.

[BibT_eX]

[DOI]

Yan Wang

Yuejuan Han

Proceedings of the Fourth International Symposium on Parallel Architectures, 2011

2010

A Locally-Adjustable Planar Structure for Adaptive Topology Control in Wireless Ad Hoc Networks.

[BibT_eX]

[DOI]

Guangquan Zhang

Zhaoliang Zhang

IEEE Trans. Parallel Distributed Syst., 2010

An Efficient and Robust Data Dissemination Protocol in Wireless Sensor Networks.

[BibT_eX]

[DOI]

J. Networks, 2010

A Data Aggregation Algorithm Based on Splay Tree for Wireless Sensor Networks.

[BibT_eX]

[DOI]

J. Comput., 2010

Tree kernel-based semantic relation extraction with rich syntactic and semantic information.

[BibT_eX]

[DOI]

Guodong Zhou

Longhua Qian

Inf. Sci., 2010

Embedding meshes into locally twisted cubes.

[BibT_eX]

[DOI]

Inf. Sci., 2010

One-to-one communication in twisted cubes under restricted connectivity.

[BibT_eX]

[DOI]

Frontiers Comput. Sci. China, 2010

2009

An Aggregation Tree Approach for Event Detection in Wireless Sensor Networks.

[BibT_eX]

[DOI]

J. Softw., 2009

Diagnosable evaluation of DCC linear congruential graphs under the PMC diagnostic model.

[BibT_eX]

[DOI]

Inf. Sci., 2009

The Restricted Connectivity of Locally Twisted Cubes.

[BibT_eX]

[DOI]

Proceedings of the 10th International Symposium on Pervasive Systems, 2009

A Fault-Free Unicast Algorithm in Twisted Cubes with the Restricted Faulty Node Set.

[BibT_eX]

[DOI]

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

TAP: An Adjustable Planar Structure for Adaptive Topology Control in Wireless Ad Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of IEEE International Conference on Communications, 2009

A Fast Method of Coarse Density Clustering for Large Data Sets.

[BibT_eX]

[DOI]

Lei Zhao

Jiwen Yang

Proceedings of the 2nd International Conference on BioMedical Engineering and Informatics, 2009

2008

Edge-pancyclicity and path-embeddability of bijective connection graphs.

[BibT_eX]

[DOI]

Inf. Sci., 2008

Embedding of Cycles in Twisted Cubes with Edge-Pancyclic.

[BibT_eX]

[DOI]

Algorithmica, 2008

2007

Optimal Embeddings of Paths with Various Lengths in Twisted Cubes.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2007

Optimal fault-tolerant embedding of paths in twisted cubes.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2007

Embedding meshes into crossed cubes.

[BibT_eX]

[DOI]

Inf. Sci., 2007

2006

Complete path embeddings in crossed cubes.

[BibT_eX]

[DOI]

Inf. Sci., 2006

2005

Optimal Path Embedding in Crossed Cubes.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2005

The t/k-Diagnosability of the BC Graphs.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2005

Node-pancyclicity and edge-pancyclicity of crossed cubes.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2005

Embedding Paths of Different Lengths into Crossed Cubes.

[BibT_eX]

[DOI]

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

Edge-Pancyclicity of Twisted Cubes.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2002

Diagnosability of Crossed Cubes under the Comparison Diagnosis Model.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2002

Hamilton-connectivity and cycle-embedding of the Möbius cubes.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

1998

Diagnosability of the Möbius Cubes.

[BibT_eX]

[DOI]