Chu-Min Li
Impact in
-
- Formal Methods in Verification
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
-
- Vehicle Routing Optimization Methods
Papers in
-
- Formal Methods in Verification 21
- Complexity and Algorithms in Graphs 11
- Advanced Graph Theory Research 7
-
- Constraint Satisfaction and Optimization 22
- Optimization and Search Problems 14
- Co-authors
- Felip Manyà (25 shared papers)Hua Jiang (10 shared papers)Zhe Quan (2 shared papers)Jordi Planes (3 shared papers)Kun He (11 shared papers)Kaile Su (1 shared paper)Han Lin (1 shared paper)Josep Argelich (3 shared papers)
In The Last Decade
Chu-Min Li
63 papers receiving 838 citations
Peers
Comparison fields: 5 of 59
- Computational Theory and Mathematics 473
- Industrial and Manufacturing Engineering 173
- Computer Networks and Communications 384
- Software 59
- Artificial Intelligence 441
Countries citing papers authored by Chu-Min Li
This map shows the geographic impact of Chu-Min Li's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Chu-Min Li with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Chu-Min Li more than expected).
Fields of papers citing papers by Chu-Min Li
This network shows the impact of papers produced by Chu-Min Li. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Chu-Min Li. The network helps show where Chu-Min Li may publish in the future.
Co-authors
The 25 scholars most cited alongside Chu-Min Li, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 67 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2010 | 81 | |
| 2 | Detecting disjoint inconsistent subformulas for computing lower bounds for Max-SAT | 2006 | 55 |
| 3 | 2017 | 55 | |
| 4 | 2017 | 53 | |
| 5 | 2021 | 45 | |
| 6 | 2008 | 45 | |
| 7 | Within-problem learning for efficient lower bound computation in Max-SAT solving | 2008 | 41 |
| 8 | 2017 | 39 | |
| 9 | 2010 | 34 | |
| 10 | 2022 | 31 | |
| 11 | 2017 | 25 | |
| 12 | 2019 | 22 | |
| 13 | 2014 | 22 | |
| 14 | 2018 | 21 | |
| 15 | 2019 | 18 | |
| 16 | Look-Ahead Versus Look-Back for Satisfiability Problems | 1997 | 17 |
| 17 | 2018 | 17 | |
| 18 | 2003 | 16 | |
| 19 | 2007 | 14 | |
| 20 | 2014 | 13 |
About Chu-Min Li
Chu-Min Li is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications, Artificial Intelligence, Industrial and Manufacturing Engineering and Management Science and Operations Research, having authored 67 papers that have together received 858 indexed citations. Recurring topics across this work include Constraint Satisfaction and Optimization (22 papers), Formal Methods in Verification (21 papers), Optimization and Search Problems (14 papers), Vehicle Routing Optimization Methods (13 papers), Complexity and Algorithms in Graphs (11 papers), Logic, programming, and type systems (7 papers), Advanced Graph Theory Research (7 papers) and Logic, Reasoning, and Knowledge (7 papers). The work is most often cited by research in Computational Theory and Mathematics (473 citations), Industrial and Manufacturing Engineering (173 citations), Computer Networks and Communications (384 citations), Software (59 citations) and Artificial Intelligence (441 citations). Chu-Min Li has collaborated with scholars based in France, China and Spain. Frequent co-authors include Felip Manyà, Hua Jiang, Zhe Quan, Jordi Planes, Kun He, Kaile Su, Han Lin, Josep Argelich, Yanli Liu and Zhipeng Lü. Their work appears in journals such as Computers & Operations Research, Science China Information Sciences, Discrete Applied Mathematics, Artificial Intelligence and Expert Systems with Applications.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.