Citations per year, relative to Mats Carlsson Mats Carlsson (= 1×)
peers
Lambert Meertens
Countries citing papers authored by Mats Carlsson
Since
Specialization
Citations
This map shows the geographic impact of Mats Carlsson'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 Mats Carlsson with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Mats Carlsson more than expected).
This network shows the impact of papers produced by Mats Carlsson. 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 Mats Carlsson. The network helps show where Mats Carlsson may publish in the future.
Co-authorship network of co-authors of Mats Carlsson
This figure shows the co-authorship network connecting the top 25 collaborators of Mats Carlsson.
A scholar is included among the top collaborators of Mats Carlsson 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 Mats Carlsson. Mats Carlsson is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Carlsson, Mats, et al.. (2014). Protocol log analysis with constraint programming : Work in progress. KTH Publication Database DiVA (KTH Royal Institute of Technology). 17–26.
4.
Hnich, Brahim, Mats Carlsson, François Fages, & Francesca Rossi. (2006). Recent Advances in Constraints: Joint ERCIM/CoLogNET International Workshopon Constraint Solving and Constraint Logic Programming, CSCLP 2005Uppsala, Sweden, ... / Lecture Notes in Artificial Intelligence). Springer eBooks.1 indexed citations
5.
Carlsson, Mats & Nicolas Beldiceanu. (2004). Dispensation Order Generation for Pyrosequencing. ERCIM news/ERCIM news online edition. 29. 327–332.2 indexed citations
6.
Ågren, Magnus S., et al.. (2002). Tracing and explaining execution of CLP(FD) programs. KTH Publication Database DiVA (KTH Royal Institute of Technology). 1–16.
Gupta, Gopal, Enrico Pontelli, Khayri A. M. Ali, Mats Carlsson, & Manuel V. Hermenegildo. (2001). Parallel execution of prolog programs. ACM Transactions on Programming Languages and Systems. 23(4). 472–602.67 indexed citations
Carlsson, Mats & Mats Grindal. (1993). Automatic frequency assignment for cellular telephones using constraint satisfaction techniques. KTH Publication Database DiVA (KTH Royal Institute of Technology). 647–665.10 indexed citations
Carlsson, Mats. (1989). On the Efficiency of Optimising Shallow Backtracking in Compiled Prolog. International Conference on Lightning Protection. 3–16.7 indexed citations
15.
Carlsson, Mats, et al.. (1988). A Simplified Approach to the Implementation of AND-Parallelism in an OR-Parallel Environment.. International Conference on Lightning Protection. 1565–1577.3 indexed citations
16.
Carlsson, Mats. (1987). Freeze, indexing, and other implementation issues in the WAM. International Conference on Lightning Protection. 40–58.31 indexed citations
17.
Carlsson, Mats. (1985). A Microcoded Unifier for Lisp Machine Prolog.. 162–171.1 indexed citations
18.
Kahn, Ken & Mats Carlsson. (1984). The Compilation of Prolog Programs without the Use of a Prolog Compiler.. Future Generation Computer Systems. 348–355.16 indexed citations
19.
Carlsson, Mats. (1984). On Implementing Prolog in Functional Programming.. 154–159.2 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.