Bin Liu 0009 - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 24 from 24

2023

An optimal streaming algorithm for non-submodular functions maximization on the integer latticeBin Liu 0009, Zihan Chen, Huijuan Wang, Weili Wu 0001. jco, 45(1):42, 2023. [doi]

Streaming submodular maximization under d-knapsack constraintsZihan Chen, Bin Liu 0009, Hongmin W. Du. jco, 45(1):15, 2023. [doi]

Algorithms for maximizing monotone submodular function minus modular function under noiseShufang Gong, Bin Liu 0009, Mengxue Geng, Qizhi Fang. jco, 45(3):96, April 2023. [doi]

Efficient Algorithms for k-Submodular Function Maximization with p-System and d-Knapsack ConstraintWenzhe Zhang, Shufang Gong, Bin Liu 0009. cocoa 2024: 265-276 [doi]

Order based algorithms for the core maintenance problem on edge-weighted graphsFeiteng Zhang, Bin Liu 0009, Zhenming Liu, Qizhi Fang. TCS, 941:140-155, 2023. [doi]

Deletion-Robust Submodular Maximization Under the Cardinality Constraint over the Integer LatticeGuangwen Zhou, Bin Liu 0009, Yuanyuan Qiang. csonet 2024: 234-242 [doi]

2022

Fast algorithms for maximizing monotone nonsubmodular functionsBin Liu 0009, Miaomiao Hu. jco, 43(5):1655-1670, 2022. [doi]

Bicriteria Algorithms for Maximizing the Difference Between Submodular Function and Linear Function Under NoiseMengxue Geng, Shufang Gong, Bin Liu 0009, Weili Wu 0001. AAIM 2022: 133-143 [doi]

Streaming Submodular Maximization with the Chance ConstraintShufang Gong, Bin Liu 0009, Qizhi Fang. faw 2022: 129-140 [doi]

2021

A Combinatorial Characterization for Population Monotonic Allocations in Convex Independent Set GamesBin Liu 0009, Han Xiao 0003, Qizhi Fang. apjor, 38(5), 2021. [doi]

Streaming Algorithms for Maximizing DR-Submodular Functions with d-Knapsack ConstraintsBin Liu 0009, Zihan Chen, Hongmin W. Du. AAIM 2021: 159-169 [doi]

An Order Approach for the Core Maintenance Problem on Edge-Weighted GraphsBin Liu 0009, Zhenming Liu, Feiteng Zhang. AAIM 2021: 426-437 [doi]

2020

2016

A note on the minimum number of choosability of planar graphsHuijuan Wang, Lidong Wu, Xin Zhang, Weili Wu, Bin Liu 0009. jco, 31(3):1013-1022, 2016. [doi]

2015

Total Coloring of Planar Graphs Without Chordal Short CyclesHuijuan Wang, Bin Liu 0009, Jianliang Wu. gc, 31(5):1755-1764, 2015. [doi]

2014

Total coloring of embedded graphs with maximum degree at least sevenHuijuan Wang, Bin Liu 0009, Jianliang Wu, Guizhen Liu. TCS, 518:1-9, 2014. [doi]

On the linear arboricity of graphs embeddable in surfacesHuijuan Wang, Jianliang Wu, Bin Liu 0009, Hongyu Chen. ipl, 114(9):475-479, 2014. [doi]

2012

Circular Coloring of Planar DigraphsGuanghui Wang, Bin Liu 0009, Jiguo Yu, Guizhen Liu. gc, 28(6):889-900, 2012. [doi]

2011

Total coloring of planar graphs without 6-cyclesJianfeng Hou, Bin Liu 0009, Guizhen Liu, Jianliang Wu. DAM, 159(2-3):157-163, 2011. [doi]

On edge cover coloring of join graphsJinbo Li, Guizhen Liu, Bin Liu 0009. arscom, 100:299-306, 2011.

Sign in or sign up to see more results.

runs on WebDSL