The following pages link to Hongwei David Du (Q995554):
Displaying 50 items.
- (Q346517) (redirect page) (← links)
- Approximation schemes for Euclidean vehicle routing problems with time windows (Q346518) (← links)
- Approximation algorithms for minimum latency data aggregation in wireless sensor networks with directional antenna (Q391234) (← links)
- Polynomial-time approximation scheme for minimum connected dominating set under routing cost constraint in wireless sensor networks (Q443711) (← links)
- Approximation algorithm for partial positive influence problem in social network (Q511731) (← links)
- New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs (Q621836) (← links)
- On positive influence dominating sets in social networks (Q621845) (← links)
- A greedy approximation for minimum connected dominating sets (Q706637) (← links)
- Blocking rumor by cut (Q721923) (← links)
- Minimum choosability of planar graphs (Q724728) (← 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)
- Set covering in fuel-considered vehicle routing problems (Q896127) (← links)
- Non-unique probe selection and group testing (Q995556) (← links)
- Construction of strongly connected dominating sets in asymmetric multihop wireless networks (Q1006037) (← links)
- Coloring of double disk graphs (Q1424964) (← links)
- Optimal channel assignment and \(L(p,1)\)-labeling (Q1630278) (← links)
- On general threshold and general cascade models of social influence (Q1698071) (← links)
- Cloning automata: simulation and analysis of computer bacteria (Q1699808) (← links)
- Modeling and verifying multi-core programs (Q1708646) (← links)
- (Q1958642) (redirect page) (← links)
- Approximations for node-weighted Steiner tree in unit disk graphs (Q1958644) (← links)
- Verify heaps via unified model checking (Q1986561) (← links)
- A decision procedure and complete axiomatization for projection temporal logic (Q1986563) (← links)
- Connected positive influence dominating set in \(k\)-regular graph (Q2004078) (← links)
- Optimal RSUs deployment with delay bound along highways in VANET (Q2012881) (← links)
- Optimal RSUs placement with delay bounded message dissemination in vehicular networks (Q2012886) (← links)
- On strict submodularity of social influence (Q2025076) (← links)
- TLHSA and SACA: two heuristic algorithms for two variant VRP models (Q2084658) (← links)
- Group sweep coverage with guaranteed approximation ratio (Q2193266) (← links)
- Target users' activation probability maximization with different seed set constraints in social networks (Q2197539) (← links)
- Optimizing flight trajectory of UAV for efficient data collection in wireless sensor networks (Q2220849) (← links)
- A novel approach to verifying context free properties of programs (Q2290651) (← links)
- Activation probability maximization for target users under influence decay model (Q2300074) (← links)
- Index set expressions can represent temporal logic formulas (Q2317353) (← links)
- PTAS for routing-cost constrained minimum connected dominating set in growth bounded graphs (Q2352346) (← links)
- Handling least privilege problem and role mining in RBAC (Q2352353) (← links)
- Maximum lifetime connected coverage with two active-phase sensors (Q2392753) (← links)
- Constant-approximation for optimal data aggregation with physical interference (Q2393081) (← links)
- An efficient case for computing minimum linear arboricity with small maximum degree (Q2414123) (← links)
- Verifying a scheduling protocol of safety-critical systems (Q2424721) (← links)
- A temporal logic programming approach to planning (Q2424818) (← links)
- An improved distributed data aggregation scheduling in wireless sensor networks (Q2444150) (← links)
- Improving construction for connected dominating set with Steiner tree in wireless sensor networks (Q2505562) (← links)
- An approximation algorithm for general energy restricted sweep coverage problem (Q2661766) (← links)
- A two-layers heuristic search algorithm for milk run with a new PDPTW model (Q2692226) (← links)
- Data sensing with limited mobile sensors in sweep coverage (Q2692248) (← links)
- A Quasi-polynomial Time Approximation Scheme for Euclidean CVRPTW (Q2942382) (← links)
- Interference-Free k-barrier Coverage in Wireless Sensor Networks (Q2942393) (← links)
- A Bicriteria Approximation Algorithm for DVRP with Time Windows (Q2942399) (← links)
