Bruno Simeone

3.2k total citations
83 papers, 1.7k citations indexed

About

Bruno Simeone is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Bruno Simeone has authored 83 papers receiving a total of 1.7k indexed citations (citations by other indexed papers that have themselves been cited), including 49 papers in Computational Theory and Mathematics, 18 papers in Computer Networks and Communications and 14 papers in Artificial Intelligence. Recurrent topics in Bruno Simeone's work include Advanced Graph Theory Research (31 papers), Complexity and Algorithms in Graphs (21 papers) and Optimization and Search Problems (11 papers). Bruno Simeone is often cited by papers focused on Advanced Graph Theory Research (31 papers), Complexity and Algorithms in Graphs (21 papers) and Optimization and Search Problems (11 papers). Bruno Simeone collaborates with scholars based in Italy, United States and Canada. Bruno Simeone's co-authors include Federica Ricca, P. L. Hammer, Peter L. Hammer, Pierre Hansen, Andrea Scozzari, Uri N. Peled, Brigitte Jaumard, Friedrich Pukelsheim, Yves Crama and Sándor Szedmák and has published in prestigious journals such as European Journal of Operational Research, Annals of the New York Academy of Sciences and Lecture notes in mathematics.

In The Last Decade

Bruno Simeone

79 papers receiving 1.6k citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Bruno Simeone Italy 23 797 339 314 258 223 83 1.7k
Bernhard Körte Germany 16 717 0.9× 279 0.8× 582 1.9× 332 1.3× 120 0.5× 40 1.9k
Satoru Fujishige Japan 21 1.1k 1.4× 418 1.2× 580 1.8× 117 0.5× 254 1.1× 131 1.9k
M. R. Rao United States 27 689 0.9× 217 0.6× 306 1.0× 901 3.5× 142 0.6× 69 2.2k
Endre Boros United States 30 1.4k 1.8× 1.2k 3.4× 420 1.3× 283 1.1× 170 0.8× 195 3.1k
R. Chandrasekaran United States 23 384 0.5× 439 1.3× 630 2.0× 269 1.0× 62 0.3× 116 1.7k
Robert E. Bixby United States 27 980 1.2× 534 1.6× 563 1.8× 875 3.4× 112 0.5× 56 2.6k
Kathrin Klamroth Germany 26 681 0.9× 343 1.0× 196 0.6× 616 2.4× 68 0.3× 93 2.2k
MohammadTaghi Hajiaghayi United States 25 1.0k 1.3× 292 0.9× 1.1k 3.4× 121 0.5× 156 0.7× 124 2.1k
Giorgio Gallo Italy 23 453 0.6× 278 0.8× 378 1.2× 664 2.6× 39 0.2× 56 1.9k
Chaitanya Swamy Canada 24 282 0.4× 300 0.9× 656 2.1× 222 0.9× 213 1.0× 57 1.6k

Countries citing papers authored by Bruno Simeone

Since Specialization
Citations

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

Fields of papers citing papers by Bruno Simeone

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Bruno Simeone

This figure shows the co-authorship network connecting the top 25 collaborators of Bruno Simeone. A scholar is included among the top collaborators of Bruno Simeone 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 Bruno Simeone. Bruno Simeone 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.
Simeone, Bruno, et al.. (2013). The maximum vertex coverage problem on bipartite graphs. Discrete Applied Mathematics. 165. 37–48. 23 indexed citations
2.
Simeone, Bruno, et al.. (2008). Computing sharp bounds for hard clustering problems on trees. Discrete Applied Mathematics. 157(5). 991–1008. 3 indexed citations
3.
Boros, Endre, Yves Crama, & Bruno Simeone. (2007). Peter Ladislaw Hammer. Discrete Mathematics. 307(17-18). 2153–2155. 1 indexed citations
4.
Simeone, Bruno, et al.. (2006). Mathematics and democracy : recent advances in voting systems and collective choice. OPUS (Augsburg University). 31 indexed citations
5.
Hammer, Peter L., Alexander Kogan, Bruno Simeone, & Sándor Szedmák. (2004). Pareto-optimal patterns in logical analysis of data. Discrete Applied Mathematics. 144(1-2). 79–102. 67 indexed citations
6.
Alexe, Gabriela, Sorin Alexe, Yves Crama, et al.. (2004). Consensus algorithms for the generation of all maximal bicliques. Discrete Applied Mathematics. 145(1). 11–21. 121 indexed citations
7.
Simeone, Bruno, et al.. (1998). A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid. Discrete Applied Mathematics. 81(1-3). 69–91. 16 indexed citations
8.
Hansen, Pierre, Brigitte Jaumard, & Bruno Simeone. (1996). Polynomial Algorithms for Nested Univariate Clustering. Les Cahiers du GERAD. 1–15. 1 indexed citations
9.
Simeone, Bruno, et al.. (1996). Path Composition and Multiple Choice in a Bimodal Transportation Network. Volume 2: Modelling Transport Systems. 7 indexed citations
10.
Liu, Yanpei, et al.. (1996). A graph partition problem. Acta Mathematicae Applicatae Sinica English Series. 12(4). 393–400. 1 indexed citations
11.
Simeone, Bruno, et al.. (1995). A spanning tree heuristic for regional clustering. Communication in Statistics- Theory and Methods. 24(3). 625–639. 27 indexed citations
12.
Peled, Uri N. & Bruno Simeone. (1994). An O(nm)-time algorithm for computing the dual of a regular Boolean function. Discrete Applied Mathematics. 49(1-3). 309–323. 26 indexed citations
13.
Hansen, Pierre, et al.. (1993). Maximum Split Clustering Under Connectivity Constraints. Les Cahiers du GERAD. 1–34. 3 indexed citations
14.
Perl, Yehoshua, et al.. (1993). Most uniform path partitioning and its use in image processing. Discrete Applied Mathematics. 42(2-3). 227–256. 40 indexed citations
15.
Petreschi, Rossella, et al.. (1991). ON THEORETICAL RESULTS OF AT MOST 1-EMBEDDABILITY OF GRAPHS. 中国科学通报:英文版. 1054–1055.
16.
Hansen, Pierre, et al.. (1990). On the equivalence of paved-duality and standard linearization in nonlinear 0–1 optimization. Discrete Applied Mathematics. 29(2-3). 187–193. 14 indexed citations
17.
Simeone, Bruno, et al.. (1989). Combinatorial Optimization. Lecture notes in mathematics. 5 indexed citations
18.
Simeone, Bruno. (1986). An asymptotically exact polynomial algorithm for equipartition problems. Discrete Applied Mathematics. 14(3). 283–293. 7 indexed citations
19.
Peled, Uri N. & Bruno Simeone. (1985). Polynomial-time algorithms for regular set-covering and threshold synthesis. Discrete Applied Mathematics. 12(1). 57–69. 55 indexed citations
20.
Petreschi, Rossella, et al.. (1984). Degree sequences of matrogenic graphs. Discrete Mathematics. 51(1). 47–61. 14 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