We stand with Ukraine  

Bi Li

Orcid: 0000-0003-1976-4687

Affiliations:
  • Xidian University, School of Mathematics and Statistics, Xi'an, China
  • University of Nice Sophia Antipolis, France (PhD 2014)
  • INRIA, France (former)
  • Chinese Academy of Sciences, Beijing, China (former)


According to our database1, Bi Li authored at least 14 papers between 2010 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Fast algorithm of equitably partitioning degenerate graphs into graphs with lower degeneracy.
[BibTeX]
[DOI]
Xin Zhang
,
Huaqiang Zhang
,
Bei Niu
,
Bi Li
Theor. Comput. Sci., 2022

2021
Hardness and algorithms of equitable tree-coloring problem in chordal graphs.
[BibTeX]
[DOI]
Bei Niu
,
Bi Li
,
Xin Zhang
Theor. Comput. Sci., 2021

<i>h</i>-extra <i>r</i>-component connectivity of interconnection networks with application to hypercubes.
[BibTeX]
[DOI]
Bi Li
,
Jingfen Lan
,
Wantao Ning
,
Yongcui Tian
,
Xin Zhang
,
Qiang Zhu
Theor. Comput. Sci., 2021

An Injective Version of the 1-2-3 Conjecture.
[BibTeX]
[DOI]
Julien Bensmail
,
Bi Li
,
Binlong Li
Graphs Comb., 2021

On minimizing the maximum color for the 1-2-3 Conjecture.
[BibTeX]
[DOI]
Julien Bensmail
,
Bi Li
,
Binlong Li
,
Nicolas Nisse
Discret. Appl. Math., 2021

2020
Tree-coloring problems of bounded treewidth graphs.
[BibTeX]
[DOI]
Bi Li
,
Xin Zhang
J. Comb. Optim., 2020

Complexity of Tree-Coloring Interval Graphs Equitably.
[BibTeX]
[DOI]
Bei Niu
,
Bi Li
,
Xin Zhang
Proceedings of the Algorithmic Aspects in Information and Management, 2020

2019
Equitable vertex arboricity of $d$-degenerate graphs.
[BibTeX]
[DOI]
Xin Zhang
,
Bei Niu
,
Yan Li
,
Bi Li
CoRR, 2019

2018
Light paths and edges in families of outer-1-planar graphs.
[BibTeX]
[DOI]
Xin Zhang
,
Jingfen Lan
,
Bi Li
,
Qiang Zhu
Inf. Process. Lett., 2018

2015
Data gathering and personalized broadcasting in radio grids with interference.
[BibTeX]
[DOI]
Jean-Claude Bermond
,
Bi Li
,
Nicolas Nisse
,
Hervé Rivano
,
Min-Li Yu
Theor. Comput. Sci., 2015

Minimum Size Tree-decompositions.
[BibTeX]
[DOI]
Bi Li
,
Fatima Zahra Moataz
,
Nicolas Nisse
,
Karol Suchan
Electron. Notes Discret. Math., 2015

2014
Tree decompositions and routing problems. (Décompositions arborescentes et problèmes de routage).
[BibTeX]
[DOI]
Bi Li
PhD thesis, 2014

2012
k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth.
[BibTeX]
[DOI]
Adrian Kosowski
,
Bi Li
,
Nicolas Nisse
,
Karol Suchan
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2010
Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data.
[BibTeX]
[DOI]
Eduardo Álvarez-Miranda
,
Alfredo Candia-Véjar
,
Xujin Chen
,
Xiaodong Hu
,
Bi Li
Proceedings of the Algorithmic Aspects in Information and Management, 2010


  Loading...