Anita Pasotti
- Electrical and Electronic Engineering
- Artificial Intelligence top 10%
- Computational Theory and Mathematics top 5%
- Discrete Mathematics and Combinatorics top 5%
- Molecular Biology
- Topics
- graph theory and CDMA systems (30 papers)Coding theory and cryptography (11 papers)Graph Labeling and Dimension Problems (11 papers)
- Cited by
- Discrete Mathematics and CombinatoricsComputational Theory and MathematicsArtificial Intelligence
- Partner nations
- ItalyUnited StatesPoland
In The Last Decade
Anita Pasotti
26 papers receiving 228 citations
Peers
Comparison fields: 5 of 20
- Electrical and Electronic Engineering 230
- Artificial Intelligence 161
- Computational Theory and Mathematics 99
- Discrete Mathematics and Combinatorics 65
- Molecular Biology 13
Countries citing papers authored by Anita Pasotti
This map shows the geographic impact of Anita Pasotti'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 Anita Pasotti with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Anita Pasotti more than expected).
Fields of papers citing papers by Anita Pasotti
This network shows the impact of papers produced by Anita Pasotti. 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 Anita Pasotti. The network helps show where Anita Pasotti may publish in the future.
Co-authorship network of co-authors of Anita Pasotti
This figure shows the co-authorship network connecting the top 25 collaborators of Anita Pasotti. A scholar is included among the top collaborators of Anita Pasotti 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 Anita Pasotti. Anita Pasotti is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 1 | |
| 2 | 0 | |
| 3 | 1 | |
| 4 | 3 | |
| 5 | 0 | |
| 6 | 6 | |
| 7 | 1 | |
| 8 | A tour problem on a toroidal board. | 3 |
| 9 | 12 | |
| 10 | 3 | |
| 11 | 2 | |
| 12 | 4 | |
| 13 | 8 | |
| 14 | 1 | |
| 15 | Decompositions of complete multipartite graphs via generalized graceful labelings | 2 |
| 16 | 24 | |
| 17 | 6 | |
| 18 | 46 | |
| 19 | 4 | |
| 20 | Graph decompositions with the use of difference matrices | 19 |
About Anita Pasotti
Anita Pasotti is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Electrical and Electronic Engineering, having authored 30 papers that have together received 241 indexed citations. Recurring topics across this work include graph theory and CDMA systems (30 papers), Coding theory and cryptography (11 papers) and Graph Labeling and Dimension Problems (11 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (65 citations), Computational Theory and Mathematics (99 citations) and Artificial Intelligence (161 citations). Anita Pasotti has collaborated with scholars based in Italy, United States and Poland. Frequent co-authors include Marco Buratti, Koji Momihara, Dianhua Wu and Marco Dalai. Their work appears in journals such as Discrete Mathematics, European Journal of Combinatorics and Designs Codes and Cryptography.
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.