


default search action
Mao Luo
Person information
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j6]Mao Luo, Huigang Qin, Xinyun Wu
, Caiquan Xiong:
A novel local search approach with connected dominating degree-based incremental neighborhood evaluation for the minimum 2-connected dominating set problem. J. Comb. Optim. 47(5): 72 (2024) - [j5]Huihui Pan
, Mao Luo
, Jue Wang
, Tenglong Huang
, Weichao Sun
:
A Safe Motion Planning and Reliable Control Framework for Autonomous Vehicles. IEEE Trans. Intell. Veh. 9(4): 4780-4793 (2024) - [c3]Mao Luo, Jiao Xiong, Ningning He, Caiquan Xiong, Xinyun Wu, Jun Wu:
An In-Label Prioritizing Variable Branching Strategy of SAT Solvers for a Preferred Extension of Argumentation Frameworks. PRICAI (5) 2024: 216-231 - 2023
- [c2]Shuolin Li, Chu-Min Li, Mao Luo, Jordi Coll, Djamal Habet, Felip Manyà:
A New Variable Ordering for In-processing Bounded Variable Elimination in SAT Solvers. IJCAI 2023: 1979-1987 - 2022
- [j4]Mao Luo, Chumin Li, Xinyun Wu, Shuolin Li, Zhipeng Lv:
Branching Strategy Selection Approach Based on Vivification Ratio. Int. J. Softw. Informatics 12(1): 131-151 (2022) - 2021
- [i2]Mao Luo, Chu-Min Li, Xinyun Wu, Shuolin Li, Zhipeng Lü:
Branching Strategy Selection Approach Based on Vivification Ratio. CoRR abs/2112.06917 (2021) - 2020
- [j3]Chu-Min Li
, Fan Xiao
, Mao Luo, Felip Manyà
, Zhipeng Lü, Yu Li:
Clause vivification by unit propagation in CDCL SAT solvers. Artif. Intell. 279 (2020)
2010 – 2019
- 2019
- [j2]Wei Shi
, Jianhua Chen
, Mao Luo, Min Chen:
High efficiency referential genome compression algorithm. Bioinform. 35(12): 2058-2065 (2019) - [j1]Fan Xiao, Chu-Min Li, Mao Luo, Felip Manyà
, Zhipeng Lü, Yu Li:
A branching heuristic for SAT solvers based on complete implication graphs. Sci. China Inf. Sci. 62(7): 72103:1-72103:13 (2019) - 2018
- [i1]Chu-Min Li, Fan Xiao, Mao Luo, Felip Manyà, Zhipeng Lü, Yu Li:
Clause Vivification by Unit Propagation in CDCL SAT Solvers. CoRR abs/1807.11061 (2018) - 2017
- [c1]Mao Luo, Chu-Min Li, Fan Xiao, Felip Manyà, Zhipeng Lü:
An Effective Learnt Clause Minimization Approach for CDCL SAT Solvers. IJCAI 2017: 703-711
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 2025-01-21 00:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint