Publications of Binlong Li
BACK TO COATI PUBLICATION INDEX
Publications of Binlong Li
-
Bi Li.
Tree decompositions and routing problems.
Theses,
Université Nice Sophia Antipolis,
November 2014.
[WWW
] [PDF
]
Keywords:
Tree decomposition,
Compact routing scheme,
Prize collecting Steiner tree,
Gathering,
Décomposition arborescente,
Schéma de routage compact.
[bibtex-entry]
-
Julien Bensmail,
Bi Li,
Binlong Li,
and Nicolas Nisse.
On Minimizing the Maximum Color for the 1-2-3 Conjecture.
Discrete Applied Mathematics,
289:32-51,
2021.
[WWW
] [PDF
]
Keywords:
proper vertex-colorings,
edge labelings,
1-2-3 Conjecture,
small vertex colors.
[bibtex-entry]
-
Julien Bensmail,
Bi Li,
and Binlong Li.
An injective version of the 1-2-3 Conjecture.
Graphs and Combinatorics,
37:281-311,
2021.
[WWW
] [PDF
] [bibtex-entry]
-
Julien Bensmail,
Bi Li,
and Binlong Li.
An injective version of the 1-2-3 Conjecture.
Graphs and Combinatorics,
2020.
[WWW
] [PDF
] [bibtex-entry]
-
Julien Bensmail and Binlong Li.
More Aspects of Arbitrarily Partitionable Graphs.
Discussiones Mathematicae Graph Theory,
2020.
[WWW
] [PDF
]
Keywords:
arbitrarily partitionable graphs,
partition into connected subgraphs,
Hamiltonicity.
[bibtex-entry]
-
Julien Bensmail,
Ararat Harutyunyan,
Ngoc Khang Le,
Binlong Li,
and Nicolas Lichiardopol.
Disjoint cycles of different lengths in graphs and digraphs.
The Electronic Journal of Combinatorics,
24(4),
December 2017.
[WWW
] [PDF
]
Keywords:
minimum degree,
vertex-disjoint cycles,
different lengths.
[bibtex-entry]
-
Bi Li,
Fatima Zahra Moataz,
Nicolas Nisse,
and Karol Suchan.
Minimum Size Tree-Decompositions.
Discrete Applied Mathematics,
February 2017.
[WWW
] [PDF
] [bibtex-entry]
-
Jean-Claude Bermond,
Bi Li,
Nicolas Nisse,
Hervé Rivano,
and Min-Li Yu.
Data gathering and personalized broadcasting in radio grids with interference.
Journal of Theoretical Computer Science (TCS),
562:453-475,
2015.
[WWW
] [PDF
]
Keywords:
Gathering,
Personalized broadcasting,
Interference,
Grid,
Radio networks.
[Abstract] [bibtex-entry]
-
Adrian Kosowski,
Bi Li,
Nicolas Nisse,
and Karol Suchan.
k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth.
Algorithmica,
72(3):758-777,
2015.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
Bi Li,
Fatima Zahra Moataz,
Nicolas Nisse,
and Karol Suchan.
Minimum Size Tree-decompositions.
In LAGOS 2015 -- VIII Latin-American Algorithms, Graphs and Optimization Symposium,
Beberibe, Ceará, Brazil,
May 2015.
[WWW
] [PDF
]
Keywords:
Minimum size tree-decomposition,
treewidth,
NP-hard.
[Abstract] [bibtex-entry]
-
Bi Li,
Fatima Zahra Moataz,
and Nicolas Nisse.
Minimum Size Tree-Decompositions.
In 9th International colloquium on graph theory and combinatorics (ICGT),
Grenoble, France,
2014.
[WWW
] [PDF
] [bibtex-entry]
-
A. Kosowski,
B. Li,
N. Nisse,
and K. Suchan.
k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth.
In 14es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel),
pages 83-86,
2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
A. Kosowski,
B. Li,
N. Nisse,
and K. Suchan.
k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth.
In 39th International Colloquium on Automata, Languages and Programming (ICALP, track C),
volume 7392,
pages 610-622,
2012.
Springer, LNCS.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
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
] [Abstract] [bibtex-entry]
-
Bi Li,
Fatima Zahra Moataz,
Nicolas Nisse,
and Karol Suchan.
Size-Constrained Tree Decompositions.
Research Report,
INRIA Sophia-Antipolis,
October 2014.
[WWW
] [PDF
] [bibtex-entry]
-
J-C. Bermond,
B. Li,
N. Nisse,
H. Rivano,
and M-L. Yu.
Data Gathering and Personalized Broadcasting in Radio Grids with Interferences.
Research Report RR-8218,
INRIA,
2013.
[WWW
] [PDF
] [bibtex-entry]
-
A. Kosowski,
B. Li,
N. Nisse,
and K. Suchan.
k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth.
Technical report RR-7888,
INRIA,
February 2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
Julien Bensmail and Binlong Li.
More Aspects of Arbitrarily Partitionable Graphs.
Note: Working paper or preprint,
November 2018.
[WWW
] [PDF
]
Keywords:
arbitrarily partitionable graphs,
partition into connected subgraphs,
Hamiltonicity.
[bibtex-entry]
BACK TO COATI PUBLICATION INDEX
Last modified: Sat Jan 29 19:00:45 2022
