Bin Liu

Orcid: 0000-0002-8958-3999

Affiliations:
  • Ocean University of China, Department of Mathematics, Qingdao, China
  • Shandong University, School of Mathematics, Jinan, China


According to our database1, Bin Liu authored at least 42 papers between 2008 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Algorithms for maximizing monotone submodular function minus modular function under noise.
J. Comb. Optim., April, 2023

Order based algorithms for the core maintenance problem on edge-weighted graphs.
Theor. Comput. Sci., 2023

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

Streaming submodular maximization under d-knapsack constraints.
J. Comb. Optim., 2023

Deletion-Robust Submodular Maximization Under the Cardinality Constraint over the Integer Lattice.
Proceedings of the Computational Data and Social Networks - 12th International Conference, 2023

Efficient Algorithms for k-Submodular Function Maximization with p-System and d-Knapsack Constraint.
Proceedings of the Combinatorial Optimization and Applications, 2023

2022
Fast algorithms for maximizing monotone nonsubmodular functions.
J. Comb. Optim., 2022

Streaming Submodular Maximization with the Chance Constraint.
Proceedings of the Frontiers of Algorithmic Wisdom, 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
A Random Algorithm for Profit Maximization with Multiple Adoptions in Online Social Networks.
CoRR, 2021

A Combinatorial Characterization for Population Monotonic Allocations in Convex Independent Set Games.
Asia Pac. J. Oper. Res., 2021

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

An Order Approach for the Core Maintenance Problem on Edge-Weighted Graphs.
Proceedings of the Algorithmic Aspects in Information and Management, 2021

Streaming Algorithms for Maximizing DR-Submodular Functions with d-Knapsack Constraints.
Proceedings of the Algorithmic Aspects in Information and Management, 2021

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

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

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

Incremental Algorithms of the Core Maintenance Problem on Edge-Weighted Graphs.
IEEE Access, 2020

Core Decomposition, Maintenance and Applications.
Proceedings of the Complexity and Approximation - In Memory of Ker-I Ko, 2020

2019
An efficient case for computing minimum linear arboricity with small maximum degree.
Optim. Lett., 2019

Optimal channel assignment with list-edge coloring.
J. Comb. Optim., 2019

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

Social Structure Decomposition With Security Issue.
IEEE Access, 2019

2018
Optimal channel assignment and L(p, 1)-labeling.
J. Glob. Optim., 2018

Minimum choosability of planar graphs.
J. Comb. Optim., 2018

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

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

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

2015
Total Coloring of Planar Graphs Without Chordal Short Cycles.
Graphs Comb., 2015

2014
Total coloring of embedded graphs with maximum degree at least seven.
Theor. Comput. Sci., 2014

On the linear arboricity of graphs embeddable in surfaces.
Inf. Process. Lett., 2014

2012
Circular Coloring of Planar Digraphs.
Graphs Comb., 2012

2011
Total coloring of planar graphs without 6-cycles.
Discret. Appl. Math., 2011

On edge cover coloring of join graphs.
Ars Comb., 2011

2010
Acyclic edge chromatic number of outerplanar graphs.
J. Graph Theory, 2010

On the adjacent vertex distinguishing edge colourings of graphs.
Int. J. Comput. Math., 2010

Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles.
Int. J. Comput. Math., 2010

Vertex-Distinguishing Edge Colorings of Graphs with Degree Sum Conditions.
Graphs Comb., 2010

2009
Acyclic edge coloring of planar graphs with large girth.
Theor. Comput. Sci., 2009

Total colorings and list total colorings of planar graphs without intersecting 4-cycles.
Discret. Math., 2009

2008
List edge and list total colorings of planar graphs without short cycles.
Inf. Process. Lett., 2008


  Loading...