Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data. - Eduardo Álvarez-Miranda; Alfredo Candia-Véjar; Xujin Chen; Xiaodong Hu 001; Bi Li 004 (AAIM, 2010)

Tree decompositions and routing problems. (Décompositions arborescentes et problèmes de routage). - Bi Li 004 (2014)

k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth. - Adrian Kosowski; Bi Li 004; Nicolas Nisse; Karol Suchan (Algorithmica, 2015)

Data gathering and personalized broadcasting in radio grids with interference. - Jean-Claude Bermond; Bi Li 004; Nicolas Nisse; Hervé Rivano; Min-Li Yu (Theor. Comput. Sci., 2015)

Minimum size tree-decompositions. - Bi Li 004; Fatima Zahra Moataz; Nicolas Nisse; Karol Suchan (Discret. Appl. Math., 2018)

Light paths and edges in families of outer-1-planar graphs. - Xin Zhang 017; Jingfen Lan; Bi Li 004; Qiang Zhu 003 (Inf. Process. Lett., 2018)

Equitable vertex arboricity of $d$-degenerate graphs. - Xin Zhang 017; Bei Niu; Yan Li; Bi Li 004 (CoRR, 2019)

Complexity of Tree-Coloring Interval Graphs Equitably. - Bei Niu; Bi Li 004; Xin Zhang 017 (AAIM, 2020)

Tree-coloring problems of bounded treewidth graphs. - Bi Li 004; Xin Zhang 017 (J. Comb. Optim., 2020)

On minimizing the maximum color for the 1-2-3 Conjecture. - Julien Bensmail; Bi Li 004; Binlong Li; Nicolas Nisse (Discret. Appl. Math., 2021)

An Injective Version of the 1-2-3 Conjecture. - Julien Bensmail; Bi Li 004; Binlong Li (Graphs Comb., 2021)

h-extra r-component connectivity of interconnection networks with application to hypercubes. - Bi Li 004; Jingfen Lan; Wantao Ning; Yongcui Tian; Xin Zhang 017; Qiang Zhu 003 (Theor. Comput. Sci., 2021)

Hardness and algorithms of equitable tree-coloring problem in chordal graphs. - Bei Niu; Bi Li 004; Xin Zhang 017 (Theor. Comput. Sci., 2021)

Fast algorithm of equitably partitioning degenerate graphs into graphs with lower degeneracy. - Xin Zhang 017; Huaqiang Zhang; Bei Niu; Bi Li 004 (Theor. Comput. Sci., 2022)