Остановите войну!
for scientists:
default search action
Bin Liu 0009
- > Home > Persons > Bin Liu 0009
Publications
- 2023
- [j33]Zihan Chen, Bin Liu, Hongmin W. Du:
Streaming submodular maximization under d-knapsack constraints. J. Comb. Optim. 45(1): 15 (2023) - [j32]Bin Liu, Zihan Chen, Huijuan Wang, Weili Wu:
An optimal streaming algorithm for non-submodular functions maximization on the integer lattice. J. Comb. Optim. 45(1): 42 (2023) - [j31]Shufang Gong, Bin Liu, Mengxue Geng, Qizhi Fang:
Algorithms for maximizing monotone submodular function minus modular function under noise. J. Comb. Optim. 45(3): 96 (2023) - [j30]Feiteng Zhang, Bin Liu, Zhenming Liu, Qizhi Fang:
Order based algorithms for the core maintenance problem on edge-weighted graphs. Theor. Comput. Sci. 941: 140-155 (2023) - [c11]Wenzhe Zhang, Shufang Gong, Bin Liu:
Efficient Algorithms for k-Submodular Function Maximization with p-System and d-Knapsack Constraint. COCOA (1) 2023: 265-276 - 2022
- [c9]Mengxue Geng, Shufang Gong, Bin Liu, Weili Wu:
Bicriteria Algorithms for Maximizing the Difference Between Submodular Function and Linear Function Under Noise. AAIM 2022: 133-143 - [c8]Shufang Gong, Bin Liu, Qizhi Fang:
Streaming Submodular Maximization with the Chance Constraint. FAW 2022: 129-140 - 2021
- [j28]Bin Liu, Han Xiao, Qizhi Fang:
A Combinatorial Characterization for Population Monotonic Allocations in Convex Independent Set Games. Asia Pac. J. Oper. Res. 38(5): 2140006:1-2140006:9 (2021) - [c7]Bin Liu, Zihan Chen, Hongmin W. Du:
Streaming Algorithms for Maximizing DR-Submodular Functions with d-Knapsack Constraints. AAIM 2021: 159-169 - [c6]Bin Liu, Zhenming Liu, Feiteng Zhang:
An Order Approach for the Core Maintenance Problem on Edge-Weighted Graphs. AAIM 2021: 426-437 - [c5]Bin Liu, Zihan Chen, Huijuan Wang, Weili Wu:
Streaming Algorithms for Maximizing Non-submodular Functions on the Integer Lattice. CSoNet 2021: 3-14 - [i2]Tiantian Chen, Bin Liu, Wenjing Liu, Qizhi Fang, Jing Yuan, Weili Wu:
A Random Algorithm for Profit Maximization with Multiple Adoptions in Online Social Networks. CoRR abs/2101.06239 (2021) - 2020
- [j27]Bin Liu, Feiteng Zhang:
Incremental Algorithms of the Core Maintenance Problem on Edge-Weighted Graphs. IEEE Access 8: 63872-63884 (2020) - [j26]Bin Liu, Xiao Li, Huijuan Wang, Qizhi Fang, Junyu Dong, Weili Wu:
Profit Maximization problem with Coupons in social networks. Theor. Comput. Sci. 803: 22-35 (2020) - [j25]Tiantian Chen, Bin Liu, Wenjing Liu, Qizhi Fang, Jing Yuan, Weili Wu:
A random algorithm for profit maximization in online social networks. Theor. Comput. Sci. 803: 36-47 (2020) - [j24]Guangmo Tong, Weili Wu, Ling Guo, Deying Li, Cong Liu, Bin Liu, Ding-Zhu Du:
An Efficient Randomized Algorithm for Rumor Blocking in Online Social Networks. IEEE Trans. Netw. Sci. Eng. 7(2): 845-854 (2020) - [c3]Feiteng Zhang, Bin Liu, Qizhi Fang:
Core Decomposition, Maintenance and Applications. Complexity and Approximation 2020: 205-218 - 2019
- [j23]Wenshun Teng, Huijuan Wang, Hongling Chen, Bin Liu:
Social Structure Decomposition With Security Issue. IEEE Access 7: 82785-82793 (2019) - [j22]Bin Liu, Yuxia Yan, Qizhi Fang, Junyu Dong, Weili Wu, Huijuan Wang:
Maximizing profit of multiple adoptions in social networks with a martingale approach. J. Comb. Optim. 38(1): 1-20 (2019) - [j21]Huijuan Wang, Panos M. Pardalos, Bin Liu:
Optimal channel assignment with list-edge coloring. J. Comb. Optim. 38(1): 197-207 (2019) - [j20]Huijuan Wang, Lidong Wu, Miltiades P. Pardalos, Hongwei Du, Bin Liu:
An efficient case for computing minimum linear arboricity with small maximum degree. Optim. Lett. 13(2): 419-428 (2019) - 2018
- [j19]Huijuan Wang, Bin Liu, Ling Gai, Hongwei Du, Jianliang Wu:
Minimum choosability of planar graphs. J. Comb. Optim. 36(1): 13-22 (2018) - [j18]Junlei Zhu, Yuehua Bu, Panayote M. Pardalos, Hongwei Du, Huijuan Wang, Bin Liu:
Optimal channel assignment and L(p, 1)-labeling. J. Glob. Optim. 72(3): 539-552 (2018) - [c2]Bin Liu, Xiao Li, Huijuan Wang, Qizhi Fang, Junyu Dong, Weili Wu:
Profit Maximization Problem with Coupons in Social Networks. AAIM 2018: 49-61 - 2017
- [j17]Huijuan Wang, Bin Liu, Yan Gu, Xin Zhang, Weili Wu, Hongwei Gao:
Total coloring of planar graphs without adjacent short cycles. J. Comb. Optim. 33(1): 265-274 (2017) - [j16]Huijuan Wang, Bin Liu, Xiaoli Wang, Guangmo Tong, Weili Wu, Hongwei Gao:
Total coloring of planar graphs without adjacent chordal 6-cycles. J. Comb. Optim. 34(1): 257-265 (2017) - [c1]Guangmo Amo Tong, Weili Wu, Ling Guo, Deying Li, Cong Liu, Bin Liu, Ding-Zhu Du:
An efficient randomized algorithm for rumor blocking in online social networks. INFOCOM 2017: 1-9 - [i1]Guangmo Tong, Weili Wu, Ling Guo, Deying Li, Cong Liu, Bin Liu, Ding-Zhu Du:
An Efficient Randomized Algorithm for Rumor Blocking in Online Social Networks. CoRR abs/1701.02368 (2017) - 2016
- [j15]Huijuan Wang, Lidong Wu, Xin Zhang, Weili Wu, Bin Liu:
A note on the minimum number of choosability of planar graphs. J. Comb. Optim. 31(3): 1013-1022 (2016) - [j14]Huijuan Wang, Bin Liu, Xin Zhang, Lidong Wu, Weili Wu, Hongwei Gao:
List edge and list total coloring of planar graphs with maximum degree 8. J. Comb. Optim. 32(1): 188-197 (2016) - 2015
- [j13]Huijuan Wang, Bin Liu, Jianliang Wu:
Total Coloring of Planar Graphs Without Chordal Short Cycles. Graphs Comb. 31(5): 1755-1764 (2015) - 2014
- [j12]Huijuan Wang, Jianliang Wu, Bin Liu, Hongyu Chen:
On the linear arboricity of graphs embeddable in surfaces. Inf. Process. Lett. 114(9): 475-479 (2014) - [j11]Huijuan Wang, Bin Liu, Jianliang Wu, Guizhen Liu:
Total coloring of embedded graphs with maximum degree at least seven. Theor. Comput. Sci. 518: 1-9 (2014) - 2012
- [j10]Guanghui Wang, Bin Liu, Jiguo Yu, Guizhen Liu:
Circular Coloring of Planar Digraphs. Graphs Comb. 28(6): 889-900 (2012) - 2011
- [j9]Jinbo Li, Guizhen Liu, Bin Liu:
On edge cover coloring of join graphs. Ars Comb. 100: 299-306 (2011) - [j8]Jianfeng Hou, Bin Liu, Guizhen Liu, Jianliang Wu:
Total coloring of planar graphs without 6-cycles. Discret. Appl. Math. 159(2-3): 157-163 (2011) - 2010
- [j7]Bin Liu, Guizhen Liu:
Vertex-Distinguishing Edge Colorings of Graphs with Degree Sum Conditions. Graphs Comb. 26(6): 781-791 (2010) - [j6]Bin Liu, Guizhen Liu:
On the adjacent vertex distinguishing edge colourings of graphs. Int. J. Comput. Math. 87(4): 726-732 (2010) - [j5]Jianfeng Hou, Bin Liu, Guizhen Liu, Jihui Wang:
Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles. Int. J. Comput. Math. 87(13): 2880-2886 (2010) - [j4]Jianfeng Hou, Jianliang Wu, Guizhen Liu, Bin Liu:
Acyclic edge chromatic number of outerplanar graphs. J. Graph Theory 64(1): 22-36 (2010) - 2009
- [j3]Bin Liu, Jianfeng Hou, Jianliang Wu, Guizhen Liu:
Total colorings and list total colorings of planar graphs without intersecting 4-cycles. Discret. Math. 309(20): 6035-6043 (2009) - [j2]Dongxiao Yu, Jianfeng Hou, Guizhen Liu, Bin Liu, Lan Xu:
Acyclic edge coloring of planar graphs with large girth. Theor. Comput. Sci. 410(47-49): 5196-5200 (2009) - 2008
- [j1]Bin Liu, Jianfeng Hou, Guizhen Liu:
List edge and list total colorings of planar graphs without short cycles. Inf. Process. Lett. 108(6): 347-351 (2008)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-13 20:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint