Countries citing papers authored by Carlos Ansótegui
Since
Specialization
Citations
This map shows the geographic impact of Carlos Ansótegui'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 Carlos Ansótegui with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Carlos Ansótegui more than expected).
Fields of papers citing papers by Carlos Ansótegui
This network shows the impact of papers produced by Carlos Ansótegui. 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 Carlos Ansótegui. The network helps show where Carlos Ansótegui may publish in the future.
Co-authorship network of co-authors of Carlos Ansótegui
This figure shows the co-authorship network connecting the top 25 collaborators of Carlos Ansótegui.
A scholar is included among the top collaborators of Carlos Ansótegui 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 Carlos Ansótegui. Carlos Ansótegui is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
López-Sánchez, Maite, Juan A. Rodríguez-Aguilar, Filippo Bistaffa, et al.. (2023). Encoding Ethics to Compute Value-Aligned Norms. Minds and Machines. 33(4). 761–790.2 indexed citations
López-Sánchez, Maite, et al.. (2018). Moral Values in Norm Decision Making. DIGITAL.CSIC (Spanish National Research Council (CSIC)). 1294–1302.10 indexed citations
6.
Ansótegui, Carlos, Yuri Malitsky, Horst Samulowitz, Meinolf Sellmann, & Kevin Tierney. (2015). Model-based genetic algorithms for algorithm configuration. International Conference on Artificial Intelligence. 733–739.38 indexed citations
7.
Ansótegui, Carlos, et al.. (2013). Solving (Weighted) Partial MaxSAT with ILP.. 403–409.24 indexed citations
8.
Ansótegui, Carlos, et al.. (2011). Satisfiability Modulo Theories: An Efficient Approach for the Resource-Constrained Project Scheduling Problem.11 indexed citations
Ansótegui, Carlos, Marı́a Luisa Bonet, & Jordi Levy. (2009). Towards industrial-like random SAT instances. International Joint Conference on Artificial Intelligence. 387–392.20 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, Ramón Béjar, Cèsar Fernández, & Carles Mateu. (2008). Generating hard SAT/CSP instances using expander graphs. National Conference on Artificial Intelligence. 1442–1443.
13.
Ansótegui, Carlos, Marı́a Luisa Bonet, Jordi Levy, & Felip Manyà. (2007). What Is a Real-World SAT Instance?. 19–28.1 indexed citations
14.
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
15.
Ansótegui, Carlos, Ramón Béjar, Cèsar Fernández, & Carles Mateu. (2007). On balanced CSPs with high treewidth. National Conference on Artificial Intelligence. 50(3). 161–166.2 indexed citations
16.
Ansótegui, Carlos, Ramón Béjar, Cèsar Fernández, Carla P. Gomes, & Carles Mateu. (2006). The impact of balancing on problem hardness in a highly structured domain. National Conference on Artificial Intelligence. 10–15.6 indexed citations
17.
Sellmann, Meinolf & Carlos Ansótegui. (2006). Disco - Novo - GoGo: integrating local search and complete search with restarts. National Conference on Artificial Intelligence. 1051–1056.8 indexed citations
18.
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
19.
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.
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.