Graciela Nasini
About
In The Last Decade
Graciela Nasini
43 papers receiving 219 citations
Peers
Comparison fields: 5 of 31
- Computational Theory and Mathematics 150
- Control and Systems Engineering 48
- Industrial and Manufacturing Engineering 47
- Discrete Mathematics and Combinatorics 37
- Electrical and Electronic Engineering 36
Countries citing papers authored by Graciela Nasini
This map shows the geographic impact of Graciela Nasini'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 Graciela Nasini with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Graciela Nasini more than expected).
Fields of papers citing papers by Graciela Nasini
This network shows the impact of papers produced by Graciela Nasini. 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 Graciela Nasini. The network helps show where Graciela Nasini may publish in the future.
Co-authorship network of co-authors of Graciela Nasini
This figure shows the co-authorship network connecting the top 25 collaborators of Graciela Nasini. A scholar is included among the top collaborators of Graciela Nasini 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 Graciela Nasini. Graciela Nasini is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 2 | |
| 3 | 2 | |
| 4 | 1 | |
| 5 | 3 | |
| 6 | A graph theoretical model for the total balancedness of combinatorial games. M. | 1 |
| 7 | 8 | |
| 8 | 14 | |
| 9 | 2 | |
| 10 | 0 | |
| 11 | 7 | |
| 12 | Recognizing Edge-Perfect Graphs: some Polynomial Instances. | 4 |
| 13 | 4 | |
| 14 | 1 | |
| 15 | 4 | |
| 16 | 4 | |
| 17 | ON THE RELATIONSHIP BETWEEN DISJUNCTIVE RELAXATIONS AND MINORS IN PACKING AND COVERING PROBLEMS | 3 |
| 18 | 8 | |
| 19 | 6 | |
| 20 | 27 |
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.