[1] Minimum Size Tree Decompositions, B. Li, F. Z. Moataz, N. Nisse, K. Suchan, Discrete Applied Mathematics, August 2018, Volume 245, pp 109-127, https://www.sciencedirect.com/science/article/pii/S0166218X17300677

[2] k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth, A. Kosowski, B. Li, N. Nisse and K. Suchan, Algorithmica. July 2015, Volume 72, Issue 3, pp 758-777, http://link.springer.com/article/10.1007/s00453-014-9871-y

[3] Data Gathering and Personalized Broadcasting in Radio Grids with Interferences, J. Bermond, B. Li, N. Nisse, H. Rivano, J. Yu, Theoretical Computer Science； 2015，V562(0) Pages 453–475. http://www.sciencedirect.com/science/article/pii/S0304397514008214

[4] Risk Models for the Prize Collecting Steiner Tree Problems with Interval Data, E. Alvarez-Miranda, A. Candia, X. Chen, X. Hu, and B. Li, Acta Mathematicae Applicatae Sinica, English Serie, 2014,V30(1); pages 1-26, http://link.springer.com/article/10.1007/s10255-014-0269-z#

[5] Minimum Size Tree Decompositions, B. Li, F. Z. Moataz, N. Nisse, K. Suchan, The VIII Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS), 2015.

[6] k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth, A. Kosowski, B. Li, N. Nisse and K. Suchan, in Proceedings of the 39th International Colloquium on Automata, Languages and Programming (ICALP 2012), track C, Springer LNCS 7392, pages 610-622, University of Warwick, UK, 9-13 July 2012.

[7] Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data, E. Alvarez-Miranda, A. Candia, X. Chen, X. Hu, and B. Li, in proceedings of the 6th International Conference on Algorithmic Aspects in Information and Management (AAIM), Lecture Notes in Computer Science, 6124; pages 13-24, 2010.