Weili Wu

Orcid: 0000-0001-8747-6340

Affiliations:
  • University of Texas at Dallas, School of Engineering and Computer Science, Dallas, TX, USA
  • University of Minnesota, Department of Computer Science and Engineering, Minneapolis, MN, USA (PhD 2002)


According to our database1, Weili Wu authored at least 398 papers between 1997 and 2025.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Efficient algorithm for stochastic rumor blocking problem in social networks during safety accident period.
Theor. Comput. Sci., 2025

2024
W-prize-collecting scheduling problem on parallel machines.
J. Comb. Optim., October, 2024

Contract Theory and Stackelberg-Game-Based Storage Resource Allocation in Edge Caching Systems.
IEEE Internet Things J., October, 2024

Improved approximation algorithm for the parallel-machine customer order scheduling with delivery time and submodular rejection penalties.
Optim. Lett., September, 2024

Blockchain-Driven Privacy-Preserving Contact-Tracing Framework in Pandemics.
IEEE Trans. Comput. Soc. Syst., June, 2024

Multi-Task Diffusion Incentive Design for Mobile Crowdsourcing in Social Networks.
IEEE Trans. Mob. Comput., May, 2024

Neighbor sum distinguishing total coloring of planar graphs with restrained cycles.
Discret. Math. Algorithms Appl., May, 2024

Composite Community-Aware Diversified Influence Maximization With Efficient Approximation.
IEEE/ACM Trans. Netw., April, 2024

A Greedy Monitoring Station Selection for Rumor Source Detection in Online Social Networks.
IEEE Trans. Comput. Soc. Syst., April, 2024

ToupleGDD: A Fine-Designed Solution of Influence Maximization by Deep Reinforcement Learning.
IEEE Trans. Comput. Soc. Syst., April, 2024

Surveying the landscape of text summarization with deep learning: A comprehensive review.
Discret. Math. Algorithms Appl., April, 2024

Supplementary Influence Maximization Problem in Social Networks.
IEEE Trans. Comput. Soc. Syst., February, 2024

Co-Activity Maximization in Online Social Networks.
IEEE Trans. Comput. Soc. Syst., February, 2024

Optimizing the Micro-Architectural Performance of the Current and Emerging Edge Infrastructure.
IEEE Trans. Cloud Comput., 2024

An Online Multi-Item Auction With Differential Privacy in Edge-Assisted Blockchains.
IEEE Internet Things J., 2024

Monotone Submodular Meta-learning under the Matroid Constraint.
Proceedings of the Algorithmic Aspects in Information and Management, 2024

2023
A Survey on Influence Maximization: From an ML-Based Combinatorial Optimization.
ACM Trans. Knowl. Discov. Data, November, 2023

Profit maximization in social networks and non-monotone DR-submodular maximization.
Theor. Comput. Sci., May, 2023

Influence-Based Community Partition With Sandwich Method for Social Networks.
IEEE Trans. Comput. Soc. Syst., April, 2023

An Overall Evaluation on Benefits of Competitive Influence Diffusion.
IEEE Trans. Big Data, April, 2023

Minimum total coloring of planar graphs with maximum degree 8.
J. Comb. Optim., March, 2023

Distance magic labeling of the halved folded n-cube.
J. Comb. Optim., March, 2023

Dependence-Aware Edge Intelligent Function Offloading for 6G-Based IoV.
IEEE Trans. Intell. Transp. Syst., February, 2023

Bold driver and static restart fused adaptive momentum for visual question answering.
Knowl. Inf. Syst., February, 2023

Pricing and Budget Allocation for IoT Blockchain With Edge Computing.
IEEE Trans. Cloud Comput., 2023

An optimal streaming algorithm for non-submodular functions maximization on the integer lattice.
J. Comb. Optim., 2023

A Blockchain-empowered Multi-Aggregator Federated Learning Architecture in Edge Computing with Deep Reinforcement Learning Optimization.
CoRR, 2023

Stochastic Model for Rumor Blocking Problem in Social Networks Under Rumor Source Uncertainty.
Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

Reinforcement Learning for Combating Cyberbullying in Online Social Networks.
Proceedings of the Combinatorial Optimization and Applications, 2023

EIF: A Mediated Pass-Through Framework for Inference as a Service.
Proceedings of the IEEE Intl Conf on Parallel & Distributed Processing with Applications, 2023

2022
A k-Hop Collaborate Game Model: Extended to Community Budgets and Adaptive Nonsubmodularity.
IEEE Trans. Syst. Man Cybern. Syst., 2022

Edge Server Deployment Scheme of Blockchain in IoVs.
IEEE Trans. Reliab., 2022

Reliable Traffic Monitoring Mechanisms Based on Blockchain in Vehicular Networks.
IEEE Trans. Reliab., 2022

Continuous Influence-Based Community Partition for Social Networks.
IEEE Trans. Netw. Sci. Eng., 2022

An Architecture for Distributed Energies Trading in Byzantine-Based Blockchains.
IEEE Trans. Green Commun. Netw., 2022

Union acceptable profit maximization in social networks.
Theor. Comput. Sci., 2022

Adaptive seeding for profit maximization in social networks.
J. Glob. Optim., 2022

Approximation algorithm for the parallel-machine scheduling problem with release dates and submodular rejection penalties.
J. Comb. Optim., 2022

Social network analysis and applications: A review of the broad research aspects of social network structure.
Discret. Math. Algorithms Appl., 2022

Graph representation learning for popularity prediction problem: A survey.
Discret. Math. Algorithms Appl., 2022

Composite Community-Aware Diversified Influence Maximization with Efficient Approximation.
CoRR, 2022

Recent Advances of Blockchain and its Applications.
CoRR, 2022

Blockchain Driven Privacy Preserving Contact Tracing Framework in COVID-19.
CoRR, 2022

A Binary Search Double Greedy Algorithm for Non-monotone DR-submodular Maximization.
Proceedings of the Algorithmic Aspects in Information and Management, 2022

Bicriteria Algorithms for Maximizing the Difference Between Submodular Function and Linear Function Under Noise.
Proceedings of the Algorithmic Aspects in Information and Management, 2022

2021
Robust rumor blocking problem with uncertain rumor sources in social networks.
World Wide Web, 2021

Slow Replica and Shared Protection: Energy-Efficient and Reliable Task Assignment in Cloud Data Centers.
IEEE Trans. Reliab., 2021

Reliability-Aware Offloading and Allocation in Multilevel Edge Computing System.
IEEE Trans. Reliab., 2021

Fine-Grained Trajectory Optimization of Multiple UAVs for Efficient Data Gathering from WSNs.
IEEE/ACM Trans. Netw., 2021

A Multi-Feature Diffusion Model: Rumor Blocking in Social Networks.
IEEE/ACM Trans. Netw., 2021

Targeted Activation Probability Maximization Problem in Online Social Networks.
IEEE Trans. Netw. Sci. Eng., 2021

An Incentive Mechanism for Building a Secure Blockchain-Based Internet of Things.
IEEE Trans. Netw. Sci. Eng., 2021

A Stochastic Algorithm Based on Reverse Sampling Technique to Fight Against the Cyberbullying.
ACM Trans. Knowl. Discov. Data, 2021

Adaptive Influence Maximization: If Influential Node Unwilling to Be the Seed.
ACM Trans. Knowl. Discov. Data, 2021

Continuous Profit Maximization: A Study of Unconstrained Dr-Submodular Maximization.
IEEE Trans. Comput. Soc. Syst., 2021

Cloud/Edge Computing Resource Allocation and Pricing for Mobile Blockchain: An Iterative Greedy and Search Approach.
IEEE Trans. Comput. Soc. Syst., 2021

Two-Phase Multidocument Summarization Through Content-Attention-Based Subtopic Detection.
IEEE Trans. Comput. Soc. Syst., 2021

Mixed-case community detection problem in social networks: Algorithms and analysis.
Theor. Comput. Sci., 2021

A constrained two-stage submodular maximization.
Theor. Comput. Sci., 2021

Matching influence maximization in social networks.
Theor. Comput. Sci., 2021

Optimizing flight trajectory of UAV for efficient data collection in wireless sensor networks.
Theor. Comput. Sci., 2021

Optimal wireless charger placement with individual energy requirement.
Theor. Comput. Sci., 2021

An approximation algorithm for the submodular multicut problem in trees with linear penalties.
Optim. Lett., 2021

An approximation algorithm for the k-generalized Steiner forest problem.
Optim. Lett., 2021

Discount allocation for cost minimization in online social networks.
J. Comb. Optim., 2021

A Blockchain-Enabled Ecosystem for Distributed Electricity Trading in Smart City.
IEEE Internet Things J., 2021

SSDBA: the stretch shrink distance based algorithm for link prediction in social networks.
Frontiers Comput. Sci., 2021

k-Submodular maximization with two kinds of constraints.
Discret. Math. Algorithms Appl., 2021

Schemes of propagation models and source estimators for rumor source detection in online social networks: A short survey of a decade of research.
Discret. Math. Algorithms Appl., 2021

A Random Algorithm for Profit Maximization with Multiple Adoptions in Online Social Networks.
CoRR, 2021

Differential Privacy-Based Online Allocations towards Integrating Blockchain and Edge Computing.
CoRR, 2021

Task-driven charger placement and power allocation for wireless sensor networks.
Ad Hoc Networks, 2021

Design of Intelligent Coalmine Tunnel Collapse Warning System Based on Can Bus and Zigbee Technology.
Proceedings of the ICCAI '21: 2021 7th International Conference on Computing and Artificial Intelligence, Tianjin China, April 23, 2021

Streaming Algorithms for Maximizing Non-submodular Functions on the Integer Lattice.
Proceedings of the Computational Data and Social Networks - 10th International Conference, 2021

Maximize the Probability of Union-Influenced in Social Networks.
Proceedings of the Combinatorial Optimization and Applications, 2021

The Sequelae of Hotel Pre-Sale: The Influence of Electronic Word-of-mouth Dispersion on Booking Cancellation Behavior.
Proceedings of the 19th IEEE/ACIS International Conference on Computer and Information Science, 2021

2020
Shuffle Scheduling for MapReduce Jobs Based on Periodic Network Status.
IEEE/ACM Trans. Netw., 2020

Minimizing Influence of Rumors by Blockers on Social Networks: Algorithms and Analysis.
IEEE Trans. Netw. Sci. Eng., 2020

An Efficient Randomized Algorithm for Rumor Blocking in Online Social Networks.
IEEE Trans. Netw. Sci. Eng., 2020

Targeted Protection Maximization in Social Networks.
IEEE Trans. Netw. Sci. Eng., 2020

Continuous Activity Maximization in Online Social Networks.
IEEE Trans. Netw. Sci. Eng., 2020

Budgeted Coupon Advertisement Problem: Algorithm and Robust Analysis.
IEEE Trans. Netw. Sci. Eng., 2020

Influence Maximization: Seeding Based on Community Structure.
ACM Trans. Knowl. Discov. Data, 2020

Effector Detection Problem in Social Networks.
IEEE Trans. Comput. Soc. Syst., 2020

A k-Hop Collaborate Game Model: Adaptive Strategy to Maximize Total Revenue.
IEEE Trans. Comput. Soc. Syst., 2020

Community-based rumor blocking maximization in social networks: Algorithms and analysis.
Theor. Comput. Sci., 2020

Information coverage maximization for multiple products in social networks.
Theor. Comput. Sci., 2020

Delivery Route Optimization with automated vehicle in smart urban environment.
Theor. Comput. Sci., 2020

Profit Maximization problem with Coupons in social networks.
Theor. Comput. Sci., 2020

Interaction-aware influence maximization and iterated sandwich method.
Theor. Comput. Sci., 2020

Viral marketing of online game by DS decomposition in social networks.
Theor. Comput. Sci., 2020

A semantic relatedness preserved subset extraction method for language corpora based on pseudo-Boolean optimization.
Theor. Comput. Sci., 2020

A random algorithm for profit maximization in online social networks.
Theor. Comput. Sci., 2020

Discount advertisement in social platform: algorithm and robust analysis.
Soc. Netw. Anal. Min., 2020

A general method of active friending in different diffusion models in social networks.
Soc. Netw. Anal. Min., 2020

A blockchain-based data storage framework: A rotating multiple random masters and error-correcting approach.
Peer-to-Peer Netw. Appl., 2020

On the metric dimension of the folded n-cube.
Optim. Lett., 2020

Data placement in distributed data centers for improved SLA and network cost.
J. Parallel Distributed Comput., 2020

A Proactive Reliable Mechanism-Based Vehicular Fog Computing Network.
IEEE Internet Things J., 2020

A fast double greedy algorithm for non-monotone DR-submodular function maximization.
Discret. Math. Algorithms Appl., 2020

Approximation algorithm for minimum connected 3-path vertex cover.
Discret. Appl. Math., 2020

A Double Auction for Charging Scheduling among Vehicles Using DAG-Blockchains.
CoRR, 2020

A Blockchain Transaction Graph based Machine Learning Method for Bitcoin Price Prediction.
CoRR, 2020

Overall Evaluations on Benefits of Influence When Disturbed by Rivals.
CoRR, 2020

Edge computing based incentivizing mechanism for mobile blockchain in IOT.
CoRR, 2020

Adaptive Multi-Feature Budgeted Profit Maximization in Social Networks.
CoRR, 2020

An Architecture for Distributed Energies Trading in Byzantine-Based Blockchain.
CoRR, 2020

A k-hop Collaborate Game Model: Extended to Community Budgets and Adaptive Non-Submodularity.
CoRR, 2020

Combined Cooling, Heating, and Power System in Blockchain-Enabled Energy Management.
CoRR, 2020

An Incentive Mechanism for Building a Secure Blockchain-based Industrial Internet of Things.
CoRR, 2020

Influence-based Community Partition with Sandwich Method for Social Networks.
CoRR, 2020

Continuous Influence-based Community Partition for Social Networks.
CoRR, 2020

Faster Healthcare Time Series Classification for Boosting Mortality Early Warning System.
Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, 2020

Latency-Aware Data Placements for Operational Cost Minimization of Distributed Data Centers.
Proceedings of the Database Systems for Advanced Applications, 2020

Matched Participants Maximization Based on Social Spread.
Proceedings of the Combinatorial Optimization and Applications, 2020

Edge Computing Integrated with Blockchain Technologies.
Proceedings of the Complexity and Approximation - In Memory of Ker-I Ko, 2020

Community-Based Rumor Blocking Maximization in Social Networks.
Proceedings of the Algorithmic Aspects in Information and Management, 2020

2019
Social Influence Maximization in Hypergraph in Social Networks.
IEEE Trans. Netw. Sci. Eng., 2019

Rumor Blocking through Online Link Deletion on Social Networks.
ACM Trans. Knowl. Discov. Data, 2019

Group Influence Maximization Problem in Social Networks.
IEEE Trans. Comput. Soc. Syst., 2019

Maximizing Activity Profit in Social Networks.
IEEE Trans. Comput. Soc. Syst., 2019

Marginal Gains to Maximize Content Spread in Social Networks.
IEEE Trans. Comput. Soc. Syst., 2019

A Novel Scene of Viral Marketing for Complementary Products.
IEEE Trans. Comput. Soc. Syst., 2019

Maximizing profit of multiple adoptions in social networks with a martingale approach.
J. Comb. Optim., 2019

Speech corpora subset selection based on time-continuous utterances features.
J. Comb. Optim., 2019

Quality of barrier cover with wireless sensors.
Int. J. Sens. Networks, 2019

Maximisation of the number of β-view covered targets in visual sensor networks.
Int. J. Sens. Networks, 2019

Monotone submodular maximization over the bounded integer lattice with cardinality constraints.
Discret. Math. Algorithms Appl., 2019

Near-Optimal Convergent Approach for Composed Influence Maximization Problem in Social Networks.
IEEE Access, 2019

An Approximation Algorithm for Active Friending in Online Social Networks.
Proceedings of the 39th IEEE International Conference on Distributed Computing Systems, 2019

A Universal Method Based on Structure Subgraph Feature for Link Prediction over Dynamic Networks.
Proceedings of the 39th IEEE International Conference on Distributed Computing Systems, 2019

Profit Maximization Under Group Influence Model in Social Networks.
Proceedings of the Computational Data and Social Networks - 8th International Conference, 2019

A Two-Stage Constrained Submodular Maximization.
Proceedings of the Algorithmic Aspects in Information and Management, 2019

Trajectory Optimization of UAV for Efficient Data Collection from Wireless Sensor Networks.
Proceedings of the Algorithmic Aspects in Information and Management, 2019

2018
Breach-Free Sleep-Wakeup Scheduling for Barrier Coverage With Heterogeneous Wireless Sensors.
IEEE/ACM Trans. Netw., 2018

Size Matters: A Comparative Analysis of Community Detection Algorithms.
IEEE Trans. Comput. Soc. Syst., 2018

Distributed Rumor Blocking With Multiple Positive Cascades.
IEEE Trans. Comput. Soc. Syst., 2018

On general threshold and general cascade models of social influence.
J. Comb. Optim., 2018

An Approximation Algorithm for Active Friending in Online Social Networks.
CoRR, 2018

Coupon Advertising in Online Social Systems: Algorithms and Sampling Techniques.
CoRR, 2018

On Misinformation Containment in Online Social Networks.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Minimizing Influence of Rumors by Blockers on Social Networks.
Proceedings of the Computational Data and Social Networks - 7th International Conference, 2018

Approximation for Influence Maximization.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

Approximation and Heuristics for Community Detection.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

Approximations for Steiner Minimum Trees.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017
Adaptive Influence Maximization in Dynamic Social Networks.
IEEE/ACM Trans. Netw., 2017

Maximum Lifetime Combined Barrier-Coverage of Weak Static Sensors and Strong Mobile Sensors.
IEEE Trans. Mob. Comput., 2017

Maximizing the Influence and Profit in Social Networks.
IEEE Trans. Comput. Soc. Syst., 2017

On positive-influence target-domination.
Optim. Lett., 2017

Online makespan minimization in MapReduce-like systems with complex reduce tasks.
Optim. Lett., 2017

A novel approach for detecting multiple rumor sources in networks with partial observations.
J. Comb. Optim., 2017

Total coloring of planar graphs without adjacent chordal 6-cycles.
J. Comb. Optim., 2017

Total coloring of planar graphs without adjacent short cycles.
J. Comb. Optim., 2017

Solution of Bharathi-Kempe-Salek conjecture for influence maximization on arborescence.
J. Comb. Optim., 2017

A novel rumour propagation model on social networks.
Int. J. Sens. Networks, 2017

Target coverage maximisation for directional sensor networks.
Int. J. Sens. Networks, 2017

Makespan minimization for MapReduce systems with different servers.
Future Gener. Comput. Syst., 2017

Distributed Rumor Blocking in Social Networks: A Game Theoretical Analysis.
CoRR, 2017

On Rivest-Vuillemin Conjecture for Fourteen Variables.
CoRR, 2017

Networked Stochastic Multi-armed Bandits with Combinatorial Strategies.
Proceedings of the 37th IEEE International Conference on Distributed Computing Systems, 2017

Active Friending in Online Social Networks.
Proceedings of the Fourth IEEE/ACM International Conference on Big Data Computing, 2017

2016
Influence and Profit.
Encyclopedia of Algorithms, 2016

Probe Selection.
Encyclopedia of Algorithms, 2016

Connected Set-Cover and Group Steiner Tree.
Encyclopedia of Algorithms, 2016

Minimum Connected Sensor Cover.
Encyclopedia of Algorithms, 2016

Greedy Approximation Algorithms.
Encyclopedia of Algorithms, 2016

Steiner Trees.
Encyclopedia of Algorithms, 2016

Maximum Lifetime Coverage.
Encyclopedia of Algorithms, 2016

Influence Maximization.
Encyclopedia of Algorithms, 2016

Fault-Tolerant Connected Dominating Set.
Encyclopedia of Algorithms, 2016

Rumor Blocking.
Encyclopedia of Algorithms, 2016

Adaptive Partitions.
Encyclopedia of Algorithms, 2016

Collaborative Data and Energy Transmission for Energy-Rechargeable Mobile Devices.
IEEE Trans. Wirel. Commun., 2016

Approximating Maximum Lifetime k-Coverage Through Minimizing Weighted k-Cover in Homogeneous Wireless Sensor Networks.
IEEE/ACM Trans. Netw., 2016

Efficient Client Assignment for Client-Server Systems.
IEEE Trans. Netw. Serv. Manag., 2016

Effector Detection in Social Networks.
IEEE Trans. Comput. Soc. Syst., 2016

Approximation algorithm for the balanced 2-connected k-partition problem.
Theor. Comput. Sci., 2016

Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs.
Optim. Lett., 2016

A note on the minimum number of choosability of planar graphs.
J. Comb. Optim., 2016

On Bharathi-Kempe-Salek conjecture for influence maximization on arborescence.
J. Comb. Optim., 2016

List edge and list total coloring of planar graphs with maximum degree 8.
J. Comb. Optim., 2016

A greedy algorithm for the minimum 2-connected m-fold dominating set problem.
J. Comb. Optim., 2016

A joint optimization of data ferry trajectories and communication powers of ground sensors for long-term environmental monitoring.
J. Comb. Optim., 2016

Algorithms for randomized time-varying knapsack problems.
J. Comb. Optim., 2016

Group Testing with Multiple Inhibitor Sets and Error-Tolerant and Its Decoding Algorithms.
J. Comput. Biol., 2016

Minimum (k, ω)-angle barrier coverage in wireless camera sensor networks.
Int. J. Sens. Networks, 2016

Precautionary rumor containment via trustworthy people in social networks.
Discret. Math. Algorithms Appl., 2016

Terminal-set-enhanced community detection in social networks.
Proceedings of the 35th Annual IEEE International Conference on Computer Communications, 2016

Efficient scheduling algorithms for on-demand wireless data broadcast.
Proceedings of the 35th Annual IEEE International Conference on Computer Communications, 2016

2015
A Double-Auction-Based Mechanism to Stimulate Secondary Users for Cooperative Sensing in Cognitive Radio Networks.
IEEE Trans. Veh. Technol., 2015

Better approximation algorithms for influence maximization in online social networks.
J. Comb. Optim., 2015

PTAS for routing-cost constrained minimum connected dominating set in growth bounded graphs.
J. Comb. Optim., 2015

Loyalty improvement beyond the seeds in social networks.
J. Comb. Optim., 2015

Strongly connected dominating and absorbing set in directed disk graph.
Int. J. Sens. Networks, 2015

Conflict-free many-to-one data aggregation in multi-channel multi-hop wireless networks.
Int. J. Sens. Networks, 2015

Fault-tolerant coverage with maximum lifetime in wireless sensor networks.
Proceedings of the 2015 IEEE Conference on Computer Communications, 2015

An Algorithm for Friendship Prediction on Location-Based Social Networks.
Proceedings of the Computational Social Networks - 4th International Conference, 2015

2014
Data Retrieval Scheduling for Multi-Item Requests in Multi-Channel WirelessBroadcast Environments.
IEEE Trans. Mob. Comput., 2014

Minimum Latency Multiple Data MULETrajectory Planning in Wireless Sensor Networks.
IEEE Trans. Mob. Comput., 2014

Mutual-Relationship-Based Community Partitioning for Social Networks.
IEEE Trans. Emerg. Top. Comput., 2014

Mining hidden links in social networks to achieve equilibrium.
Theor. Comput. Sci., 2014

A novel approach to online social influence maximization.
Soc. Netw. Anal. Min., 2014

Maximizing rumor containment in social networks with constrained time.
Soc. Netw. Anal. Min., 2014

Evaluation and comparison of various indexing schemes in single-channel broadcast communication environment.
Knowl. Inf. Syst., 2014

Minimum vertex cover in ball graphs through local search.
J. Glob. Optim., 2014

Minimum total coloring of planar graph.
J. Glob. Optim., 2014

A greedy algorithm for the fault-tolerant connected dominating set in a general graph.
J. Comb. Optim., 2014

A short-term trend prediction model of topic over Sina Weibo dataset.
J. Comb. Optim., 2014

Minimum number of disjoint linear forests covering a planar graph.
J. Comb. Optim., 2014

Noise-tolerance community detection and evolution in dynamic social networks.
J. Comb. Optim., 2014

Improvement of path analysis algorithm in social networks based on HBase.
J. Comb. Optim., 2014

An individual-based model of information diffusion combining friends' influence.
J. Comb. Optim., 2014

A nature-inspired influence propagation model for the community expansion problem.
J. Comb. Optim., 2014

Dominating problems in swapped networks.
Inf. Sci., 2014

Clustering and Indexing Schemes for Wireless Data Broadcasting.
Int. J. Comput. Their Appl., 2014

Guest Editorial: Special Issue from ISCA's 2013 Fall Conference Cluster.
Int. J. Comput. Their Appl., 2014

An efficient routing protocol based on consecutive forwarding prediction in delay tolerant networks.
Int. J. Sens. Networks, 2014

Social Network Rumors Spread Model Based on Cellular Automata.
Proceedings of the 10th International Conference on Mobile Ad-hoc and Sensor Networks, 2014

On the Maximum Directional Target Coverage Problem in Wireless Sensor Networks.
Proceedings of the 10th International Conference on Mobile Ad-hoc and Sensor Networks, 2014

Minimizing the Access Time of Multi-item Requests in Wireless Data Broadcast Environments.
Proceedings of the 10th International Conference on Mobile Ad-hoc and Sensor Networks, 2014

A Survey of Research Fields for Social Network and Corresponding Techniques.
Proceedings of the 10th International Conference on Mobile Ad-hoc and Sensor Networks, 2014

An approximation algorithm for client assignment in client/server systems.
Proceedings of the 2014 IEEE Conference on Computer Communications, 2014

Minimizing makespan and total completion time in MapReduce-like systems.
Proceedings of the 2014 IEEE Conference on Computer Communications, 2014

Mining the Key Structure of the Information Diffusion Network.
Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

Approximation Algorithm for the Balanced 2-Connected Bipartition Problem.
Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

2013
CDS-Based Virtual Backbone Construction with Guaranteed Routing Cost in Wireless Sensor Networks.
IEEE Trans. Parallel Distributed Syst., 2013

On Construction of Quality Fault-Tolerant Virtual Backbone in Wireless Networks.
IEEE/ACM Trans. Netw., 2013

Algebraic data retrieval algorithms for multi-channel wireless data broadcast.
Theor. Comput. Sci., 2013

Optimal Data Retrieval Scheduling in the Multichannel Wireless Broadcast Environments.
IEEE Trans. Computers, 2013

A Routing Protocol based on Temporal-awareness Ordered-MPR for Dynamic Wireless Multi-hop Mobile Networks.
J. Networks, 2013

Max-min weight balanced connected partition.
J. Glob. Optim., 2013

PTAS for the minimum k-path connected vertex cover problem in unit disk graphs.
J. Glob. Optim., 2013

Constant-approximation for optimal data aggregation with physical interference.
J. Glob. Optim., 2013

Maximum lifetime connected coverage with two active-phase sensors.
J. Glob. Optim., 2013

On bounding node-to-sink latency in wireless sensor networks with multiple sinks.
Int. J. Sens. Networks, 2013

Universal learning using free multivariate splines.
Neurocomputing, 2013

The Maximum Community Partition Problem in Networks.
Discret. Math. Algorithms Appl., 2013

High performance energy efficient multi-channel wireless data broadcasting system.
Proceedings of the 2013 IEEE Wireless Communications and Networking Conference (WCNC), 2013

SmartPrint: A Cloud Print System for Office.
Proceedings of the IEEE 9th International Conference on Mobile Ad-hoc and Sensor Networks, 2013

Approximations for Minimum Connected Sensor Cover.
Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013

Influence and Profit: Two Sides of the Coin.
Proceedings of the 2013 IEEE 13th International Conference on Data Mining, 2013

CSI: Charged System Influence Model for Human Behavior Prediction.
Proceedings of the 2013 IEEE 13th International Conference on Data Mining, 2013

Least Cost Rumor Blocking in Social Networks.
Proceedings of the IEEE 33rd International Conference on Distributed Computing Systems, 2013

Energy-efficient IPTV simulcast over fixed WiMAX access systems.
Proceedings of the International Conference on Computing, Networking and Communications, 2013

Community Expansion in Social Network.
Proceedings of the Database Systems for Advanced Applications, 2013

A Short-Term Prediction Model of Topic Popularity on Microblogs.
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

Neighborhood-Based Dynamic Community Detection with Graph Transform for 0-1 Observed Networks.
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

Social Network Path Analysis Based on HBase.
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

A New Model for Product Adoption over Social Networks.
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

Community Expansion Model Based on Charged System Theory.
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

A Nash Equilibrium Based Algorithm for Mining Hidden Links in Social Networks.
Proceedings of the Combinatorial Optimization and Applications, 2013

2012
Efficient Virtual Backbone Construction with Routing Cost Constraint in Wireless Networks Using Directional Antennas.
IEEE Trans. Mob. Comput., 2012

Preface.
Theor. Comput. Sci., 2012

Positive influence dominating sets in power-law graphs.
Soc. Netw. Anal. Min., 2012

An efficient approximation for minimum energy broadcast in multi-channel multi-hop wireless network with directional antennas.
Optim. Lett., 2012

Complexity and approximation of the connected set-cover problem.
J. Glob. Optim., 2012

PTAS for the minimum weighted dominating set in growth bounded graphs.
J. Glob. Optim., 2012

A PTAS for the minimum weighted dominating set problem with smooth weights on unit disk graphs.
J. Comb. Optim., 2012

The complexity of influence maximization problem in the deterministic linear threshold model.
J. Comb. Optim., 2012

Constructing weakly connected dominating set for secure clustering in distributed sensor network.
J. Comb. Optim., 2012

Constructing minimum interference connected dominating set for multi-channel multi-radio multi-hop wireless network.
Int. J. Sens. Networks, 2012

A constant-factor approximation for d-hop connected dominating sets in unit disk graph.
Int. J. Sens. Networks, 2012

A New Proof for Zassenhaus-Groemer-Oler inequality.
Discret. Math. Algorithms Appl., 2012

Minimum Total Communication Power Connected Dominating Set in Wireless Networks.
Proceedings of the Wireless Algorithms, Systems, and Applications, 2012

Efficient data retrieval scheduling for multi-channel wireless data broadcast.
Proceedings of the IEEE INFOCOM 2012, Orlando, FL, USA, March 25-30, 2012, 2012

Minimizing data collection latency in wireless sensor network with multiple mobile elements.
Proceedings of the IEEE INFOCOM 2012, Orlando, FL, USA, March 25-30, 2012, 2012

Constant-approximation for target coverage problem in wireless sensor networks.
Proceedings of the IEEE INFOCOM 2012, Orlando, FL, USA, March 25-30, 2012, 2012

A Novel Multi-Channel Data Broadcast Scheme for Multimedia Database Systems.
Proceedings of the 18th IEEE International Conference on Parallel and Distributed Systems, 2012

2011
Efficient Algorithms for Topology Control Problem with Routing Cost Constraints in Wireless Networks.
IEEE Trans. Parallel Distributed Syst., 2011

Minimum Data-Latency-Bound $k$-Sink Placement Problem in Wireless Sensor Networks.
IEEE/ACM Trans. Netw., 2011

New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs.
Theor. Comput. Sci., 2011

DNA library screening, pooling design and unitary spaces.
Theor. Comput. Sci., 2011

An exact algorithm for minimum CDS with shortest path constraint in wireless networks.
Optim. Lett., 2011

Efficient Impairment-Constrained 3R Regenerator Placement for Light-Trees in Optical Networks.
JOCN, 2011

Approaching pooling design with smaller efficient ratio.
J. Glob. Optim., 2011

On minimum submodular cover with submodular cost.
J. Glob. Optim., 2011

Efficient algorithms for supergraph query processing on graph databases.
J. Comb. Optim., 2011

On Characteristic Area of Steiner Tree.
Discret. Math. Algorithms Appl., 2011

On the Steiner Ratio in.
Discret. Math. Algorithms Appl., 2011

Constant approximation for virtual backbone construction with Guaranteed Routing Cost in wireless sensor networks.
Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

Construction of directional virtual backbones with minimum routing cost in wireless networks.
Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

Energy-efficient roadside unit scheduling for maintaining connectivity in vehicle ad-hoc network.
Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication, 2011

Approximation and Inapproximation for the Influence Maximization Problem in Social Networks under Deterministic Linear Threshold Model.
Proceedings of the 31st IEEE International Conference on Distributed Computing Systems Workshops (ICDCS 2011 Workshops), 2011

Conflict-Free Many-to-One Data Aggregation Scheduling in Multi-Channel Multi-Hop Wireless Sensor Networks.
Proceedings of IEEE International Conference on Communications, 2011

Energy-Efficient Tree-Based Indexing Schemes for Information Retrieval in Wireless Data Broadcast.
Proceedings of the Database Systems for Advanced Applications, 2011

A Novel Hash-Based Streaming Scheme for Energy Efficient Full-Text Search in Wireless Data Broadcast.
Proceedings of the Database Systems for Advanced Applications, 2011

Algebraic Algorithm for Scheduling Data Retrieval in Multi-channel Wireless Data Broadcast Environments.
Proceedings of the Combinatorial Optimization and Applications, 2011

2010
A Better Approximation Algorithm for Computing Connected Dominating Sets in Unit Ball Graphs.
IEEE Trans. Mob. Comput., 2010

Approximations for node-weighted Steiner tree in unit disk graphs.
Optim. Lett., 2010

Wireless networking, dominating and packing.
Optim. Lett., 2010

Minimum average routing path clustering problem in multi-hop 2-D underwater sensor networks.
Optim. Lett., 2010

A PTAS for minimum <i>d</i>-hop connected dominating set in growth-bounded graphs.
Optim. Lett., 2010

On dual power assignment optimization for biconnectivity.
J. Comb. Optim., 2010

Hardness of <i>k</i>-Vertex-Connected Subgraph Augmentation Problem.
J. Comb. Optim., 2010

Two constructions of new error-correcting pooling designs from orthogonal spaces over a finite field of characteristic 2.
J. Comb. Optim., 2010

Constructing error-correcting pooling designs with symplectic space.
J. Comb. Optim., 2010

Efficient Error-Correcting Pooling Designs Constructed from Pseudo-Symplectic Spaces Over a Finite Field.
J. Comput. Biol., 2010

New algebraic constructions for pooling design in DNA library screening.
Int. J. Bioinform. Res. Appl., 2010

An efficient approximation for minimum latency broadcast in multi-channel multi-hop wireless networks.
IEEE Commun. Lett., 2010

Fast Information Propagation in Social Networks.
Discret. Math. Algorithms Appl., 2010

Greedy approximations for minimum submodular cover with submodular cost.
Comput. Optim. Appl., 2010

A Better Constant-Factor Approximation for Selected-Internal Steiner Minimum Tree.
Algorithmica, 2010

Construction of Virtual Backbone with Multiple Factors Constraints in Wireless Ad-hoc Network.
Ad Hoc Sens. Wirel. Networks, 2010

A New Constant Factor Approximation for Computing 3-Connected m-Dominating Sets in Homogeneous Wireless Networks.
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks.
Proceedings of the 2010 International Conference on Distributed Computing Systems, 2010

Efficient Parallel Data Retrieval Protocols with MIMO Antennae for Data Broadcast in 4G Wireless Communications.
Proceedings of the Database and Expert Systems Applications, 21th International Conference, 2010

2009
Rosen's Method, Global Convergence, and Powell's Conjecture.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

History of Optimization.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Projected Clustering for Biological Data Analysis.
Proceedings of the Encyclopedia of Data Warehousing and Mining, Second Edition (4 Volumes), 2009

PTAS for connected vertex cover in unit disk graphs.
Theor. Comput. Sci., 2009

Algorithms for connected set cover problem and fault-tolerant connected set cover problem.
Theor. Comput. Sci., 2009

Construction of strongly connected dominating sets in asymmetric multihop wireless networks.
Theor. Comput. Sci., 2009

Optimization scheme for sensor coverage scheduling with bandwidth constraints.
Optim. Lett., 2009

Optimal placements of replicas in a ring network with majority voting protocol.
J. Parallel Distributed Comput., 2009

A PTAS for minimum connected dominating set in 3-dimensional Wireless sensor networks.
J. Glob. Optim., 2009

Node-weighted Steiner tree approximation in unit disk graphs.
J. Comb. Optim., 2009

A better constant-factor approximation for weighted dominating set in unit disk graph.
J. Comb. Optim., 2009

Handling inheritance violation for secure interoperation of heterogeneous systems.
Int. J. Secur. Networks, 2009

Improving cell broadcasting scheme to support multi-lingual service in wireless networks.
IEEE Commun. Lett., 2009

Efficient Distributed Algorithms for Topology Control Problem with Shortest Path Constraints.
Discret. Math. Algorithms Appl., 2009

A Better Approximation for Minimum Average Routing Path Clustering Problem in 2-d Underwater Sensor Networks.
Discret. Math. Algorithms Appl., 2009

A PTAS for Minimum d-Hop Underwater Sink Placement Problem in 2-d Underwater Sensor Networks.
Discret. Math. Algorithms Appl., 2009

A Construction of Cartesian Authentication Code from Orthogonal Spaces over a Finite Field of odd Characteristic.
Discret. Math. Algorithms Appl., 2009

Error-Tolerant Trivial Two-Stage Group Testing for complexes Using Almost Separable and Almost Disjunct Matrices.
Discret. Math. Algorithms Appl., 2009

Analysis on Theoretical Bounds for Approximating Dominating Set Problems.
Discret. Math. Algorithms Appl., 2009

Latency-Bounded Minimum Influential Node Selection in Social Networks.
Proceedings of the Wireless Algorithms, 2009

Multi-focal learning and its application to customer service support.
Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Paris, France, June 28, 2009

Three Approximation Algorithms for Energy-Efficient Query Dissemination in Sensor Database System.
Proceedings of the Database and Expert Systems Applications, 20th International Conference, 2009

A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2009

2008
Greedy Approximation Algorithms.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Steiner Trees.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Adaptive Partitions.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

On approximate optimal dual power assignment for biconnectivity and edge-biconnectivity.
Theor. Comput. Sci., 2008

Lower bounds and new constructions on secure group communication schemes.
Theor. Comput. Sci., 2008

On the complexity of non-unique probe selection.
Theor. Comput. Sci., 2008

Improved construction for pooling design.
J. Comb. Optim., 2008

Construction of Minimum Connected Dominating Set in 3-Dimensional Wireless Network.
Proceedings of the Wireless Algorithms, 2008

Composite Spatio-Temporal Co-occurrence Pattern Mining.
Proceedings of the Wireless Algorithms, 2008

PTAS for Minimum Connected Dominating Set in Unit Ball Graph.
Proceedings of the Wireless Algorithms, 2008

A Better Theoretical Bound to Approximate Connected Dominating Set in Unit Disk Graph.
Proceedings of the Wireless Algorithms, 2008

Recyclable Connected Dominating Set for Large Scale Dynamic Wireless Networks.
Proceedings of the Wireless Algorithms, 2008

Analysis of greedy approximations with nonsubmodular potential functions.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Trade-off scheme for fault tolerant connected dominating sets on size and diameter.
Proceedings of the 1st ACM International Workshop on Foundations of Wireless Ad Hoc and Sensor Networking and Computing, 2008

Minimum Power Strongly Connected Dominating Sets in Wireless Networks.
Proceedings of the 2008 International Conference on Wireless Networks, 2008

Optimal Placements in Ring Network for Data Replicas in Distributed Database with MajorityVoting Protocol.
Proceedings of the 28th IEEE International Conference on Distributed Computing Systems (ICDCS 2008), 2008

(1+rho)-Approximation for Selected-Internal Steiner Minimum Tree.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

(6+epsilon)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2008

Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph.
Proceedings of the Combinatorial Optimization and Applications, 2008

Effective Spatio-temporal Analysis of Remote Sensing Data.
Proceedings of the Progress in WWW Research and Development, 2008

2007
Approximations for Steiner Minimum Trees.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Coverage breach problems in bandwidth-constrained sensor networks.
ACM Trans. Sens. Networks, 2007

Localized Outlying and Boundary Data Detection in Sensor Networks.
IEEE Trans. Knowl. Data Eng., 2007

Non-unique probe selection and group testing.
Theor. Comput. Sci., 2007

Mining maximal hyperclique pattern: A hybrid search strategy.
Inf. Sci., 2007

Decoding algorithms in pooling designs with inhibitors and error-tolerance.
Int. J. Bioinform. Res. Appl., 2007

A dominating and absorbent set in a wireless ad-hoc network with different transmission ranges.
Proceedings of the 8th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2007

Minimum Coverage Breach and Maximum Network Lifetime in Wireless Sensor Networks.
Proceedings of the Global Communications Conference, 2007

A Non-Unique Probes Selection Algorithm Using d-Disjunct Matrix.
Proceedings of the International Conference on Bioinformatics & Computational Biology, 2007

2006
Energy-efficient broadcast and multicast routing in multihop <i>ad hoc</i> wireless <i>networks</i>.
Wirel. Commun. Mob. Comput., 2006

New Algorithm for Computing Cube on Very Large Compressed Data Sets.
IEEE Trans. Knowl. Data Eng., 2006

Minimum connected dominating sets and maximal independent sets in unit disk graphs.
Theor. Comput. Sci., 2006

Improving Construction for Connected Dominating Set with Steiner Tree in Wireless Sensor Networks.
J. Glob. Optim., 2006

Construction of <i>d(H)</i>-disjunct matrix for group testing in hypergraphs.
J. Comb. Optim., 2006

New Construction for Transversal Design.
J. Comput. Biol., 2006

A Robust on-Demand Path-Key Establishment Framework via Random Key Predistribution for Wireless Sensor Networks.
EURASIP J. Wirel. Commun. Netw., 2006

On error-tolerant DNA screening.
Discret. Appl. Math., 2006

A Projected Clustering Algorithm in High Dimensional Space.
Proceedings of the 15th International Conference on Software Engineering and Data Engineering (SEDE-2006), 2006

Mining Quantitative Maximal Hyperclique Patterns: A Summary of Results.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2006

2005
Optimal topology control for balanced energy consumption in wireless networks.
J. Parallel Distributed Comput., 2005

Broadcast Routing with Minimum Wavelength Conversion in WDM Optical Networks.
J. Comb. Optim., 2005

An Approximation for Minimum Multicast Route in Optical Networks with Nonsplitting Nodes.
J. Comb. Optim., 2005

Protein-protein interaction and group testing in bipartite graphs.
Int. J. Bioinform. Res. Appl., 2005

Achieving minimum coverage breach under bandwidth constraints in wireless sensor networks.
Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

Energy-efficient target coverage in wireless sensor networks.
Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

2004
A greedy approximation for minimum connected dominating sets.
Theor. Comput. Sci., 2004

Coloring of Double Disk Graphs.
J. Glob. Optim., 2004

Automatic image annotation and retrieval using weighted feature selection.
Proceedings of the Sixth IEEE International Symposium on Multimedia Software Engineering, 2004

A Hybrid Approach for Mining Maixmal Hyperclique Patterns.
Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2004), 2004

Mining Dynamic Interdimension Association Rules for Local-Scale Weather Prediction.
Proceedings of the 28th International Computer Software and Applications Conference (COMPSAC 2004), 2004

Evaluating GML Support for Spatial Databases.
Proceedings of the 28th International Computer Software and Applications Conference (COMPSAC 2004), 2004

2003
Super link-connectivity of iterated line digraphs.
Theor. Comput. Sci., 2003

A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks.
Networks, 2003

Decoding in Pooling Designs.
J. Comb. Optim., 2003

DNA Screening, Pooling Design and Simplicial Complex.
J. Comb. Optim., 2003

Placement of Web-Server Proxies with Consideration of Read and Update Operations on the Internet.
Comput. J., 2003

2002
Spatial contextual classification and prediction models for mining geospatial data.
IEEE Trans. Multim., 2002

A Comparison of Markov Random Field and Spatial Regression Models for Mining Geospatial Data.
Proceedings of the 6th Joint Conference on Information Science, 2002

2001
Optimal placement of data replicas in distributed database with majority voting protocol.
Theor. Comput. Sci., 2001

Modeling Spatial Dependencies for Mining Geospatial Data.
Proceedings of the First SIAM International Conference on Data Mining, 2001

2000
Predicting Locations Using Map Similarity(PLUMS): A Framework for Spatial Data Mining.
Proceedings of the International Workshop on Multimedia Data Mining, 2000

Extending Data Mining for Spatial Applications: A Case Study in Predicting Nest Locations.
Proceedings of the 2000 ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, 2000

1999
Nontrivial Monotone Weakly Symmetric Boolean Functions with Six Variables are Elusive.
Theor. Comput. Sci., 1999

The Rivest-Vuillemin Conjecture on Monotone Boolean Functions Is True for Ten Variables.
J. Complex., 1999

1998
Approximations for Subset Interconnection Designs.
Theor. Comput. Sci., 1998

Super line-connectivity of consecutive-d digraphs.
Discret. Math., 1998

1997
A Special Case for Subset Interconnection Designs.
Discret. Appl. Math., 1997

On 3-rate rearrangeability of Clos networks.
Proceedings of the Advances in Switching Networks, 1997


  Loading...