Yuri Faenza

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 56

Top Topics

Bipartite Graph

Knapsack Problem

Communication Protocol

Top Venues

Oper. Res. Lett.

Publications

Manuel Aprile, Michele Conforti, Samuel Fiorini, Yuri Faenza, Tony Huynh, Marco Macchia
Slack matrices, k-products, and 2-level polytopes. Discret. Appl. Math. 354 (2024)
Yuri Faenza, Cliff Stein, Jia Wan
Von Neumann-Morgenstern Stability and Internal Closedness in Matching Theory. IPCO (2024)
Yuri Faenza, Luca Ferrarini
The total matching polytope of complete bipartite graphs. Oper. Res. Lett. 56 (2024)
Yuri Faenza, Ayoub Foussoul, Chengyue He
Two-Stage Stochastic Stable Matching. IPCO (2024)
Eric Balkanski, Christopher En, Yuri Faenza
An Algorithm for the Assignment Game Beyond Additive Valuations. CoRR (2024)
Eric Balkanski, Yuri Faenza, Mathieu Kubik
The simultaneous semi-random model for TSP. Math. Program. 206 (1) (2024)
Yuri Faenza, Swati Gupta, Xuan Zhang
Discovering Opportunities in New York City's Discovery Program: Disadvantaged Students in Highly Competitive Markets. EC (2023)
Yuri Faenza, Danny Segev, Lingyi Zhang
Approximation algorithms for the generalized incremental knapsack problem. Math. Program. 198 (1) (2023)
Yuri Faenza, Chengyue He, Jay Sethuraman
Scarf's algorithm and stable marriages. CoRR (2023)
Yuri Faenza, Luca Ferrarini
The Total Matching Polytope of Complete Bipartite Graphs. CoRR (2023)
Eric Balkanski, Yuri Faenza, Noémie Périvier
The Power of Greedy for Online Minimum Cost Matching on the Line. EC (2023)
Yuri Faenza, Xuan Zhang
Affinely representable lattices, stable matchings, and choice functions. Math. Program. 197 (2) (2023)
Federico D'Onofrio, Yuri Faenza, Lingyi Zhang
The Incremental Knapsack Problem with Monotone Submodular All-or-Nothing Profits. CoRR (2023)
Yuri Faenza, Xuan Zhang
Legal Assignments and Fast EADAM with Consent via Classic Theory of Stable Matchings. Oper. Res. 70 (3) (2022)
Yuri Faenza, Gonzalo Muñoz, Sebastian Pokutta
New limits of treewidth-based tractability in optimization. Math. Program. 191 (2) (2022)
Yuri Faenza, Swati Gupta, Xuan Zhang
Discovering Opportunities in New York City's Discovery Program: an Analysis of Affirmative Action Mechanisms. CoRR (2022)
Eric Balkanski, Yuri Faenza, Noémie Périvier
The Power of Greedy for Online Minimum Cost Matching on the Line. CoRR (2022)
Daniel Bienstock, Yuri Faenza, Igor Malinovic, Monaldo Mastrolilli, Ola Svensson, Mark Zuckerberg
On inequalities with bounded coefficients and pitch for the min knapsack polytope. Discret. Optim. 44 (Part) (2022)
Ágnes Cseh, Yuri Faenza, Telikepalli Kavitha, Vladlena Powers
Understanding Popular Matchings via Stable Matchings. SIAM J. Discret. Math. 36 (1) (2022)
Eric Balkanski, Yuri Faenza, Mathieu Kubik
The Simultaneous Semi-random Model for TSP. IPCO (2022)
Yuri Faenza, Clifford Stein, Jia Wan
Internal Closedness and von Neumann-Morgenstern Stability in Matching Theory: Structures and Complexity. CoRR (2022)
Yuri Faenza, Telikepalli Kavitha
Quasi-Popular Matchings, Optimality, and Extended Formulations. Math. Oper. Res. 47 (1) (2022)
Daniel Bienstock, Yuri Faenza, Xuan Zhang
Pitch, extension complexity, and covering problems. Oper. Res. Lett. 49 (3) (2021)
Yuri Faenza, Ioannis Mourtos, Michalis Samaris, Jay Sethuraman
(Un)stable matchings with blocking costs. Oper. Res. Lett. 49 (5) (2021)
Manuel Aprile, Michele Conforti, Yuri Faenza, Samuel Fiorini, Tony Huynh, Marco Macchia
Slack matrices, k-products, and 2-level polytopes. CoRR (2021)
Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer
Separation routine and extended formulations for the stable set problem in claw-free graphs. Math. Program. 188 (1) (2021)
Yuri Faenza, Xuan Zhang
Affinely Representable Lattices, Stable Matchings, and Choice Functions. IPCO (2021)
Yuri Faenza, Telikepalli Kavitha
Quasi-popular Matchings, Optimality, and Extended Formulations. SODA (2020)
Yuri Faenza, Swati Gupta, Xuan Zhang
Impact of Bias on School Admissions and Targeted Interventions. CoRR (2020)
Manuel Aprile, Michele Conforti, Yuri Faenza, Samuel Fiorini, Tony Huynh, Marco Macchia
Recognizing Cartesian products of matrices and polytopes. CoRR (2020)
Manuel Aprile, Yuri Faenza
Extended formulations from communication protocols in output-efficient time. Math. Program. 183 (1) (2020)
Yuri Faenza, Danny Segev, Lingyi Zhang
Approximation Algorithms for The Generalized Incremental Knapsack Problem. CoRR (2020)
Michele Conforti, Marco Di Summa, Yuri Faenza
Balas formulation for the union of polytopes is optimal. Math. Program. 180 (1) (2020)
Yuri Faenza, Xuan Zhang
Affinely representable lattices, stable matchings, and choice functions. CoRR (2020)
Yunhao Tang, Shipra Agrawal, Yuri Faenza
Reinforcement Learning for Integer Programming: Learning to Cut. ICML (2020)
Yuri Faenza, Telikepalli Kavitha
Quasi-popular Matchings, Optimality, and Extended Formulations. CoRR (2019)
Yunhao Tang, Shipra Agrawal, Yuri Faenza
Reinforcement Learning for Integer Programming: Learning to Cut. CoRR (2019)
Adam Bohn, Yuri Faenza, Samuel Fiorini, Vissarion Fisikopoulos, Marco Macchia, Kanstantsin Pashkovich
Enumeration of 2-level polytopes. Math. Program. Comput. 11 (1) (2019)
Manuel Aprile, Yuri Faenza
Extended Formulations from Communication Protocols in Output-Efficient Time. IPCO (2019)
Yuri Faenza, Telikepalli Kavitha, Vladlena Powers, Xingyu Zhang
Popular Matchings and Limits to Tractability. SODA (2019)
Ágnes Cseh, Yuri Faenza, Telikepalli Kavitha, Vladlena Powers
Popularity, stability, and the dominant matching polytope. CoRR (2018)
Yuri Faenza, Xuan Zhang
Legal Assignments and fast EADAM with consent via classical theory of stable matchings. CoRR (2018)
Yuri Faenza, Telikepalli Kavitha, Vladlena Powers, Xingyu Zhang
Popular Matchings and Limits to Tractability. CoRR (2018)
Yuri Faenza, Igor Malinovic
A PTAS for the Time-Invariant Incremental Knapsack Problem. ISCO (2018)
Manuel Aprile, Alfonso Cevallos, Yuri Faenza
On 2-Level Polytopes Arising in Combinatorial Settings. SIAM J. Discret. Math. 32 (3) (2018)
Yuri Faenza, Igor Malinovic, Monaldo Mastrolilli, Ola Svensson
On bounded pitch inequalities for the min-knapsack polytope. CoRR (2018)
Manuel Aprile, Yuri Faenza
Extended formulations from communication protocols in output-efficient time. CoRR (2018)
Yuri Faenza, Gonzalo Muñoz, Sebastian Pokutta
Limits of Treewidth-based tractability in Optimization. CoRR (2018)
Yuri Faenza, Igor Malinovic, Monaldo Mastrolilli, Ola Svensson
On Bounded Pitch Inequalities for the Min-Knapsack Polytope. ISCO (2018)
Yuri Faenza, Vladlena Powers, Xingyu Zhang
Two-sided popular matchings in bipartite graphs with forbidden/forced elements and weights. CoRR (2018)
Yuri Faenza, Igor Malinovic
Improved approximation algorithms and disjunctive relaxations for some knapsack problems. CoRR (2017)
Manuel Aprile, Yuri Faenza, Samuel Fiorini, Tony Huynh, Marco Macchia
Extension Complexity of Stable Set Polytopes of Bipartite Graphs. WG (2017)
Adam Bohn, Yuri Faenza, Samuel Fiorini, Vissarion Fisikopoulos, Marco Macchia, Kanstantsin Pashkovich
Enumeration of 2-level polytopes. CoRR (2017)
Manuel Aprile, Yuri Faenza, Samuel Fiorini, Tony Huynh, Marco Macchia
Extension complexity of stable set polytopes of bipartite graphs. CoRR (2017)
Manuel Aprile, Alfonso Cevallos, Yuri Faenza
On vertices and facets of combinatorial 2-level polytopes. CoRR (2017)
Manuel Aprile, Alfonso Cevallos, Yuri Faenza
On Vertices and Facets of Combinatorial 2-Level Polytopes. ISCO (2016)
Marco Di Summa, Friedrich Eisenbrand, Yuri Faenza, Carsten Moldenhauer
On largest volume simplices and sub-determinants. SODA (2015)
Yuri Faenza, Samuel Fiorini, Roland Grappe, Hans Raj Tiwary
Extended formulations, nonnegative factorizations, and randomized communication protocols. Math. Program. 153 (1) (2015)
Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza, Roland Grappe
Reverse Chvátal-Gomory Rank. SIAM J. Discret. Math. 29 (1) (2015)
Yuri Faenza, Laura Sanità
On the existence of compact ε-approximated formulations for knapsack in the original space. Oper. Res. Lett. 43 (3) (2015)
Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza
Reverse split rank. Math. Program. 154 (1-2) (2015)
Yuri Faenza, Laura Sanità
On the existence of compact ε-approximated formulations for knapsack in the original space. CoRR (2015)
Adam Bohn, Yuri Faenza, Samuel Fiorini, Vissarion Fisikopoulos, Marco Macchia, Kanstantsin Pashkovich
Enumeration of 2-Level Polytopes. ESA (2015)
Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza
Reverse Split Rank. CoRR (2014)
Marco Di Summa, Friedrich Eisenbrand, Yuri Faenza, Carsten Moldenhauer
On largest volume simplices and sub-determinants. CoRR (2014)
Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer
Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition. J. ACM 61 (4) (2014)
Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza
Reverse Split Rank. IPCO (2014)
Adrian Bock, Yuri Faenza, Carsten Moldenhauer, Andres J. Ruiz-Vargas
Solving the Stable Set Problem in Terms of the Odd Cycle Packing Number. FSTTCS (2014)
Gennadiy Averkov, Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza
On the Convergence of the Affine Hull of the Chvátal-Gomory Closures. SIAM J. Discret. Math. 27 (3) (2013)
Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza, Roland Grappe
Reverse Chvátal-Gomory Rank. IPCO (2013)
Yuri Faenza, Samuel Fiorini, Roland Grappe, Hans Raj Tiwary
Extended Formulations, Nonnegative Factorizations, and Randomized Communication Protocols. ISCO (2012)
Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer
Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs. SODA (2012)
Flavia Bonomo, Yuri Faenza, Gianpaolo Oriolo
On coloring problems with local constraints. Discret. Math. 312 (12-13) (2012)
Yuri Faenza, Gianpaolo Oriolo, Claudia Snels
A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants). Oper. Res. Lett. 39 (3) (2011)
Yuri Faenza, Gianpaolo Oriolo, Claudia Snels
A fast algorithm to remove proper and homogenous pairs of cliques (while preserving some graph invariants) CoRR (2011)
Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer
)-algorithm for the weighted stable set problem. SODA (2011)
Yuri Faenza, Samuel Fiorini, Roland Grappe, Hans Raj Tiwary
Extended formulations, non-negative factorizations and randomized communication protocols CoRR (2011)
Yuri Faenza, Volker Kaibel
Extended Formulations for Packing and Partitioning Orbitopes. Math. Oper. Res. 34 (3) (2009)
Flavia Bonomo, Yuri Faenza, Gianpaolo Oriolo
On coloring problems with local constraints. Electron. Notes Discret. Math. 35 (2009)