Jordi Petit
About
In The Last Decade
Jordi Petit
39 papers receiving 696 citations
Hit Papers
Peers
Comparison fields: 5 of 75
- Computer Networks and Communications 310
- Computational Theory and Mathematics 264
- Electrical and Electronic Engineering 164
- Computer Vision and Pattern Recognition 113
- Artificial Intelligence 113
Countries citing papers authored by Jordi Petit
This map shows the geographic impact of Jordi Petit'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 Jordi Petit with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jordi Petit more than expected).
Fields of papers citing papers by Jordi Petit
This network shows the impact of papers produced by Jordi Petit. 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 Jordi Petit. The network helps show where Jordi Petit may publish in the future.
Co-authorship network of co-authors of Jordi Petit
This figure shows the co-authorship network connecting the top 25 collaborators of Jordi Petit. A scholar is included among the top collaborators of Jordi Petit 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 Jordi Petit. Jordi Petit is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 7 | |
| 2 | 1 | |
| 3 | 8 | |
| 4 | 1 | |
| 5 | Addenda to the Survey of Layout Problems | 11 |
| 6 | Fun in CS2 | 1 |
| 7 | 1 | |
| 8 | 1 | |
| 9 | Generic parallel implementations for Tabu Search | 1 |
| 10 | A distributed algorithm to find Hamiltonian cycles in G(n, p) random graphs | 5 |
| 11 | De la peligrosidad social a las siglas LGBT | 1 |
| 12 | 12 | |
| 13 | 36 | |
| 14 | 9 | |
| 15 | 6 | |
| 16 | Routing Tree Problems on Random Graphs. | 2 |
| 17 | Heuristics for the MinLA problem: an empirical and theoretical analysis | 1 |
| 18 | Programming frames for the efficient use of parallel systems | 3 |
| 19 | Approximation heuristics and benchmarkings for the MinLA problem | 11 |
| 20 | Combining spectral sequencing with simulated annealing for the MinLA problem: sequential and parallel heuristics | 4 |
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.