Samuel Fiorini
- Computational Theory and Mathematics top 1%
- Computer Networks and Communications top 10%
- Artificial Intelligence top 10%
- Electrical and Electronic Engineering
- Economics and Econometrics top 10%
- Co-authors
- Sebastian PokuttaHans Raj TiwarySerge MassarGwenaël JoretRonald de WolfJean‐Paul DoignonJean CardinalGábor Braun
- Topics
- Advanced Graph Theory Research (43 papers)Complexity and Algorithms in Graphs (36 papers)graph theory and CDMA systems (14 papers)
- Cited by
- Computational Theory and MathematicsGeneral Decision SciencesDiscrete Mathematics and Combinatorics
- Partner nations
- BelgiumUnited StatesCanada
In The Last Decade
Samuel Fiorini
66 papers receiving 580 citations
Peers
Comparison fields: 5 of 60
- Computational Theory and Mathematics 399
- Computer Networks and Communications 127
- Artificial Intelligence 119
- Electrical and Electronic Engineering 113
- Economics and Econometrics 86
Countries citing papers authored by Samuel Fiorini
This map shows the geographic impact of Samuel Fiorini'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 Samuel Fiorini with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Samuel Fiorini more than expected).
Fields of papers citing papers by Samuel Fiorini
This network shows the impact of papers produced by Samuel Fiorini. 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 Samuel Fiorini. The network helps show where Samuel Fiorini may publish in the future.
Co-authorship network of co-authors of Samuel Fiorini
This figure shows the co-authorship network connecting the top 25 collaborators of Samuel Fiorini. A scholar is included among the top collaborators of Samuel Fiorini 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 Samuel Fiorini. Samuel Fiorini is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 0 | |
| 3 | 6 | |
| 4 | 1 | |
| 5 | 1 | |
| 6 | 1 | |
| 7 | 0 | |
| 8 | 3 | |
| 9 | 3 | |
| 10 | The Price of Connectivity for Vertex Cover: Perfect, Near-Perfect and Critical Graphs | 2 |
| 11 | 4 | |
| 12 | 2 | |
| 13 | Linear vs. Semidefinite Extended Formulations: Exponential Separation and Strong Lower Bounds | 15 |
| 14 | 1 | |
| 15 | 0 | |
| 16 | 14 | |
| 17 | 1 | |
| 18 | 5 | |
| 19 | 5 | |
| 20 | 6 |
About Samuel Fiorini
Samuel Fiorini is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Computer Graphics and Computer-Aided Design, having authored 70 papers that have together received 630 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (43 papers), Complexity and Algorithms in Graphs (36 papers) and graph theory and CDMA systems (14 papers). The work is most often cited by research in Computational Theory and Mathematics (399 citations), General Decision Sciences (46 citations) and Discrete Mathematics and Combinatorics (56 citations). Samuel Fiorini has collaborated with scholars based in Belgium, United States and Canada. Frequent co-authors include Sebastian Pokutta, Hans Raj Tiwary, Serge Massar, Gwenaël Joret, Ronald de Wolf, Jean‐Paul Doignon, Jean Cardinal, Gábor Braun, Dirk Oliver Theis and Thomas Rothvoß. Their work appears in journals such as Journal of the ACM, Mathematical Programming and Mathematics of Operations Research.
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.