Chu-Min Li

1.3k total citations
58 papers, 629 citations indexed

About

Chu-Min Li is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Artificial Intelligence. According to data from OpenAlex, Chu-Min Li has authored 58 papers receiving a total of 629 indexed citations (citations by other indexed papers that have themselves been cited), including 29 papers in Computer Networks and Communications, 29 papers in Computational Theory and Mathematics and 28 papers in Artificial Intelligence. Recurrent topics in Chu-Min Li's work include Constraint Satisfaction and Optimization (18 papers), Formal Methods in Verification (15 papers) and Vehicle Routing Optimization Methods (13 papers). Chu-Min Li is often cited by papers focused on Constraint Satisfaction and Optimization (18 papers), Formal Methods in Verification (15 papers) and Vehicle Routing Optimization Methods (13 papers). Chu-Min Li collaborates with scholars based in France, China and Spain. Chu-Min Li's co-authors include Felip Manyà, Hua Jiang, Zhe Quan, Jordi Planes, Kun He, Yanli Liu, Han Lin, Kaile Su, Jin Yan and Zhipeng Lü and has published in prestigious journals such as European Journal of Operational Research, Expert Systems with Applications and IEEE Access.

In The Last Decade

Chu-Min Li

52 papers receiving 604 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Chu-Min Li France	17	318	313	276	152	64	58	629
Jeffery Westbrook United States	17	223 0.7×	356 1.1×	479 1.7×	84 0.6×	56 0.9×	34	766
Frédéric Benhamou France	10	244 0.8×	284 0.9×	298 1.1×	39 0.3×	34 0.5×	25	600
Daniele Frigioni Italy	14	132 0.4×	151 0.5×	253 0.9×	88 0.6×	16 0.3×	57	581
Elias Dahlhaus Germany	13	157 0.5×	618 2.0×	287 1.0×	114 0.8×	21 0.3×	45	937
Shyam Sundar India	12	203 0.6×	99 0.3×	130 0.5×	246 1.6×	42 0.7×	31	500
Guido Proietti Italy	14	95 0.3×	209 0.7×	259 0.9×	49 0.3×	51 0.8×	68	543
Kurt Rohloff United States	19	521 1.6×	314 1.0×	353 1.3×	49 0.3×	22 0.3×	56	887
Byung Ro Moon South Korea	11	226 0.7×	119 0.4×	111 0.4×	103 0.7×	17 0.3×	19	498
Friedrich Eisenbrand Switzerland	16	85 0.3×	418 1.3×	188 0.7×	161 1.1×	27 0.4×	62	688

Countries citing papers authored by Chu-Min Li

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authorship network of co-authors of Chu-Min Li

This figure shows the co-authorship network connecting the top 25 collaborators of Chu-Min Li. A scholar is included among the top collaborators of Chu-Min Li based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Chu-Min Li. Chu-Min Li is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Li, Chu-Min, et al.. (2025). Solving weighted Maximum Satisfiability with Branch and Bound and clause learning. Computers & Operations Research. 183. 107195–107195.

Li, Chu-Min, et al.. (2025). Complete tableau calculi for Regular MaxSAT and Regular MinSAT. Cognitive Systems Research. 90. 101319–101319.

He, Kun, et al.. (2024). Integrating multi-armed bandit with local search for MaxSAT. Artificial Intelligence. 338. 104242–104242.

He, Kun, et al.. (2024). An efficient solution space exploring and descent method for packing equal spheres in a sphere. Computers & Operations Research. 164. 106522–106522. 4 indexed citations

Du, Yuming, et al.. (2024). Threshold-Based Responsive Simulated Annealing for Directed Feedback Vertex Set Problem. Proceedings of the AAAI Conference on Artificial Intelligence. 38(18). 20856–20864.

Lü, Zhipeng, et al.. (2023). A vertex weighting-based double-tabu search algorithm for the classical p-center problem. Computers & Operations Research. 160. 106373–106373. 2 indexed citations

Li, Chu-Min, et al.. (2023). MaxSAT resolution for regular propositional logic. International Journal of Approximate Reasoning. 162. 109010–109010. 3 indexed citations

Li, Chu-Min, et al.. (2023). On solving simplified diversified top-k s-plex problem. Computers & Operations Research. 153. 106187–106187. 1 indexed citations

Liu, Yanli, et al.. (2023). Hybrid Learning with New Value Function for the Maximum Common Induced Subgraph Problem. Proceedings of the AAAI Conference on Artificial Intelligence. 37(4). 4044–4051. 1 indexed citations

10.

Li, Chu-Min, et al.. (2022). Branching Strategy Selection Approach Based on Vivification Ratio. 12(1). 131–151. 1 indexed citations

11.

He, Kun, et al.. (2021). Combining Reinforcement Learning with Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem. Proceedings of the AAAI Conference on Artificial Intelligence. 35(14). 12445–12452. 37 indexed citations

12.

Liu, Xiaolu, et al.. (2020). Effective Approaches to Solve P-Center Problem via Set Covering and SAT. IEEE Access. 8. 161232–161244. 2 indexed citations

13.

Li, Chu-Min, et al.. (2019). Clause vivification by unit propagation in CDCL SAT solvers. Artificial Intelligence. 279. 103197–103197. 7 indexed citations

14.

Lucet, Corinne, et al.. (2017). Minimum sum coloring problem: Upper bounds for the chromatic strength. Discrete Applied Mathematics. 233. 71–82. 3 indexed citations

15.

He, Kun, et al.. (2017). An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules. Computers & Operations Research. 86. 110–123. 6 indexed citations

16.

Jiang, Hua, Chu-Min Li, & Felip Manyà. (2017). An Exact Algorithm for the Maximum Weight Clique Problem in Large Graphs. Proceedings of the AAAI Conference on Artificial Intelligence. 31(1). 47 indexed citations

17.

Lin, Han, Kaile Su, & Chu-Min Li. (2008). Within-problem learning for efficient lower bound computation in Max-SAT solving. Griffith Research Online (Griffith University, Queensland, Australia). 351–356. 33 indexed citations

18.

Li, Chu-Min, Felip Manyà, & Jordi Planes. (2006). Detecting disjoint inconsistent subformulas for computing lower bounds for Max-SAT. National Conference on Artificial Intelligence. 86–91. 39 indexed citations

19.

Li, Chu-Min. (2003). Equivalent literal propagation in the DLL procedure. Discrete Applied Mathematics. 130(2). 251–276. 7 indexed citations

20.

Li, Chu-Min, et al.. (1997). Look-Ahead Versus Look-Back for Satisfiability Problems. 16 indexed citations

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.

Explore authors with similar magnitude of impact