default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBi Li 0004
Person information
- affiliation: Xidian University, School of Mathematics and Statistics, Xi'an, China
- affiliation (PhD 2014): University of Nice Sophia Antipolis, France
- affiliation (former): INRIA, France
- affiliation (former): Chinese Academy of Sciences, Beijing, China
Other persons with the same name
- Bi Li — disambiguation page
- Bi Li 0001 — South China University of Technology, Guangzhou, China
- Bi Li 0002 — Hebei University of Technology, Tianjin, China
- Bi Li 0003 — Guangdong University of Foreign Studies, Guangzhou, China
- Bi Li 0005
![[0000-0003-2591-7571]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0003-2591-7571")
— Baidu Inc., China (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j11]Xin Zhang, Huaqiang Zhang, Bei Niu, Bi Li:
Fast algorithm of equitably partitioning degenerate graphs into graphs with lower degeneracy. Theor. Comput. Sci. 905: 18-30 (2022)- 2021
- [j10]Julien Bensmail, Bi Li, Binlong Li, Nicolas Nisse:
On minimizing the maximum color for the 1-2-3 Conjecture. Discret. Appl. Math. 289: 32-51 (2021) - [j9]Julien Bensmail, Bi Li, Binlong Li:
An Injective Version of the 1-2-3 Conjecture. Graphs Comb. 37(1): 281-311 (2021) - [j8]Bei Niu, Bi Li, Xin Zhang:
Hardness and algorithms of equitable tree-coloring problem in chordal graphs. Theor. Comput. Sci. 857: 8-15 (2021) - [j7]Bi Li, Jingfen Lan, Wantao Ning, Yongcui Tian, Xin Zhang, Qiang Zhu:
h-extra r-component connectivity of interconnection networks with application to hypercubes. Theor. Comput. Sci. 895: 68-74 (2021) - 2020
- [j6]Bi Li, Xin Zhang:
Tree-coloring problems of bounded treewidth graphs. J. Comb. Optim. 39(1): 156-169 (2020) - [c3]Bei Niu, Bi Li, Xin Zhang:
Complexity of Tree-Coloring Interval Graphs Equitably. AAIM 2020: 391-398 - [i2]Bei Niu, Bi Li, Xin Zhang:
Complexity of tree-coloring interval graphs equitably. CoRR abs/2003.03945 (2020)
2010 – 2019
- 2019
- [i1]Xin Zhang, Bei Niu, Yan Li, Bi Li:
Equitable vertex arboricity of $d$-degenerate graphs. CoRR abs/1908.05066 (2019) - 2018
- [j5]Bi Li, Fatima Zahra Moataz, Nicolas Nisse, Karol Suchan:
Minimum size tree-decompositions. Discret. Appl. Math. 245: 109-127 (2018) - [j4]Xin Zhang, Jingfen Lan, Bi Li, Qiang Zhu:
Light paths and edges in families of outer-1-planar graphs. Inf. Process. Lett. 136: 83-89 (2018) - 2015
- [j3]Adrian Kosowski, Bi Li, Nicolas Nisse, Karol Suchan:
k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth. Algorithmica 72(3): 758-777 (2015) - [j2]Bi Li, Fatima Zahra Moataz, Nicolas Nisse, Karol Suchan:
Minimum Size Tree-decompositions. Electron. Notes Discret. Math. 50: 21-27 (2015) - [j1]Jean-Claude Bermond, Bi Li, Nicolas Nisse, Hervé Rivano, Min-Li Yu:
Data gathering and personalized broadcasting in radio grids with interference. Theor. Comput. Sci. 562: 453-475 (2015) - 2014
- [b1]Bi Li:
Tree decompositions and routing problems. (Décompositions arborescentes et problèmes de routage). University of Nice Sophia Antipolis, France, 2014 - 2012
- [c2]Adrian Kosowski, Bi Li, Nicolas Nisse, Karol Suchan:
k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth. ICALP (2) 2012: 610-622 - 2010
- [c1]Eduardo Álvarez-Miranda, Alfredo Candia-Véjar, Xujin Chen, Xiaodong Hu, Bi Li:
Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data. AAIM 2010: 13-24
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-31 21:06 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
