Giacomo Nannicini

3.7k total citations
41 papers, 634 citations indexed

About

Giacomo Nannicini is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Management Science and Operations Research. According to data from OpenAlex, Giacomo Nannicini has authored 41 papers receiving a total of 634 indexed citations (citations by other indexed papers that have themselves been cited), including 14 papers in Computational Theory and Mathematics, 10 papers in Artificial Intelligence and 9 papers in Management Science and Operations Research. Recurrent topics in Giacomo Nannicini's work include Risk and Portfolio Optimization (8 papers), Data Management and Algorithms (6 papers) and Optimization and Search Problems (5 papers). Giacomo Nannicini is often cited by papers focused on Risk and Portfolio Optimization (8 papers), Data Management and Algorithms (6 papers) and Optimization and Search Problems (5 papers). Giacomo Nannicini collaborates with scholars based in United States, Singapore and France. Giacomo Nannicini's co-authors include Alberto Costa, Leo Liberti, Daniel Delling, Thomas Wortmann, Pietro Belotti, Dominik Schultes, Gérard Cornuéjols, Nenad Mladenović, Oktay Günlük and Petar Jurcevic and has published in prestigious journals such as Nanoscale, Operations Research and IEEE Transactions on Knowledge and Data Engineering.

In The Last Decade

Giacomo Nannicini

37 papers receiving 592 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Giacomo Nannicini United States 14 191 144 129 75 71 41 634
D.V. Tošić Serbia 13 72 0.4× 88 0.6× 66 0.5× 37 0.5× 28 0.4× 44 604
Éric Lefèvre France 15 439 2.3× 157 1.1× 46 0.4× 211 2.8× 67 0.9× 47 928
Yunlong Ma China 12 167 0.9× 38 0.3× 47 0.4× 31 0.4× 42 0.6× 56 474
Ranjith Kumar R India 4 357 1.9× 133 0.9× 28 0.2× 60 0.8× 16 0.2× 8 787
Marcel Mongeau France 17 91 0.5× 94 0.7× 42 0.3× 117 1.6× 167 2.4× 46 935
Davood Hajinezhad United States 10 240 1.3× 86 0.6× 21 0.2× 81 1.1× 29 0.4× 12 565
Wenyong Dong China 12 268 1.4× 100 0.7× 17 0.1× 70 0.9× 15 0.2× 40 674
I. Grondman Netherlands 6 349 1.8× 186 1.3× 34 0.3× 269 3.6× 26 0.4× 8 841
Min Lü China 14 77 0.4× 81 0.6× 155 1.2× 41 0.5× 195 2.7× 54 823

Countries citing papers authored by Giacomo Nannicini

Since Specialization
Citations

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

Fields of papers citing papers by Giacomo Nannicini

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Giacomo Nannicini

This figure shows the co-authorship network connecting the top 25 collaborators of Giacomo Nannicini. A scholar is included among the top collaborators of Giacomo Nannicini 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 Giacomo Nannicini. Giacomo Nannicini 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.
Nannicini, Giacomo. (2025). Quantum Algorithms for Optimizers. Society for Industrial and Applied Mathematics eBooks.
2.
Lodi, Andrea, et al.. (2023). A solution algorithm for chance-constrained problems with integer second-stage recourse decisions. Mathematical Programming. 205(1-2). 269–301.
3.
Nannicini, Giacomo, Lev S. Bishop, Oktay Günlük, & Petar Jurcevic. (2022). Optimal Qubit Assignment and Routing via Integer Programming. 4(1). 1–31. 28 indexed citations
4.
Havlíček, Vojtěch, et al.. (2021). Simpler (Classical) and Faster (Quantum) Algorithms for Gibbs Partition Functions. 112–122. 4 indexed citations
5.
Nannicini, Giacomo, et al.. (2020). An exact algorithm for robust influence maximization. Mathematical Programming. 183(1-2). 419–453. 9 indexed citations
6.
Otto, Kevin, Bradley Camburn, Kristin L. Wood, et al.. (2020). Integrated 2D Design in the Curriculum: Effectiveness of Early Cross-Subject Engineering Challenges. Papers on Engineering Education Repository (American Society for Engineering Education). 24.763.1–24.763.18. 2 indexed citations
7.
Lodi, Andrea, Enrico Malaguti, Giacomo Nannicini, & Dimitri Thomopulos. (2019). Nonlinear chance-constrained problems with applications to hydro scheduling. Mathematical Programming. 191(1). 405–444. 7 indexed citations
8.
Nannicini, Giacomo. (2019). Performance of hybrid quantum-classical variational heuristics for combinatorial optimization. Physical review. E. 99(1). 13304–13304. 88 indexed citations
9.
Cornuéjols, Gérard, Leo Liberti, & Giacomo Nannicini. (2018). Improved Strategies for Branching on General Disjunctions. Figshare. 144–145.
10.
Nannicini, Giacomo. (2018). Straggler Mitigation by Delayed Relaunch of Tasks. ACM SIGMETRICS Performance Evaluation Review. 45(3). 248–248. 2 indexed citations
11.
Costa, Alberto & Giacomo Nannicini. (2018). RBFOpt: an open-source library for black-box optimization with costly function evaluations. Mathematical Programming Computation. 10(4). 597–629. 96 indexed citations
12.
Costa, Alberto, et al.. (2017). Efficient Parameter Estimation for Information Retrieval Using Black-Box Optimization. IEEE Transactions on Knowledge and Data Engineering. 30(7). 1240–1253. 8 indexed citations
13.
Halman, Nir, Giacomo Nannicini, & James B. Orlin. (2017). On the complexity of energy storage problems. Discrete Optimization. 28. 31–53. 10 indexed citations
14.
Wortmann, Thomas & Giacomo Nannicini. (2016). Black-Box Optimisation Methods for Architectural Design. Proceedings of the International Conference on Computer-Aided Architectural Design Research in Asia. 177–186. 9 indexed citations
15.
Kalikka, Janne, Xilin Zhou, Jitendra K. Behera, Giacomo Nannicini, & Robert E. Simpson. (2016). Evolutionary design of interfacial phase change van der Waals heterostructures. Nanoscale. 8(42). 18212–18220. 26 indexed citations
16.
D’Ambrosio, Claudia, et al.. (2016). MILP models for the selection of a small set of well-distributed points. Operations Research Letters. 45(1). 46–52. 2 indexed citations
17.
Cornuéjols, Gérard, et al.. (2012). How tight is the corner relaxation? Insights gained from the stable set problem. Discrete Optimization. 9(2). 109–121. 4 indexed citations
18.
Nannicini, Giacomo, Daniel Delling, Leo Liberti, & Dominik Schultes. (2008). Bidirectional A * on Time-dependent Graphs.. 132–135. 1 indexed citations
19.
Nannicini, Giacomo & Leo Liberti. (2008). Shortest paths on dynamic graphs. International Transactions in Operational Research. 15(5). 551–563. 18 indexed citations
20.
Nannicini, Giacomo, Philippe Baptiste, Daniel Krob, & Leo Liberti. (2007). Fast point-to-point shortest path queries on dynamic road networks with interfal data.. 13. 115–118. 1 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