 |
Bi Li - PhD Student
at
joint project-team COATI
Inria Sophia Antipolis - Méditerranée and the I3S laboratory (CNRS, UNS)
Bat. Lagrange, Office LS19,
INRIA Sophia Antipolis Mediterranee,
2004 route des Lucioles,
06902 Sophia Antipolis,
France
Phone: +33 (0)4 92 38 75 98
Email:
[Curriculum Vitae]
|
Current Position
Since October 2011: PhD student in joint project-team COATI.
Since November 2010: PhD student in
Academy of Mathematics and Systems Science, CAS.
About Me
2008 - 2010: Master Degree in Operations Research in Institute of Applied Mathematics, AMSS, CAS, Beijing, China.
2004 - 2008: Bachelor of Science in Shaanxi Normal University, Xi'an, China.
Main Interests
-
Combinatorial Optimizations
-
Algorithms
-
Network Optimizations
Project in which I am currently involved
Publications
Jean-Claude Bermond,
Bi Li,
Nicolas Nisse,
Herve Rivano,
and Min-Li Yu.
Data Gathering and Personalized Broadcasting in Radio Grids with Interferences.
submitted to Theoretical Computer Science. [PDF]
Bi Li,
Fatima Zahra Moataz
and Nicolas Nisse.
Minimum Size Tree Decompositions.
Presented in
9th International colloquium on graph theory and combinatorics (ICGT 2014), Grenbole, France
June 30-July 4, 2014. [PDF
]
E. Alvarez-Miranda,
A. Candia,
X. Chen,
X. Hu,
and B. Li.
Risk models for the prize collecting steiner tree problems with interval data.
In Acta Mathematicae Applicatae Sinica, English Series, 30(1), pages 1-26, March 2014.
Springer. [WWW
] [PDF
]
Adrian Kosowski,
Bi Li,
Nicolas Nisse
and Karol Suchan.
k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth.
In Algorithmica, pages 1-20, January 2014. [WWW
] [PDF
]
Adrian Kosowski,
Bi Li,
Nicolas Nisse
and Karol Suchan.
k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth.
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. [WWW
] [PDF
]
Adrian Kosowski,
Bi Li,
Nicolas Nisse
and Karol Suchan.
k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth.
In 14es Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), pages 83-86, France, 29 May--1st June, 2012.
[PDF]
E. Alvarez-Miranda,
A. Candia,
X. Chen,
X. Hu,
and B. Li.
Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data.
In Proceedings of the 6th International Conference on Algorithmic Aspects in Information and Management (AAIM),
volume 6124 of Lecture Notes in Computer Science,
Weihai, China,
pages 13-24,
July 2010.
Springer. [WWW
] [PDF
]
Research Reports
Bi Li.
Tree Decompositions and Routing Problems.
PhD Thesis, November 2014. [PDF
]
Bi Li,
Fatima Zahra Moataz,
Nicolas Nisse
and Karol Suchan.
Size-Constrained Tree Decompositions.
October 2014. [PDF
]
Jean-Claude Bermond,
Bi Li,
Nicolas Nisse,
Herve Rivano,
and Min-Li Yu.
Data Gathering and Personalized Broadcasting in Radio Grids with Interferences.
January 2013. [PDF]
Adrian Kosowski,
Bi Li,
Nicolas Nisse,
and Karol Suchan.
k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth.
February 2012. [PDF]
|