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)

Streaming Algorithms for Maximizing DR-Submodular Functions with d-Knapsack Constraints. - Bin Liu 009; Zihan Chen; Hongmin W. Du (AAIM, 2021)

Multi-attribute Based Influence Maximization in Social Networks. - Qiufen Ni; Jianxiong Guo; Hongmin W. Du (AAIM, 2021)

Constant-approximation for minimum weight partial sensor cover. - Siwen Liu; Hongmin W. Du (Discret. Math. Algorithms Appl., 2021)

Constant Approximation for the Lifetime Scheduling Problem of p-Percent Coverage. - Zhao Zhang 002; Wei Liang; Hongmin W. Du; Siwen Liu (INFORMS J. Comput., 2022)

Multi-attribute based influence maximization in social networks: Algorithms and analysis. - Qiufen Ni; Jianxiong Guo; Hongmin W. Du; Huan Wang 005 (Theor. Comput. Sci., 2022)

Machine Learning with Low-Resource Data from Psychiatric Clinics. - Hongmin W. Du; Neil De Chen; Xiao Li 027; Miklos A. Vasarhelyi (COCOA (2), 2023)

Streaming submodular maximization under d-knapsack constraints. - Zihan Chen; Bin Liu 009; Hongmin W. Du (J. Comb. Optim., 2023)

Systematic Review of Cybersecurity Disclosure Research. - Hongmin W. Du; Jiahui Xu; Miklos A. Vasarhelyi (AAIM (1), 2024)

Adaptive Influence Maximization: Adaptability via Nonadaptability. - Hongmin W. Du; Yingfan L. Du; Zhao Zhang 002 (INFORMS J. Comput., 2024)

New approximations for monotone submodular maximization with knapsack constraint. - Hongmin W. Du; Xiang Li 016; Guanghua Wang (J. Comb. Optim., 2024)