Yuri Faenza

564 total citations
27 papers, 141 citations indexed

About

Yuri Faenza is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Management Science and Operations Research. According to data from OpenAlex, Yuri Faenza has authored 27 papers receiving a total of 141 indexed citations (citations by other indexed papers that have themselves been cited), including 22 papers in Computational Theory and Mathematics, 8 papers in Computer Networks and Communications and 6 papers in Management Science and Operations Research. Recurrent topics in Yuri Faenza's work include Complexity and Algorithms in Graphs (17 papers), Advanced Graph Theory Research (14 papers) and Optimization and Search Problems (6 papers). Yuri Faenza is often cited by papers focused on Complexity and Algorithms in Graphs (17 papers), Advanced Graph Theory Research (14 papers) and Optimization and Search Problems (6 papers). Yuri Faenza collaborates with scholars based in United States, Italy and Switzerland. Yuri Faenza's co-authors include Gautier Stauffer, Gianpaolo Oriolo, Volker Kaibel, Samuel Fiorini, Shipra Agrawal, Yunhao Tang, Telikepalli Kavitha, Hans Raj Tiwary, Marco Di Summa and Michele Conforti and has published in prestigious journals such as Operations Research, Journal of the ACM and Mathematical Programming.

In The Last Decade

Yuri Faenza

25 papers receiving 135 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Yuri Faenza United States 7 92 36 27 23 22 27 141
Rajiv Raman United States 8 105 1.1× 48 1.3× 16 0.6× 12 0.5× 28 1.3× 25 160
Tamás Király Hungary 7 137 1.5× 54 1.5× 50 1.9× 11 0.5× 26 1.2× 36 193
Euiwoong Lee United States 6 70 0.8× 50 1.4× 10 0.4× 4 0.2× 7 0.3× 42 122
Dušan Knop Czechia 7 79 0.9× 32 0.9× 9 0.3× 18 0.8× 7 0.3× 40 111
Frank Gurski Germany 9 144 1.6× 72 2.0× 14 0.5× 26 1.1× 18 0.8× 26 186
Alexander Langer Germany 9 122 1.3× 50 1.4× 12 0.4× 7 0.3× 16 0.7× 16 152
Parinya Chalermsook Germany 7 70 0.8× 53 1.5× 6 0.2× 12 0.5× 6 0.3× 22 128
Ioannis Milis Greece 7 66 0.7× 117 3.3× 16 0.6× 117 5.1× 10 0.5× 20 190
Mordechai Shalom Israel 8 56 0.6× 136 3.8× 77 2.9× 55 2.4× 7 0.3× 45 213
Aris Pagourtzis Greece 7 33 0.4× 74 2.1× 49 1.8× 12 0.5× 3 0.1× 36 146

Countries citing papers authored by Yuri Faenza

Since Specialization
Citations

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

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

20 of 20 papers shown
1.
Balkanski, Eric, et al.. (2023). The Power of Greedy for Online Minimum Cost Matching on the Line. 185–205. 1 indexed citations
2.
Conforti, Michele, et al.. (2022). Slack matrices, k-products, and 2-level polytopes. Discrete Applied Mathematics. 354. 199–213.
3.
Faenza, Yuri, et al.. (2022). Affinely representable lattices, stable matchings, and choice functions. Mathematical Programming. 197(2). 721–760. 3 indexed citations
4.
Faenza, Yuri, et al.. (2022). Legal Assignments and Fast EADAM with Consent via Classic Theory of Stable Matchings. Operations Research. 70(3). 1873–1890. 3 indexed citations
5.
Faenza, Yuri & Telikepalli Kavitha. (2021). Quasi-Popular Matchings, Optimality, and Extended Formulations. Mathematics of Operations Research. 47(1). 427–457. 6 indexed citations
6.
Faenza, Yuri & Telikepalli Kavitha. (2020). Quasi-popular matchings, optimality, and extended formulations. Symposium on Discrete Algorithms. 325–344. 1 indexed citations
7.
Faenza, Yuri, Gonzalo Muñoz, & Sebastian Pokutta. (2020). New limits of treewidth-based tractability in optimization. Mathematical Programming. 191(2). 559–594. 4 indexed citations
8.
Tang, Yunhao, Shipra Agrawal, & Yuri Faenza. (2020). Reinforcement Learning for Integer Programming: Learning to Cut. arXiv (Cornell University). 1. 9367–9376. 11 indexed citations
9.
Bienstock, Daniel, et al.. (2020). On inequalities with bounded coefficients and pitch for the min knapsack polytope. Discrete Optimization. 44. 100567–100567. 2 indexed citations
10.
Faenza, Yuri, Gianpaolo Oriolo, & Gautier Stauffer. (2020). Separation routine and extended formulations for the stable set problem in claw-free graphs. Mathematical Programming. 188(1). 53–84. 1 indexed citations
11.
Conforti, Michele, Marco Di Summa, & Yuri Faenza. (2019). Balas formulation for the union of polytopes is optimal. Mathematical Programming. 180(1-2). 311–326. 6 indexed citations
12.
Faenza, Yuri, et al.. (2018). On 2-Level Polytopes Arising in Combinatorial Settings. SIAM Journal on Discrete Mathematics. 32(3). 1857–1886. 8 indexed citations
13.
Faenza, Yuri, et al.. (2017). On vertices and facets of combinatorial 2-level polytopes. arXiv (Cornell University). 1 indexed citations
14.
Faenza, Yuri & Laura Sanità. (2015). On the existence of compactε-approximated formulations for knapsack in the original space. Operations Research Letters. 43(3). 339–342. 2 indexed citations
15.
Faenza, Yuri, et al.. (2014). Extended formulations, nonnegative factorizations, and randomized communication protocols. Mathematical Programming. 153(1). 75–94. 12 indexed citations
16.
Faenza, Yuri, et al.. (2014). Solving the Stable Set Problem in Terms of the Odd Cycle Packing Number. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 8 indexed citations
17.
Averkov, Gennadiy, Michele Conforti, Alberto Del Pia, Marco Di Summa, & Yuri Faenza. (2013). On the Convergence of the Affine Hull of the Chvátal--Gomory Closures. SIAM Journal on Discrete Mathematics. 27(3). 1492–1502. 1 indexed citations
18.
Faenza, Yuri, et al.. (2011). A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants). Operations Research Letters. 39(3). 213–217. 2 indexed citations
19.
Faenza, Yuri, Gianpaolo Oriolo, & Gautier Stauffer. (2010). The hidden-matching structure of the composition of strips : a polyhedral perspective. Cineca Institutional Research Information System (Tor Vergata University). 3 indexed citations
20.
Faenza, Yuri & Volker Kaibel. (2009). Extended Formulations for Packing and Partitioning Orbitopes. Mathematics of Operations Research. 34(3). 686–697. 16 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