The following pages link to Xiao-Hua Jia (Q224542):
Displaying 50 items.
- (Q328711) (redirect page) (← links)
- New analysis and computational study for the planar connected dominating set problem (Q328712) (← links)
- One-to-one disjoint path covers on alternating group graphs (Q476856) (← links)
- Hamiltonian properties of honeycomb meshes (Q497228) (← links)
- Efficient unicast in bijective connection networks with the restricted faulty node set (Q545351) (← links)
- Embedding meshes into twisted-cubes (Q545387) (← links)
- An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges (Q551165) (← links)
- Independent spanning trees on twisted cubes (Q663434) (← links)
- A greedy approximation for minimum connected dominating sets (Q706637) (← links)
- A note on optical network with nonsplitting nodes (Q813337) (← links)
- Minimum connected dominating sets and maximal independent sets in unit disk graphs (Q818109) (← links)
- Node-pancyclicity and edge-pancyclicity of crossed cubes (Q835009) (← links)
- Optimal fault-tolerant embedding of paths in twisted cubes (Q866765) (← links)
- An efficient algorithm to construct disjoint path covers of DCell networks (Q897875) (← links)
- Embedding of cycles in twisted cubes with edge-pancyclic (Q930597) (← links)
- Inapproximability and approximability of minimal tree routing and coloring (Q935848) (← links)
- Non-unique probe selection and group testing (Q995556) (← links)
- Design and analysis of a self-tuning feedback controller for the internet (Q1030981) (← links)
- Computational study on planar dominating set problem (Q1040587) (← links)
- Fixed topology Steiner trees and spanning forests (Q1285596) (← links)
- Coloring of double disk graphs (Q1424964) (← links)
- Rivest-Vuillemin conjecture is true for monotone Boolean functions with twelve variables (Q1613515) (← links)
- Mechanism design for two-opposite-facility location games with penalties on distance (Q1617675) (← links)
- The extra connectivity, extra conditional diagnosability and \(t/k\)-diagnosability of the data center network DCell (Q1731845) (← links)
- Power assignment for \(k\)-connectivity in wireless ad hoc networks (Q1781807) (← links)
- A polynomial time approximation scheme for the grade of service Steiner minimum tree problem (Q1810876) (← links)
- Routing algorithm for multicast under multi-tree model in optical networks (Q1884928) (← links)
- An algorithm to construct independent spanning trees on parity cubes (Q1929242) (← links)
- The spined cube: a new hypercube variant with smaller diameter (Q1944950) (← links)
- On shortest \(k\)-edge-connected Steiner networks in metric spaces (Q1977864) (← links)
- Optimal RSUs placement with delay bounded message dissemination in vehicular networks (Q2012886) (← links)
- Algorithms for the metric ring star problem with fixed edge-cost ratio (Q2051906) (← links)
- The extra connectivity and extra diagnosability of regular interconnection networks (Q2290625) (← links)
- Reliability analysis of data center networks based on precise and imprecise diagnosis strategies (Q2290628) (← links)
- Privacy-preserving attribute-keyword based data publish-subscribe service on cloud platforms (Q2293030) (← links)
- Embedding meshes into crossed cubes (Q2372214) (← links)
- Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes (Q2442959) (← links)
- Edge-pancyclicity and path-embeddability of bijective connection graphs (Q2466094) (← links)
- On optimal placement of relay nodes for reliable connectivity in wireless sensor networks (Q2498988) (← links)
- Improving construction for connected dominating set with Steiner tree in wireless sensor networks (Q2505562) (← links)
- Maximal lifetime scheduling for \(k\) to 1 sensor-target surveillance networks (Q2506800) (← links)
- Complete path embeddings in crossed cubes (Q2509240) (← links)
- (Q2751928) (← links)
- (Q2751944) (← links)
- Optimal Placement of Web Proxies for Replicated Web Servers in the Internet (Q2762718) (← links)
- Clustering Non-uniform-sized Spatial Objects to Reduce I/O Cost for Spatial-join Processing (Q2762726) (← links)
- Computational Study for Planar Connected Dominating Set Problem (Q3066449) (← links)
- A Sensor Deployment Strategy in Bus-Based Hybrid Ad-Hoc Networks (Q3467848) (← links)
- (Q4420338) (← links)
- Placement of Web-Server Proxies with Consideration of Read and Update Operations on the Internet (Q4432860) (← links)
