default search action
Bin Liu 0009
Person information
- affiliation: Ocean University of China, Department of Mathematics, Qingdao, China
- affiliation: Shandong University, School of Mathematics, Jinan, China
Other persons with the same name
- Bin Liu — disambiguation page
- Bin Liu 0001
— Tsinghua University, Department of Computer Science and Technology, Laboratory of Broadband Network Switching Technology and Communications, Beijing, China (and 1 more)
- Bin Liu 0002 — NEC Labs America (and 1 more)
- Bin Liu 0003
- Bin Liu 0004 — Samsung (and 1 more)
- Bin Liu 0005 — GLC Asset Management (and 1 more)
- Bin Liu 0006 — University of California, Los Angeles, CA, USA
- Bin Liu 0007 — EDA Lab, Department of Computer Science and Technology, Tsinghua University
- Bin Liu 0008 — Information Engineering University, China
- Bin Liu 0010 — Georgia Institute of Technology
- Bin Liu 0011 — Henan Agricultural University, Department of Management Science, Zhengzhou, China (and 1 more)
- Bin Liu 0012 — Telecom ParisTech, France
- Bin Liu 0013 — Huazhong University of Science and Technology
- Bin Liu 0014
- Bin Liu 0015 — State Key Laboratory of Intelligent Technology and Systems, Department of Automation, Tsinghua University
- Bin Liu 0016
- Bin Liu 0017
- Bin Liu 0018 — Tongji University, Shanghai, China
- Bin Liu 0019
- Bin Liu 0021
- Bin Liu 0022
- Bin Liu 0023
- Bin Liu 0024
- Bin Liu 0025
- Bin Liu 0026
- Bin Liu 0027
- Bin Liu 0028
- Bin Liu 0029
- Bin Liu 0030
- Bin Liu 0031
- Bin Liu 0032
- Bin Liu 0033
- Bin Liu 0034
- Bin Liu 0035
- Bin Liu 0036
- Bin Liu 0037 — University of California, Davis, Department of Electrical and Computer Engineering, CA, USA
- Bin Liu 0038
- Bin Liu 0039
- Bin Liu 0040
- Bin Liu 0041
- Bin Liu 0042
- Bin Liu 0043 — Southeast University, Zhong-Da Hospital, Department of Radiology, Nanjing, China
- Bin Liu 0044 — Yanshan University, School of Information Science and Engineering, Qinhuangdao, China
- Bin Liu 0045
- Bin Liu 0046
- Bin Liu 0047
- Bin Liu 0048
- Bin Liu 0049
- Bin Liu 0050
- Bin Liu 0051
- Bin Liu 0052
- Bin Liu 0053
- Bin Liu 0054
- Bin Liu 0055
- Bin Liu 0056
- Bin Liu 0057
- Bin Liu 0058
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j35]Shufang Gong, Bin Liu
An accelerated deterministic algorithm for maximizing monotone submodular minus modular function with cardinality constraint. Theor. Comput. Sci. 1016: 114798 (2024) - [c12]Shufang Gong, Bin Liu
Monotone Submodular Meta-learning under the Matroid Constraint. AAIM (1) 2024: 210-221 - 2023
- [j34]Zihan Chen, Bin Liu
Streaming submodular maximization under d-knapsack constraints. J. Comb. Optim. 45(1): 15 (2023) - [j33]Bin Liu
An optimal streaming algorithm for non-submodular functions maximization on the integer lattice. J. Comb. Optim. 45(1): 42 (2023) - [j32]Shufang Gong, Bin Liu
Algorithms for maximizing monotone submodular function minus modular function under noise. J. Comb. Optim. 45(3): 96 (2023) - [j31]Feiteng Zhang
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 - [c10]Guangwen Zhou, Bin Liu
Deletion-Robust Submodular Maximization Under the Cardinality Constraint over the Integer Lattice. CSoNet 2023: 234-242 - 2022
- [j30]Bin Liu
Fast algorithms for maximizing monotone nonsubmodular functions. J. Comb. Optim. 43(5): 1655-1670 (2022) - [c9]Mengxue Geng, Shufang Gong, Bin Liu
Bicriteria Algorithms for Maximizing the Difference Between Submodular Function and Linear Function Under Noise. AAIM 2022: 133-143 - [c8]Shufang Gong, Bin Liu
Streaming Submodular Maximization with the Chance Constraint. FAW 2022: 129-140 - 2021
- [j29]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
Streaming Algorithms for Maximizing DR-Submodular Functions with d-Knapsack Constraints. AAIM 2021: 159-169 - [c6]Bin Liu
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
- [j28]Bin Liu
Incremental Algorithms of the Core Maintenance Problem on Edge-Weighted Graphs. IEEE Access 8: 63872-63884 (2020) - [j27]Bin Liu, Lin Sun, Bing Wang, Jian-Liang Wu:
The list coloring and list total coloring of planar graphs with maximum degree at least 7. Discuss. Math. Graph Theory 40(4): 1005-1024 (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
A random algorithm for profit maximization in online social networks. Theor. Comput. Sci. 803: 36-47 (2020) - [j24]Guangmo Tong
An Efficient Randomized Algorithm for Rumor Blocking in Online Social Networks. IEEE Trans. Netw. Sci. Eng. 7(2): 845-854 (2020) - [c4]Bin Liu
Fast Algorithms for Maximizing Monotone Nonsubmodular Functions. AAIM 2020: 204-213 - [c3]Feiteng Zhang
Core Decomposition, Maintenance and Applications. Complexity and Approximation 2020: 205-218
2010 – 2019
- 2019
- [j23]Wenshun Teng, Huijuan Wang
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
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
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
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
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
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)
2000 – 2009
- 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)
Coauthor Index
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-11-26 20:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: