Giorgio Lucarelli

763 total citations
27 papers, 249 citations indexed

About

Giorgio Lucarelli is a scholar working on Computer Networks and Communications, Industrial and Manufacturing Engineering and Computational Theory and Mathematics. According to data from OpenAlex, Giorgio Lucarelli has authored 27 papers receiving a total of 249 indexed citations (citations by other indexed papers that have themselves been cited), including 16 papers in Computer Networks and Communications, 11 papers in Industrial and Manufacturing Engineering and 7 papers in Computational Theory and Mathematics. Recurrent topics in Giorgio Lucarelli's work include Scheduling and Optimization Algorithms (11 papers), Optimization and Search Problems (10 papers) and Advanced Graph Theory Research (6 papers). Giorgio Lucarelli is often cited by papers focused on Scheduling and Optimization Algorithms (11 papers), Optimization and Search Problems (10 papers) and Advanced Graph Theory Research (6 papers). Giorgio Lucarelli collaborates with scholars based in France, Greece and Russia. Giorgio Lucarelli's co-authors include Evripidis Bampis, Matteo Borrotti, Dimitrios Letsios, Vangélis Th. Paschos, Pantelis A. Frangoudis, Iyad Katib, Adlen Ksentini, George N. Rouskas, Ioannis Milis and Alexander Kononov and has published in prestigious journals such as European Journal of Operational Research, ACM Computing Surveys and Journal of Lightwave Technology.

In The Last Decade

Giorgio Lucarelli

25 papers receiving 219 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Giorgio Lucarelli France 9 120 74 63 38 36 27 249
C. N. Laws United Kingdom 7 181 1.5× 151 2.0× 33 0.5× 10 0.3× 25 0.7× 9 315
Sebastian Hahn Germany 7 148 1.2× 24 0.3× 21 0.3× 33 0.9× 35 1.0× 11 311
Alex Kesselman Israel 12 416 3.5× 161 2.2× 16 0.3× 30 0.8× 41 1.1× 33 487
Christoph Ambühl Switzerland 9 171 1.4× 17 0.2× 44 0.7× 15 0.4× 114 3.2× 15 279
Joost P. Warners Netherlands 9 165 1.4× 25 0.3× 40 0.6× 17 0.4× 177 4.9× 16 307
Austin Buchanan United States 10 64 0.5× 30 0.4× 48 0.8× 4 0.1× 116 3.2× 22 245
David Y. Burman United States 9 190 1.6× 98 1.3× 78 1.2× 7 0.2× 50 1.4× 11 463
Christine T. Cheng United States 9 55 0.5× 20 0.3× 7 0.1× 27 0.7× 82 2.3× 28 207
Phillip G. Bradford United States 9 106 0.9× 26 0.4× 7 0.1× 72 1.9× 40 1.1× 43 212
Yaakov Kogan United States 10 182 1.5× 128 1.7× 6 0.1× 8 0.2× 21 0.6× 29 291

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
1.
Kacem, Imed, et al.. (2024). Min–max relative regret for scheduling to minimize maximum lateness. Annals of Operations Research. 351(1). 751–778.
2.
Bampis, Evripidis, et al.. (2023). Non-Clairvoyant Makespan Minimization Scheduling with Predictions. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics).
3.
Bampis, Evripidis, et al.. (2022). Scheduling with Untrusted Predictions. Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence. 4581–4587. 3 indexed citations
4.
Kacem, Imed, et al.. (2021). Exact algorithms for scheduling programs with shared tasks. Journal of Combinatorial Optimization. 43(5). 1602–1627. 1 indexed citations
5.
Beaumont, Olivier, Louis-Claude Canon, Lionel Eyraud‐Dubois, et al.. (2020). Scheduling on Two Types of Resources. ACM Computing Surveys. 53(3). 1–36. 6 indexed citations
6.
Lucarelli, Giorgio, et al.. (2018). Generic algorithms for scheduling applications on heterogeneous platforms. Concurrency and Computation Practice and Experience. 31(15). 2 indexed citations
7.
Bourgeois, Nicolas, et al.. (2017). Exact and superpolynomial approximation algorithms for the densest k-subgraph problem. European Journal of Operational Research. 262(3). 894–903. 5 indexed citations
8.
Albers, Susanne, et al.. (2017). Scheduling on power-heterogeneous processors. Information and Computation. 257. 22–33. 9 indexed citations
9.
Lucarelli, Giorgio, et al.. (2017). A new on-line method for scheduling independent tasks. HAL (Le Centre pour la Communication Scientifique Directe). 1 indexed citations
10.
Frangoudis, Pantelis A., et al.. (2017). Balancing between Cost and Availability for CDNaaS Resource Placement. 1–7. 7 indexed citations
11.
Bampis, Evripidis, Alexander Kononov, Dimitrios Letsios, Giorgio Lucarelli, & Maxim Sviridenko. (2016). Energy-efficient scheduling and routing via randomized rounding. Journal of Scheduling. 21(1). 35–51. 15 indexed citations
12.
Bampis, Evripidis, Dimitrios Letsios, & Giorgio Lucarelli. (2015). Green scheduling, flows and matchings. Theoretical Computer Science. 579. 126–136. 18 indexed citations
13.
Bampis, Evripidis, et al.. (2014). On Routing and Spectrum Assignment in Rings. Journal of Lightwave Technology. 33(1). 151–160. 7 indexed citations
14.
Bampis, Evripidis, Alexander Kononov, Giorgio Lucarelli, & Ioannis Milis. (2013). Bounded max-colorings of graphs. Journal of Discrete Algorithms. 26. 56–68. 1 indexed citations
15.
Bampis, Evripidis, Dimitrios Letsios, Giorgio Lucarelli, Evangelos Markakis, & Ioannis Milis. (2013). On multiprocessor temperature-aware scheduling problems. Journal of Scheduling. 16(5). 529–538. 3 indexed citations
16.
Ausiello, Giorgio, et al.. (2012). Online maximum -coverage. Discrete Applied Mathematics. 160(13-14). 1901–1913. 28 indexed citations
17.
Lucarelli, Giorgio & Ioannis Milis. (2011). Improved approximation algorithms for the Max Edge-Coloring problem. Information Processing Letters. 111(16). 819–823. 4 indexed citations
18.
Bourgeois, Nicolas, Giorgio Lucarelli, Ioannis Milis, & Vangélis Th. Paschos. (2010). Approximating the max-edge-coloring problem. Theoretical Computer Science. 411(34-36). 3055–3067. 4 indexed citations
19.
Bourgeois, Nicolas, et al.. (2010). The max quasi-independent set problem. Journal of Combinatorial Optimization. 23(1). 94–117. 7 indexed citations
20.
Lucarelli, Giorgio, Ioannis Milis, & Vangélis Th. Paschos. (2009). On the max-weight edge coloring problem. Journal of Combinatorial Optimization. 20(4). 429–442. 4 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.

Explore authors with similar magnitude of impact

Rankless by CCL
2026