List edge and list total colorings of planar graphs without short cycles. - Bin Liu 009; Jianfeng Hou; Guizhen Liu (Inf. Process. Lett., 2008)

Total colorings and list total colorings of planar graphs without intersecting 4-cycles. - Bin Liu 009; Jianfeng Hou; Jianliang Wu 001; Guizhen Liu (Discret. Math., 2009)

Acyclic edge coloring of planar graphs with large girth. - Dongxiao Yu; Jianfeng Hou; Guizhen Liu; Bin Liu 009; Lan Xu (Theor. Comput. Sci., 2009)

Vertex-Distinguishing Edge Colorings of Graphs with Degree Sum Conditions. - Bin Liu 009; Guizhen Liu (Graphs Comb., 2010)

Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles. - Jianfeng Hou; Bin Liu 009; Guizhen Liu; Jihui Wang (Int. J. Comput. Math., 2010)

On the adjacent vertex distinguishing edge colourings of graphs. - Bin Liu 009; Guizhen Liu (Int. J. Comput. Math., 2010)

Acyclic edge chromatic number of outerplanar graphs. - Jianfeng Hou; Jianliang Wu 001; Guizhen Liu; Bin Liu 009 (J. Graph Theory, 2010)

On edge cover coloring of join graphs. - Jinbo Li; Guizhen Liu; Bin Liu 009 (Ars Comb., 2011)

Total coloring of planar graphs without 6-cycles. - Jianfeng Hou; Bin Liu 009; Guizhen Liu; Jianliang Wu 001 (Discret. Appl. Math., 2011)

Circular Coloring of Planar Digraphs. - Guanghui Wang 002; Bin Liu 009; Jiguo Yu; Guizhen Liu (Graphs Comb., 2012)

On the linear arboricity of graphs embeddable in surfaces. - Huijuan Wang; Jianliang Wu 001; Bin Liu 009; Hongyu Chen (Inf. Process. Lett., 2014)

Total coloring of embedded graphs with maximum degree at least seven. - Huijuan Wang; Bin Liu 009; Jianliang Wu 001; Guizhen Liu (Theor. Comput. Sci., 2014)

Total Coloring of Planar Graphs Without Chordal Short Cycles. - Huijuan Wang; Bin Liu 009; Jianliang Wu 001 (Graphs Comb., 2015)

List edge and list total coloring of planar graphs with maximum degree 8. - Huijuan Wang; Bin Liu 009; Xin Zhang 017; Lidong Wu; Weili Wu 001; Hongwei Gao (J. Comb. Optim., 2016)

A note on the minimum number of choosability of planar graphs. - Huijuan Wang; Lidong Wu; Xin Zhang 017; Weili Wu 001; Bin Liu 009 (J. Comb. Optim., 2016)

Total coloring of planar graphs without adjacent short cycles. - Huijuan Wang; Bin Liu 009; Yan Gu 007; Xin Zhang 017; Weili Wu 001; Hongwei Gao (J. Comb. Optim., 2017)

Total coloring of planar graphs without adjacent chordal 6-cycles. - Huijuan Wang; Bin Liu 009; Xiaoli Wang; Guangmo Tong; Weili Wu 001; Hongwei Gao (J. Comb. Optim., 2017)

Minimum choosability of planar graphs. - Huijuan Wang; Bin Liu 009; Ling Gai; Hongwei Du 001; Jianliang Wu 001 (J. Comb. Optim., 2018)

Optimal channel assignment and L(p, 1)-labeling. - Junlei Zhu; Yuehua Bu; Panayote M. Pardalos; Hongwei Du 001; Huijuan Wang; Bin Liu 009 (J. Glob. Optim., 2018)

Social Structure Decomposition With Security Issue. - Wenshun Teng; Huijuan Wang; Hongling Chen; Bin Liu 009 (IEEE Access, 2019)

Maximizing profit of multiple adoptions in social networks with a martingale approach. - Bin Liu 009; Yuxia Yan; Qizhi Fang; Junyu Dong; Weili Wu 001; Huijuan Wang (J. Comb. Optim., 2019)

Optimal channel assignment with list-edge coloring. - Huijuan Wang; Panos M. Pardalos; Bin Liu 009 (J. Comb. Optim., 2019)

An efficient case for computing minimum linear arboricity with small maximum degree. - Huijuan Wang; Lidong Wu; Miltiades P. Pardalos; Hongwei Du 001; Bin Liu 009 (Optim. Lett., 2019)

Core Decomposition, Maintenance and Applications. - Feiteng Zhang; Bin Liu 009; Qizhi Fang (Complexity and Approximation, 2020)

Incremental Algorithms of the Core Maintenance Problem on Edge-Weighted Graphs. - Bin Liu 009; Feiteng Zhang (IEEE Access, 2020)

The list coloring and list total coloring of planar graphs with maximum degree at least 7. - Bin Liu 009; Lin Sun; Bing Wang; Jian-Liang Wu 001 (Discuss. Math. Graph Theory, 2020)

A random algorithm for profit maximization in online social networks. - Tiantian Chen; Bin Liu 009; Wenjing Liu; Qizhi Fang; Jing Yuan 002; Weili Wu 001 (Theor. Comput. Sci., 2020)

Profit Maximization problem with Coupons in social networks. - Bin Liu 009; Xiao Li 027; Huijuan Wang; Qizhi Fang; Junyu Dong; Weili Wu 001 (Theor. Comput. Sci., 2020)

An Efficient Randomized Algorithm for Rumor Blocking in Online Social Networks. - Guangmo Tong; Weili Wu 001; Ling Guo; Deying Li 001; Cong Liu 005; Bin Liu 009; Ding-Zhu Du (IEEE Trans. Netw. Sci. Eng., 2020)

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

An Order Approach for the Core Maintenance Problem on Edge-Weighted Graphs. - Bin Liu 009; Zhenming Liu; Feiteng Zhang (AAIM, 2021)

Streaming Algorithms for Maximizing Non-submodular Functions on the Integer Lattice. - Bin Liu 009; Zihan Chen; Huijuan Wang; Weili Wu 001 (CSoNet, 2021)

A Combinatorial Characterization for Population Monotonic Allocations in Convex Independent Set Games. - Bin Liu 009; Han Xiao 003; Qizhi Fang (Asia Pac. J. Oper. Res., 2021)

A Random Algorithm for Profit Maximization with Multiple Adoptions in Online Social Networks. - Tiantian Chen; Bin Liu 009; Wenjing Liu; Qizhi Fang; Jing Yuan 002; Weili Wu 001 (CoRR, 2021)

Bicriteria Algorithms for Maximizing the Difference Between Submodular Function and Linear Function Under Noise. - Mengxue Geng; Shufang Gong; Bin Liu 009; Weili Wu 001 (AAIM, 2022)

Streaming Submodular Maximization with the Chance Constraint. - Shufang Gong; Bin Liu 009; Qizhi Fang (FAW, 2022)

Fast algorithms for maximizing monotone nonsubmodular functions. - Bin Liu 009; Miaomiao Hu (J. Comb. Optim., 2022)

Efficient Algorithms for k-Submodular Function Maximization with p-System and d-Knapsack Constraint. - Wenzhe Zhang; Shufang Gong; Bin Liu 009 (COCOA (1), 2023)

Deletion-Robust Submodular Maximization Under the Cardinality Constraint over the Integer Lattice. - Guangwen Zhou; Bin Liu 009; Yuanyuan Qiang (CSoNet, 2023)

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

An optimal streaming algorithm for non-submodular functions maximization on the integer lattice. - Bin Liu 009; Zihan Chen; Huijuan Wang; Weili Wu 001 (J. Comb. Optim., 2023)

Order based algorithms for the core maintenance problem on edge-weighted graphs. - Feiteng Zhang; Bin Liu 009; Zhenming Liu; Qizhi Fang (Theor. Comput. Sci., 2023)

Algorithms for maximizing monotone submodular function minus modular function under noise. - Shufang Gong; Bin Liu 009; Mengxue Geng; Qizhi Fang (J. Comb. Optim., 2023)

Monotone Submodular Meta-learning under the Matroid Constraint. - Shufang Gong; Bin Liu 009; Qizhi Fang; Weili Wu 001 (AAIM (1), 2024)

An accelerated deterministic algorithm for maximizing monotone submodular minus modular function with cardinality constraint. - Shufang Gong; Bin Liu 009; Qizhi Fang (Theor. Comput. Sci., 2024)

The decomposition and maintenance of hypercores on edge-weighted hypergraphs. - Yiqun Xu; Feiteng Zhang; Bin Liu 009 (Math. Found. Comput., 2025)