Bin Liu

According to our database1, Bin Liu authored at least 26 papers between 2008 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

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

2019
An efficient case for computing minimum linear arboricity with small maximum degree.
Optimization Letters, 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. Global Optimization, 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

An efficient randomized algorithm for rumor blocking in online social networks.
Proceedings of the 2017 IEEE Conference on Computer Communications, 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 and Combinatorics, 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 and Combinatorics, 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.
Journal of 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 and Combinatorics, 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.
Discrete Mathematics, 2009

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


  Loading...