An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines. - Q. Q. Nong; T. C. Edwin Cheng; C. T. Ng 001 (Oper. Res. Lett., 2008)

The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan. - Q. Q. Nong; C. T. Ng 001; T. C. Edwin Cheng (Oper. Res. Lett., 2008)

The weighted link ring loading problem. - Qingqin Nong; Jinjiang Yuan; Yixun Lin (J. Comb. Optim., 2009)

A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting. - Q. Q. Nong; T. C. Edwin Cheng; C. T. Ng 001 (Theor. Comput. Sci., 2010)

Two-agent scheduling to minimize the total cost. - Q. Q. Nong; T. C. E. Cheng; C. T. Ng 001 (Eur. J. Oper. Res., 2011)

Centralized and decentralized rumor blocking problems. - Xin Chen; Qingqin Nong; Yan Feng; Yongchang Cao; Suning Gong; Qizhi Fang; Ker-I Ko (J. Comb. Optim., 2017)

A coordination mechanism for a scheduling game with parallel-batching machines. - Qingqin Nong; G. Q. Fan; Qizhi Fang (J. Comb. Optim., 2017)

A Coordination Mechanism for a Scheduling Game with Uniform-Batching Machines. - Guoqiang Fan; Qingqin Nong (Asia Pac. J. Oper. Res., 2018)

Bin packing game with a price of anarchy of 3/2. - Qingqin Nong; Tao Sun; T. C. E. Cheng; Qizhi Fang (J. Comb. Optim., 2018)

A bin packing game with cardinality constraints under the best cost rule. - Qingqin Nong; Jiapeng Wang; Suning Gong; Saijun Guo (Discret. Math. Algorithms Appl., 2019)

Parametric monotone function maximization with matroid constraints. - Suning Gong; Qingqin Nong; Wenjing Liu; Qizhi Fang (J. Glob. Optim., 2019)

A Survey on Double Greedy Algorithms for Maximizing Non-monotone Submodular Functions. - Qingqin Nong; Suning Gong; Qizhi Fang; Ding-Zhu Du (Complexity and Approximation, 2020)

Facility location game with envy ratio. - Yuan Ding 006; Wenjing Liu; Xin Chen; Qizhi Fang; Qingqin Nong (Comput. Ind. Eng., 2020)

A 1/2-approximation algorithm for maximizing a non-monotone weak-submodular function on a bounded integer lattice. - Qingqin Nong; Jiazhu Fang; Suning Gong; Ding-Zhu Du; Yan Feng; Xiaoying Qu (J. Comb. Optim., 2020)

General Rumor Blocking: An efficient random algorithm with martingale approach. - Qizhi Fang; Xin Chen; Qingqin Nong; Zongchao Zhang; Yongchang Cao; Yan Feng; Tao Sun; Suning Gong; Ding-Zhu Du (Theor. Comput. Sci., 2020)

A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function. - Qingqin Nong; Jiazhu Fang; Suning Gong; Yan Feng; Xiaoying Qu (Theor. Comput. Sci., 2020)

The Price of Anarchy of Generic Valid Utility Systems. - Yin Yang; Qingqin Nong; Suning Gong; Jingwen Du; Yumei Liang (COCOA, 2021)

An improved mechanism for selfish bin packing. - Xin Chen; Qingqin Nong; Qizhi Fang (J. Comb. Optim., 2021)

Maximize a monotone function with a generic submodularity ratio. - Suning Gong; Qingqin Nong; Tao Sun; Qizhi Fang; Ding-Zhu Du; Xiaoyu Shao (Theor. Comput. Sci., 2021)

Multiple facility location games with envy ratio. - Wenjing Liu; Yuan Ding 006; Xin Chen; Qizhi Fang; Qingqin Nong (Theor. Comput. Sci., 2021)

Constrained Heterogeneous Two-Facility Location Games with Max-Variant Cost. - Qi Zhao; Wenjing Liu; Qizhi Fang; Qingqin Nong (FAW, 2022)

Strategyproof mechanisms for 2-facility location games with minimax envy. - Xin Chen; Qizhi Fang; Wenjing Liu; Yuan Ding 006; Qingqin Nong (J. Comb. Optim., 2022)

Bounding quality of pure Nash equilibria in dual-role facility location games. - Xin Chen; Wenjing Liu; Qingqin Nong; Qizhi Fang (J. Comb. Optim., 2022)

Regularized Submodular Maximization With a k-Matroid Intersection Constraint. - Qingqin Nong; Zhijia Guo; Suning Gong (IEEE Access, 2023)

A fast and deterministic algorithm for Knapsack-constrained monotone DR-submodular maximization over an integer lattice. - Suning Gong; Qingqin Nong; Shuyu Bao; Qizhi Fang; Ding-Zhu Du (J. Glob. Optim., 2023)

Uncertainty in Study of Social Networks: Robust Optimization and Machine Learning. - Suning Gong; Qingqin Nong; Han Xiao 003; Ding-Zhu Du (Asia Pac. J. Oper. Res., 2023)

Preface. - Qingqin Nong; Chenchen Wu; Dachuan Xu; Dongmei Zhang 002 (Asia Pac. J. Oper. Res., 2023)

Constrained heterogeneous facility location games with max-variant cost. - Qi Zhao; Wenjing Liu; Qingqin Nong; Qizhi Fang (J. Comb. Optim., 2023)

Maximize Liquid Welfare in Combinatorial Auctions with Monotone Valuations. - Jiwen Chen; Qingqin Nong; Yuanyuan Wang; Wenjing Liu (Asia Pac. J. Oper. Res., 2023)

Maximize an Approximate k-submodular Function under a Knapsack Constraint. - Fanqing Meng; Qingqin Nong; Suning Gong; Xiaoying Qu (COCOA (1), 2024)

Finding Fair and Efficient Allocations Under Budget Constraints. - Yuanyuan Wang; Xin Chen; Qizhi Fang; Qingqin Nong; Wenjing Liu (IJTCS-FAW, 2024)

Mechanism Design with Predictions for Facility Location Games with Candidate Locations. - Jiazhu Fang; Qizhi Fang; Wenjing Liu; Qingqin Nong (TAMC, 2024)

The Fairness of Maximum Nash Social Welfare Under Matroid Constraints and Beyond. - Yuanyuan Wang; Xin Chen; Qingqin Nong (CoRR, 2024)

Algorithms for Cardinality-Constrained Monotone DR-Submodular Maximization with Low Adaptivity and Query Complexity. - Suning Gong; Qingqin Nong; Jiazhu Fang; Ding-Zhu Du (J. Optim. Theory Appl., 2024)

Constrained heterogeneous two-facility location games with sum-variant. - Qi Zhao; Wenjing Liu; Qingqin Nong; Qizhi Fang (J. Comb. Optim., 2024)

Budget-constrained profit maximization without non-negative objective assumption in social networks. - Suning Gong; Qingqin Nong; Yue Wang; Dingzhu Du (J. Glob. Optim., 2024)

Approximation algorithm and mechanism design for bisubmodular welfare maximization problem. - Yuanyuan Wang; Qingqin Nong; Wenjing Liu; Qizhi Fang (Theor. Comput. Sci., 2025)

Guaranteeing fairness and efficiency under budget constraints. - Yuanyuan Wang; Xin Chen; Qizhi Fang; Qingqin Nong; Wenjing Liu (J. Comb. Optim., 2025)

Mechanism Design with Predictions for Facility Location Games with Candidate Locations. - Jiazhu Fang; Qizhi Fang; Wenjing Liu; Qingqin Nong; Alexandros A. Voudouris (J. Comb. Optim., 2025)

Approximate Cores of Submodular Cost Set Cover Games. - Qingqin Nong; Jingyu Yao; Xin Qin; Suning Gong; Qizhi Fang (J. Optim. Theory Appl., 2025)