Hongmin W. Du

According to our database, Hongmin W. Du authored at least 11 papers between 2015 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

New approximations for monotone submodular maximization with knapsack constraint.

Hongmin W. Du, Xiang Li, Guanghua Wang

J. Comb. Optim., November, 2024

Adaptive Influence Maximization: Adaptability via Nonadaptability.

Hongmin W. Du, Yingfan L. Du, Zhao Zhang

INFORMS J. Comput., 2024

Systematic Review of Cybersecurity Disclosure Research.

Hongmin W. Du, Jiahui Xu, Miklos A. Vasarhelyi

Proceedings of the Algorithmic Aspects in Information and Management, 2024

2023

Streaming submodular maximization under d-knapsack constraints.

Zihan Chen, Bin Liu, Hongmin W. Du

J. Comb. Optim., 2023

Machine Learning with Low-Resource Data from Psychiatric Clinics.

Hongmin W. Du, Neil De Chen, Xiao Li, Miklos A. Vasarhelyi

Proceedings of the Combinatorial Optimization and Applications, 2023

2022

Multi-attribute based influence maximization in social networks: Algorithms and analysis.

Qiufen Ni, Jianxiong Guo, Hongmin W. Du, Huan Wang

Theor. Comput. Sci., 2022

Constant Approximation for the Lifetime Scheduling Problem of <i>p</i>-Percent Coverage.

Zhao Zhang, Wei Liang, Hongmin W. Du, Siwen Liu

INFORMS J. Comput., 2022

2021

Constant-approximation for minimum weight partial sensor cover.

Siwen Liu, Hongmin W. Du

Discret. Math. Algorithms Appl., 2021

Multi-attribute Based Influence Maximization in Social Networks.

Qiufen Ni, Jianxiong Guo, Hongmin W. Du

Proceedings of the Algorithmic Aspects in Information and Management, 2021

Streaming Algorithms for Maximizing DR-Submodular Functions with d-Knapsack Constraints.

Bin Liu, Zihan Chen, Hongmin W. Du

Proceedings of the Algorithmic Aspects in Information and Management, 2021

2015

A new bound on maximum independent set and minimum connected dominating set in unit disk graphs.

Yingfan L. Du, Hongmin W. Du

J. Comb. Optim., 2015