default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBohan Li 0002
Person information
- affiliation: State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China
Other persons with the same name
- Bohan Li — disambiguation page
- Bohan Li 0001
![[0000-0002-3408-9037]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-3408-9037")
— Nanjing University of Aeronautics and Astronautics, College of Computer Science and Technology, China - Bohan Li 0003 — Microsoft Azure Speech, China
- Bohan Li 0004 — Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China
- Bohan Li 0005 — University of Southampton, UK
- Bohan Li 0006 — Google, Mountain View, CA, USA (and 1 more)
- Bohan Li 0007 — Tianjin Polytechnic University, School of Computer Science and Technology, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j2]Shaowei Cai, Bohan Li, Xindi Zhang:
Local Search For Satisfiability Modulo Integer Arithmetic Theories. ACM Trans. Comput. Log. 24(4): 32:1-32:26 (2023)- 2021
- [j1]Xindi Zhang, Bohan Li, Shaowei Cai, Yiyuan Wang:
Efficient Local Search based on Dynamic Connectivity Maintenance for Minimum Connected Dominating Set. J. Artif. Intell. Res. 71: 89-119 (2021)
Conference and Workshop Papers
- 2024
- [c7]Xiang He, Bohan Li, Mengyu Zhao, Shaowei Cai:
A Local Search Algorithm for MaxSMT(LIA). FM (1) 2024: 55-72 - [c6]Xindi Zhang, Bohan Li, Shaowei Cai:
Deep Combination of CDCL(T) and Local Search for Satisfiability Modulo Non-Linear Integer Arithmetic Theory. ICSE 2024: 125:1-125:13 - [c5]Zhonghan Wang, Bohua Zhan, Bohan Li, Shaowei Cai:
Efficient Local Search for Nonlinear Real Arithmetic. VMCAI (1) 2024: 326-349 - 2023
- [c4]Bohan Li, Shaowei Cai:
Local Search For SMT On Linear and Multi-linear Real Arithmetic. FMCAD 2023: 1-10 - 2022
- [c3]Shaowei Cai, Bohan Li, Xindi Zhang:
Local Search for SMT on Linear Integer Arithmetic. CAV (2) 2022: 227-248 - 2021
- [c2]Bohan Li, Kai Wang, Yiyuan Wang, Shaowei Cai:
Improving Local Search for Minimum Weighted Connected Dominating Set Problem by Inner-Layer Local Search. CP 2021: 39:1-39:16 - 2020
- [c1]Bohan Li, Xindi Zhang, Shaowei Cai, Jinkun Lin, Yiyuan Wang, Christian Blum:
NuCDS: An Efficient Local Search Algorithm for Minimum Connected Dominating Set. IJCAI 2020: 1503-1510
Informal and Other Publications
- 2024
- [i4]Xiang He, Bohan Li, Mengyu Zhao, Shaowei Cai:
A Local Search Algorithm for MaxSMT(LIA). CoRR abs/2406.15782 (2024) - 2023
- [i3]Bohan Li, Shaowei Cai:
Local Search For SMT On Linear and Multilinear Real Arithmetic. CoRR abs/2303.06676 (2023) - [i2]Zhonghan Wang, Bohua Zhan, Bohan Li, Shaowei Cai:
Efficient Local Search for Nonlinear Real Arithmetic. CoRR abs/2311.14249 (2023) - 2022
- [i1]Shaowei Cai, Bohan Li, Xindi Zhang:
Local Search For Satisfiability Modulo Integer Arithmetic Theories. CoRR abs/2211.10219 (2022)
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-11-14 00:56 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:
