Felip Manyà

2.3k total citations
76 papers, 776 citations indexed

About

Felip Manyà is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Felip Manyà has authored 76 papers receiving a total of 776 indexed citations (citations by other indexed papers that have themselves been cited), including 54 papers in Artificial Intelligence, 48 papers in Computational Theory and Mathematics and 41 papers in Computer Networks and Communications. Recurrent topics in Felip Manyà's work include Constraint Satisfaction and Optimization (36 papers), Formal Methods in Verification (33 papers) and Logic, Reasoning, and Knowledge (25 papers). Felip Manyà is often cited by papers focused on Constraint Satisfaction and Optimization (36 papers), Formal Methods in Verification (33 papers) and Logic, Reasoning, and Knowledge (25 papers). Felip Manyà collaborates with scholars based in Spain, France and China. Felip Manyà's co-authors include Chu-Min Li, Jordi Planes, Hua Jiang, Carlos Ansótegui, Che‐Ming Li, Ramón Béjar, Josep Argelich, Jordi Levy, Marı́a Luisa Bonet and Reiner Hähnle and has published in prestigious journals such as European Journal of Operational Research, Information Sciences and Artificial Intelligence.

In The Last Decade

Felip Manyà

70 papers receiving 735 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Felip Manyà Spain 17 493 463 381 81 64 76 776
Hervé Marchand France 20 1.1k 2.2× 382 0.8× 532 1.4× 113 1.4× 142 2.2× 88 1.3k
Lakhdar Saïs France 13 250 0.5× 347 0.7× 392 1.0× 64 0.8× 61 1.0× 58 647
Chu-Min Li France 17 313 0.6× 318 0.7× 276 0.7× 31 0.4× 152 2.4× 58 629
Hans Kleine Büning Germany 12 384 0.8× 363 0.8× 147 0.4× 89 1.1× 45 0.7× 59 612
Jussi Rintanen Australia 19 343 0.7× 845 1.8× 271 0.7× 163 2.0× 33 0.5× 57 1.1k
Thom Frühwirth Germany 14 177 0.4× 586 1.3× 379 1.0× 161 2.0× 29 0.5× 69 781
Rosaria Simone France 13 760 1.5× 338 0.7× 312 0.8× 192 2.4× 30 0.5× 54 1.4k
Béatrice Bérard France 11 521 1.1× 256 0.6× 172 0.5× 246 3.0× 47 0.7× 31 760
Michel Reniers Netherlands 18 864 1.8× 488 1.1× 173 0.5× 250 3.1× 121 1.9× 141 1.2k
Enrico Giunchiglia Italy 19 325 0.7× 972 2.1× 253 0.7× 109 1.3× 21 0.3× 71 1.1k

Countries citing papers authored by Felip Manyà

Since Specialization
Citations

This map shows the geographic impact of Felip Manyà'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 Felip Manyà with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Felip Manyà more than expected).

Fields of papers citing papers by Felip Manyà

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Felip Manyà. 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 Felip Manyà. The network helps show where Felip Manyà may publish in the future.

Co-authorship network of co-authors of Felip Manyà

This figure shows the co-authorship network connecting the top 25 collaborators of Felip Manyà. A scholar is included among the top collaborators of Felip Manyà 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 Felip Manyà. Felip Manyà is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Li, Chu-Min, et al.. (2025). Solving weighted Maximum Satisfiability with Branch and Bound and clause learning. Computers & Operations Research. 183. 107195–107195.
2.
Li, Chu-Min, et al.. (2025). Complete tableau calculi for Regular MaxSAT and Regular MinSAT. Cognitive Systems Research. 90. 101319–101319.
3.
He, Kun, et al.. (2024). Integrating multi-armed bandit with local search for MaxSAT. Artificial Intelligence. 338. 104242–104242.
4.
Li, Chu Min, et al.. (2024). A Tableau Calculus for Non-Clausal Regular MaxSAT. SPIRE - Sciences Po Institutional REpository. 137–142. 1 indexed citations
5.
Li, Chu-Min, et al.. (2023). MaxSAT resolution for regular propositional logic. International Journal of Approximate Reasoning. 162. 109010–109010. 3 indexed citations
6.
Ansótegui, Carlos, et al.. (2022). Incomplete MaxSAT approaches for combinatorial testing. Journal of Heuristics. 28(4). 377–431. 14 indexed citations
7.
Li, Chu-Min, et al.. (2019). Clause vivification by unit propagation in CDCL SAT solvers. Artificial Intelligence. 279. 103197–103197. 7 indexed citations
8.
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
9.
Li, Chu Min, Zhu Zhu, Felip Manyà, & Laurent Simon. (2012). Optimizing with minimum satisfiability. Artificial Intelligence. 190. 32–44. 24 indexed citations
10.
Ansótegui, Carlos, Miquel Bofill, Felip Manyà, & Mateu Villaret. (2012). Building Automated Theorem Provers for Infinitely-Valued Logics with Satisfiability Modulo Theory Solvers. 25–30. 12 indexed citations
11.
Ansótegui, Carlos, Marı́a Luisa Bonet, Jordi Levy, & Felip Manyà. (2008). Measuring the hardness of SAT instances. National Conference on Artificial Intelligence. 222–228. 17 indexed citations
12.
Ansótegui, Carlos, Marı́a Luisa Bonet, Jordi Levy, & Felip Manyà. (2007). What Is a Real-World SAT Instance?. 19–28. 1 indexed citations
13.
Ansótegui, Carlos, Marı́a Luisa Bonet, Jordi Levy, & Felip Manyà. (2007). Inference rules for high-order consistency in weighted CSP. National Conference on Artificial Intelligence. 167–172. 3 indexed citations
14.
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
15.
Ansótegui, Carlos, Álvaro del Val, Iván Dotú, Cèsar Fernández, & Felip Manyà. (2004). Modeling choices in quasigroup completion: SAT vs. CSP. National Conference on Artificial Intelligence. 137–142. 16 indexed citations
16.
Manyà, Felip, et al.. (2003). Técnicas de resolución de problemas de satisfacción de restricciones. 7(19). 169–180. 1 indexed citations
17.
Ansótegui, Carlos & Felip Manyà. (2003). Una introducción a los algoritmos de satisfactibilidad. Redalyc (Universidad Autónoma del Estado de México). 7(20). 43–56.
18.
Alsinet, Teresa, Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, & Felip Manyà. (2003). Automated monitoring of medical protocols: a secure and distributed architecture. Artificial Intelligence in Medicine. 27(3). 367–392. 16 indexed citations
19.
Béjar, Ramón & Felip Manyà. (2000). Solving the Round Robin Problem Using Propositional Logic. National Conference on Artificial Intelligence. 262–266. 16 indexed citations
20.
Manyà, Felip, et al.. (1993). ORTOGRAFIA CATALANA I LINGÜÍSTICA COMPUTACIONAL. Dialnet (Universidad de la Rioja). 5(5). 59–70. 1 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

Rankless by CCL
2026