The following pages link to Weili Wu (Q199274):
Displaying 50 items.
- A note on the minimum number of choosability of planar graphs (Q266020) (← links)
- A joint optimization of data ferry trajectories and communication powers of ground sensors for long-term environmental monitoring (Q281797) (← links)
- On Bharathi-Kempe-Salek conjecture for influence maximization on arborescence (Q281819) (← links)
- Mining hidden links in social networks to achieve equilibrium (Q300217) (← links)
- List edge and list total coloring of planar graphs with maximum degree 8 (Q328709) (← links)
- Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs (Q331973) (← links)
- Max-min weight balanced connected partition (Q386475) (← links)
- Algebraic data retrieval algorithms for multi-channel wireless data broadcast (Q391229) (← links)
- Minimum number of disjoint linear forests covering a planar graph (Q405685) (← links)
- A greedy algorithm for the fault-tolerant connected dominating set in a general graph (Q405692) (← links)
- Constructing weakly connected dominating set for secure clustering in distributed sensor network (Q421263) (← links)
- A PTAS for the minimum weighted dominating set problem with smooth weights on unit disk graphs (Q437046) (← links)
- Complexity and approximation of the connected set-cover problem (Q453623) (← links)
- Minimum total coloring of planar graph (Q475814) (← links)
- A nature-inspired influence propagation model for the community expansion problem (Q489686) (← links)
- An individual-based model of information diffusion combining friends' influence (Q489688) (← links)
- Improvement of path analysis algorithm in social networks based on HBase (Q489703) (← links)
- Noise-tolerance community detection and evolution in dynamic social networks (Q489706) (← links)
- A short-term trend prediction model of topic over Sina Weibo dataset (Q489708) (← links)
- Net trade and market efficiency in Grossman and Stiglitz (1980) (Q503049) (← links)
- Solution of Bharathi-Kempe-Salek conjecture for influence maximization on arborescence (Q511732) (← links)
- A novel approach for detecting multiple rumor sources in networks with partial observations (Q512871) (← links)
- Total coloring of planar graphs without adjacent short cycles (Q512886) (← links)
- Online makespan minimization in MapReduce-like systems with complex reduce tasks (Q526409) (← links)
- On positive-influence target-domination (Q526426) (← links)
- An exact algorithm for minimum CDS with shortest path constraint in wireless networks (Q537641) (← links)
- On minimum submodular cover with submodular cost (Q540698) (← links)
- Hardness of \(k\)-vertex-connected subgraph augmentation problem (Q604752) (← links)
- Two constructions of new error-correcting pooling designs from orthogonal spaces over a finite field of characteristic 2 (Q613658) (← links)
- Constructing error-correcting pooling designs with symplectic space (Q613666) (← links)
- Approaching pooling design with smaller efficient ratio (Q620527) (← links)
- New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs (Q621836) (← links)
- DNA library screening, pooling design and unitary spaces (Q621839) (← links)
- Efficient algorithms for supergraph query processing on graph databases (Q630186) (← links)
- A greedy approximation for minimum connected dominating sets (Q706637) (← links)
- Minimum connected dominating sets and maximal independent sets in unit disk graphs (Q818109) (← links)
- A better constant-factor approximation for selected-internal Steiner minimum tree (Q848949) (← links)
- Node-weighted Steiner tree approximation in unit disk graphs (Q849134) (← links)
- Mining maximal hyperclique pattern: a hybrid search strategy (Q867645) (← links)
- Approximation algorithm for the balanced 2-connected \(k\)-partition problem (Q896161) (← links)
- On approximate optimal dual power assignment for biconnectivity and edge-biconnectivity (Q924146) (← links)
- Lower bounds and new constructions on secure group communication schemes (Q955028) (← links)
- On dual power assignment optimization for biconnectivity (Q965816) (← links)
- Non-unique probe selection and group testing (Q995556) (← links)
- Optimization scheme for sensor coverage scheduling with bandwidth constraints (Q1001327) (← links)
- Construction of strongly connected dominating sets in asymmetric multihop wireless networks (Q1006037) (← links)
- Algorithms for connected set cover problem and fault-tolerant connected set cover problem (Q1006053) (← links)
- A PTAS for minimum connected dominating set in 3-dimensional wireless sensor networks (Q1037372) (← links)
- A better constant-factor approximation for weighted dominating set in unit disk graph (Q1037452) (← links)
- PTAS for connected vertex cover in unit disk graphs (Q1040582) (← links)
