Jianxi Fan

According to our database1, Jianxi Fan authored at least 112 papers between 1998 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
An efficient algorithm for embedding exchanged hypercubes into grids.
The Journal of Supercomputing, 2019

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

A Cost-Efficient Approach to Storing Users' Data for Online Social Networks.
J. Comput. Sci. Technol., 2019

Optimally Embedding 3-Ary n-Cubes into Grids.
J. Comput. Sci. Technol., 2019

TransLink: User Identity Linkage across Heterogeneous Social Networks via Translating Embeddings.
Proceedings of the 2019 IEEE Conference on Computer Communications, 2019

Cosin: Controllable Social Influence Maximization and Its Distributed Implementation in Large-scale Social Networks.
Proceedings of the 48th International Conference on Parallel Processing, 2019

2018
Super spanning connectivity on WK-recursive networks.
Theor. Comput. Sci., 2018

Hamiltonian cycle and path embeddings in 3-ary n-cubes based on K1, 3-structure faults.
J. Parallel Distrib. Comput., 2018

Optimizing cost for geo-distributed storage systems in online social networks.
J. Comput. Science, 2018

BCDC: A High-Performance, Server-Centric Data Center Network.
J. Comput. Sci. Technol., 2018

Structure connectivity and substructure connectivity of k-ary n-cube networks.
Inf. Sci., 2018

Constructing independent spanning trees with height n on the n-dimensional crossed cube.
Future Generation Comp. Syst., 2018

Diagnosability Evaluation of the Data Center Network DCell.
Comput. J., 2018

Embedding Exchanged Hypercubes into Rings and Ladders.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2018

Towards the Independent Spanning Trees in the Line Graphs of Interconnection Networks.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2018

2017
Edge-independent spanning trees in augmented cubes.
Theor. Comput. Sci., 2017

Fault-tolerant embedding of complete binary trees in locally twisted cubes.
J. Parallel Distrib. Comput., 2017

Optimal Path Embedding in the Exchanged Crossed Cube.
J. Comput. Sci. Technol., 2017

Cycles Embedding in Exchanged Crossed Cube.
Int. J. Found. Comput. Sci., 2017

A Fault-Free Unicast Algorithm in the Generalized Hypercube with Restricted Faulty Vertices.
Int. J. Found. Comput. Sci., 2017

Constructing completely independent spanning trees in crossed cubes.
Discrete Applied Mathematics, 2017

Towards traffic minimization for data placement in online social networks.
Concurrency and Computation: Practice and Experience, 2017

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

JPR: Exploring Joint Partitioning and Replication for Traffic Minimization in Online Social Networks.
Proceedings of the 37th IEEE International Conference on Distributed Computing Systems, 2017

Cost-Efficient Influence Maximization in Online Social Networks.
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.
Theor. Comput. Sci., 2016

Structure connectivity and substructure connectivity of hypercubes.
Theor. Comput. Sci., 2016

Vertex-disjoint paths in DCell networks.
J. Parallel Distrib. Comput., 2016

Complete binary trees embeddings in Möbius cubes.
J. Comput. Syst. Sci., 2016

IRIBE: Intrusion-resilient identity-based encryption.
Inf. Sci., 2016

In-band bootstrapping in database-driven multi-hop cognitive radio networks.
Int. J. Communication Systems, 2016

Conditional fault-tolerant routing of (n, k)-star graphs.
Int. J. Comput. Math., 2016

The restricted h-connectivity of the data center network DCell.
Discrete Applied Mathematics, 2016

A cost-efficient resource provisioning algorithm for DHT-based cloud storage systems.
Concurrency and Computation: Practice and Experience, 2016

Efficient Rendezvous Schemes for Mobile Collector in Wireless Sensor Networks with Relay Hop Constraint.
Ad Hoc & Sensor Wireless Networks, 2016

Hamiltonian Cycle and Path Embeddings in 3-Ary n-Cubes Based on K1, 2-Structure Faults.
Proceedings of the 2016 IEEE Trustcom/BigDataSE/ISPA, 2016

Optimizing Inter-server Communications by Exploiting Overlapping Communities in Online Social Networks.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2016

Location-Aware Data Placement for Geo-Distributed Online Social Networks.
Proceedings of the International Conference on Advanced Cloud and Big Data, 2016

Support path with time constraint in wireless sensor networks.
Proceedings of the 18th Asia-Pacific Network Operations and Management Symposium, 2016

2015
Dimensional-Permutation-Based Independent Spanning Trees in Bijective Connection Networks.
IEEE Trans. Parallel Distrib. Syst., 2015

Embedding complete binary trees into parity cubes.
The Journal of Supercomputing, 2015

One-to-one disjoint path covers on alternating group graphs.
Theor. Comput. Sci., 2015

An efficient communication relay placement algorithm for content-centric wireless mesh networks.
Int. J. Communication Systems, 2015

Hamiltonian Properties of DCell Networks.
Comput. J., 2015

Approximate Algorithms for Vertex Cover Problems in WSN Topology Design.
Ad Hoc & Sensor Wireless Networks, 2015

The Minimal Exposure Path in Mobile Wireless Sensor Network.
Proceedings of the Seventh International Symposium on Parallel Architectures, 2015

Dynamic Reconfiguration of Complete Binary Trees in Faulty Locally Twisted Cubes.
Proceedings of the 11th International Conference on Mobile Ad-hoc and Sensor Networks, 2015

One-to-One Disjoint Path Covers on Mesh.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2015

A Reliable Broadcasting Algorithm in Locally Twisted Cubes.
Proceedings of the IEEE 2nd International Conference on Cyber Security and Cloud Computing, 2015

Traffic-Aware Data Placement for Online Social Networks.
Proceedings of the Third International Conference on Advanced Cloud and Big Data, 2015

2014
On the metric dimension of HDN.
J. Discrete Algorithms, 2014

A model based on crossed cubes for VoD services.
Proceedings of the 2nd International Conference on Systems and Informatics, 2014

PTAS for Minimum k-Path Connected Vertex Cover in Growth-Bounded Graphs.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2014

Conditional Connectivity with Distance Requirement on Hypercube.
Proceedings of the 17th IEEE International Conference on Computational Science and Engineering, 2014

In-band bootstrapping in database-driven multi-hop cognitive radio networks.
Proceedings of the 11th IEEE Consumer Communications and Networking Conference, 2014

A Node-to-Set Disjoint Path Routing Algorithm in DCell Networks.
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.
The Journal of Supercomputing, 2013

Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes.
J. Parallel Distrib. Comput., 2013

Hamiltonian properties of honeycomb meshes.
Inf. Sci., 2013

Independent spanning trees in crossed cubes.
Inf. Sci., 2013

Resilient Multipath Routing Mechanism Based on Clustering with Intrusion Tolerance.
IJDSN, 2013

Uncertainty-Aware Sensor Deployment Strategy in Mixed Wireless Sensor Networks.
IJDSN, 2013

Changing the diameter of the locally twisted cube.
Int. J. Comput. Math., 2013

Constructive Algorithm of Independent Spanning Trees on Möbius Cubes.
Comput. J., 2013

One-to-One Disjoint Path Covers in DCell.
Proceedings of the Network and Parallel Computing - 10th IFIP International Conference, 2013

Circular Dimensional-Permutations and Reliable Broadcasting for Hypercubes and Möbius Cubes.
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.
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.
Theor. Comput. Sci., 2012

Intrusion-resilient identity-based signature: Security definition and construction.
Journal of Systems and Software, 2012

Independent spanning trees on twisted cubes.
J. Parallel Distrib. Comput., 2012

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

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

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

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

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

Adaptive Diagnosis in the Locally Twisted Cube.
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.
Theor. Comput. Sci., 2011

New Forward-Secure Signature Scheme with Untrusted Update.
J. Inf. Sci. Eng., 2011

Forward-secure identity-based signature: Security notions and construction.
Inf. Sci., 2011

Embedding meshes into twisted-cubes.
Inf. Sci., 2011

Efficient unicast in bijective connection networks with the restricted faulty node set.
Inf. Sci., 2011

Tree kernel-based semantic role labeling with enriched parse tree structure.
Inf. Process. Manage., 2011

The spined cube: A new hypercube variant with smaller diameter.
Inf. Process. Lett., 2011

Forward-Secure Identity-Based Public-Key Encryption without Random Oracles.
Fundam. Inform., 2011

An Algorithm to Find Optimal Independent Spanning Trees on Twisted-Cubes.
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.
IEEE Trans. Parallel Distrib. Syst., 2010

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

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

Tree kernel-based semantic relation extraction with rich syntactic and semantic information.
Inf. Sci., 2010

Embedding meshes into locally twisted cubes.
Inf. Sci., 2010

One-to-one communication in twisted cubes under restricted connectivity.
Frontiers Comput. Sci. China, 2010

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

Diagnosable evaluation of DCC linear congruential graphs under the PMC diagnostic model.
Inf. Sci., 2009

The Restricted Connectivity of Locally Twisted Cubes.
Proceedings of the 10th International Symposium on Pervasive Systems, 2009

A Fault-Free Unicast Algorithm in Twisted Cubes with the Restricted Faulty Node Set.
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.
Proceedings of IEEE International Conference on Communications, 2009

A Fast Method of Coarse Density Clustering for Large Data Sets.
Proceedings of the 2nd International Conference on BioMedical Engineering and Informatics, 2009

2008
Edge-pancyclicity and path-embeddability of bijective connection graphs.
Inf. Sci., 2008

Embedding of Cycles in Twisted Cubes with Edge-Pancyclic.
Algorithmica, 2008

2007
Optimal Embeddings of Paths with Various Lengths in Twisted Cubes.
IEEE Trans. Parallel Distrib. Syst., 2007

Optimal fault-tolerant embedding of paths in twisted cubes.
J. Parallel Distrib. Comput., 2007

Embedding meshes into crossed cubes.
Inf. Sci., 2007

2006
Complete path embeddings in crossed cubes.
Inf. Sci., 2006

2005
Optimal Path Embedding in Crossed Cubes.
IEEE Trans. Parallel Distrib. Syst., 2005

The t/k-Diagnosability of the BC Graphs.
IEEE Trans. Computers, 2005

Node-pancyclicity and edge-pancyclicity of crossed cubes.
Inf. Process. Lett., 2005

Embedding Paths of Different Lengths into Crossed Cubes.
Proceedings of the Sixth International Conference on Parallel and Distributed Computing, 2005

Edge-Pancyclicity of Twisted Cubes.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2002
Diagnosability of Crossed Cubes under the Comparison Diagnosis Model.
IEEE Trans. Parallel Distrib. Syst., 2002

Diagnosability of Crossed Cubes under the Comparison Diagnosis Model.
IEEE Trans. Parallel Distrib. Syst., 2002

Hamilton-connectivity and cycle-embedding of the Möbius cubes.
Inf. Process. Lett., 2002

1998
Diagnosability of the Möbius Cubes.
IEEE Trans. Parallel Distrib. Syst., 1998


  Loading...