Bin Liu
Orcid: 0000-0002-8958-3999Affiliations:
- 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 45 papers
between 2008 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2008
2010
2012
2014
2016
2018
2020
2022
2024
0
1
2
3
4
5
6
7
1
4
1
2
5
4
2
2
2
1
2
1
2
4
2
1
1
2
2
3
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
An accelerated deterministic algorithm for maximizing monotone submodular minus modular function with cardinality constraint.
Theor. Comput. Sci., 2024
Proceedings of the Algorithmic Aspects in Information and Management, 2024
2023
Algorithms for maximizing monotone submodular function minus modular function under noise.
J. Comb. Optim., April, 2023
Theor. Comput. Sci., 2023
An optimal streaming algorithm for non-submodular functions maximization on the integer lattice.
J. Comb. Optim., 2023
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
J. Comb. Optim., 2022
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
Proceedings of the Computational Data and Social Networks - 10th International Conference, 2021
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
IEEE Trans. Netw. Sci. Eng., 2020
Theor. Comput. Sci., 2020
Theor. Comput. Sci., 2020
The list coloring and list total coloring of planar graphs with maximum degree at least 7.
Discuss. Math. Graph Theory, 2020
IEEE Access, 2020
Proceedings of the Complexity and Approximation - In Memory of Ker-I Ko, 2020
2019
Optim. Lett., 2019
Maximizing profit of multiple adoptions in social networks with a martingale approach.
J. Comb. Optim., 2019
2018
2017
J. Comb. Optim., 2017
2016
J. Comb. Optim., 2016
2015
2014
Theor. Comput. Sci., 2014
2012
2011
On edge cover coloring of join graphs.
Ars Comb., 2011
2010
Int. J. Comput. Math., 2010
Int. J. Comput. Math., 2010
Graphs Comb., 2010
2009
Total colorings and list total colorings of planar graphs without intersecting 4-cycles.
Discret. Math., 2009
2008
Inf. Process. Lett., 2008