Giorgio Lucarelli

25 papers receiving 219 citations

Peers

Giorgio Lucarelli
Comparison fields: 5 of 30
  • Computer Networks and Communications 120
  • Electrical and Electronic Engineering 74
  • Industrial and Manufacturing Engineering 63
  • Information Systems 38
  • Computational Theory and Mathematics 36
Replace C. N. Laws with:
C. N. Laws United Kingdom
Sebastian Hahn Germany
Jacques Malenfant France
Alex Kesselman Israel
Joost P. Warners Netherlands
Christoph Ambühl Switzerland
Zeynep Kiziltan Italy
David Y. Burman United States
S.C. Borst Netherlands
Austin Buchanan United States
Giorgio Lucarelli relative to C. N. Laws United Kingdom C. N. Laws's profile →
Citations per field
00.5×10×13×
C. N. Laws · 1×
Citations per year

Countries citing papers authored by Giorgio Lucarelli

Since Specialization
Citations

This map shows the geographic impact of Giorgio Lucarelli'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 Giorgio Lucarelli with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Giorgio Lucarelli more than expected).

Fields of papers citing papers by Giorgio Lucarelli

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Giorgio Lucarelli. 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 Giorgio Lucarelli. The network helps show where Giorgio Lucarelli may publish in the future.

Co-authorship network of co-authors of Giorgio Lucarelli

This figure shows the co-authorship network connecting the top 25 collaborators of Giorgio Lucarelli. A scholar is included among the top collaborators of Giorgio Lucarelli 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 Giorgio Lucarelli. Giorgio Lucarelli is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
#WorkIndexed citations
1 0
2 0
3 3
4 1
5 6
6 39
7 5
8
A new on-line method for scheduling independent tasks
1
9 9
10 7
11 18
12 34
13 7
14 1
15 3
16 28
17 4
18 4
19 7
20 4

About Giorgio Lucarelli

Giorgio Lucarelli is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Discrete Mathematics and Combinatorics, having authored 27 papers that have together received 249 indexed citations. Recurring topics across this work include Scheduling and Optimization Algorithms (11 papers), Optimization and Search Problems (10 papers) and Advanced Graph Theory Research (6 papers). The work is most often cited by research in Industrial and Manufacturing Engineering (63 citations), Computer Networks and Communications (120 citations) and Management Science and Operations Research (33 citations). Giorgio Lucarelli has collaborated with scholars based in France, Greece and United States. Frequent co-authors include Evripidis Bampis, Matteo Borrotti, Dimitrios Letsios, Vangélis Th. Paschos, Adlen Ksentini, Pantelis A. Frangoudis, Iyad Katib, George N. Rouskas, Ioannis Milis and Alexander Kononov. Their work appears in journals such as European Journal of Operational Research, ACM Computing Surveys and Journal of Lightwave Technology.

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.

Explore authors with similar magnitude of impact

Rankless by CCL
2026