Yuri Faenza
- Computational Theory and Mathematics top 5%
- Computer Networks and Communications
- Electrical and Electronic Engineering
- Industrial and Manufacturing Engineering
- Discrete Mathematics and Combinatorics top 10%
- Co-authors
- Gianpaolo OrioloGautier StaufferVolker KaibelTelikepalli KavithaShipra AgrawalYunhao TangSamuel FioriniHans Raj Tiwary
- Topics
- Complexity and Algorithms in Graphs (17 papers)Advanced Graph Theory Research (14 papers)Optimization and Search Problems (6 papers)
- Cited by
- Discrete Mathematics and CombinatoricsComputational Theory and MathematicsComputer Graphics and Computer-Aided Design
- Partner nations
- United StatesItalySwitzerland
In The Last Decade
Yuri Faenza
25 papers receiving 135 citations
Peers
Comparison fields: 5 of 33
- Computational Theory and Mathematics 92
- Computer Networks and Communications 36
- Electrical and Electronic Engineering 27
- Industrial and Manufacturing Engineering 23
- Discrete Mathematics and Combinatorics 22
Countries citing papers authored by Yuri Faenza
This map shows the geographic impact of Yuri Faenza'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 Yuri Faenza with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Yuri Faenza more than expected).
Fields of papers citing papers by Yuri Faenza
This network shows the impact of papers produced by Yuri Faenza. 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 Yuri Faenza. The network helps show where Yuri Faenza may publish in the future.
Co-authorship network of co-authors of Yuri Faenza
This figure shows the co-authorship network connecting the top 25 collaborators of Yuri Faenza. A scholar is included among the top collaborators of Yuri Faenza 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 Yuri Faenza. Yuri Faenza is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 1 | |
| 2 | 0 | |
| 3 | 3 | |
| 4 | 3 | |
| 5 | 6 | |
| 6 | 4 | |
| 7 | Reinforcement Learning for Integer Programming: Learning to Cut | 11 |
| 8 | 1 | |
| 9 | 2 | |
| 10 | 1 | |
| 11 | 6 | |
| 12 | 3 | |
| 13 | On vertices and facets of combinatorial 2-level polytopes | 1 |
| 14 | 2 | |
| 15 | 12 | |
| 16 | 8 | |
| 17 | 1 | |
| 18 | 2 | |
| 19 | The hidden-matching structure of the composition of strips : a polyhedral perspective | 3 |
| 20 | 16 |
About Yuri Faenza
Yuri Faenza is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Computer Graphics and Computer-Aided Design, having authored 27 papers that have together received 141 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (17 papers), Advanced Graph Theory Research (14 papers) and Optimization and Search Problems (6 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (22 citations), Computational Theory and Mathematics (92 citations) and Computer Graphics and Computer-Aided Design (12 citations). Yuri Faenza has collaborated with scholars based in United States, Italy and Switzerland. Frequent co-authors include Gianpaolo Oriolo, Gautier Stauffer, Volker Kaibel, Telikepalli Kavitha, Shipra Agrawal, Yunhao Tang, Samuel Fiorini, Hans Raj Tiwary, Michele Conforti and Marco Di Summa. Their work appears in journals such as Operations Research, Journal of the ACM and Mathematical Programming.
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.