default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYuri Faenza
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j27]Manuel Aprile
, Michele Conforti, Samuel Fiorini, Yuri Faenza, Tony Huynh, Marco Macchia:
Slack matrices, k-products, and 2-level polytopes. Discret. Appl. Math. 354: 199-213 (2024)- [j26]Eric Balkanski, Yuri Faenza, Mathieu Kubik:
The simultaneous semi-random model for TSP. Math. Program. 206(1): 305-332 (2024) - [j25]Yuri Faenza, Luca Ferrarini:
The total matching polytope of complete bipartite graphs. Oper. Res. Lett. 56: 107144 (2024) - [c22]Yuri Faenza, Ayoub Foussoul, Chengyue He:
Two-Stage Stochastic Stable Matching. IPCO 2024: 154-167 - [c21]Yuri Faenza, Cliff Stein, Jia Wan:
Von Neumann-Morgenstern Stability and Internal Closedness in Matching Theory. IPCO 2024: 168-181 - [i30]Eric Balkanski, Christopher En, Yuri Faenza:
An Algorithm for the Assignment Game Beyond Additive Valuations. CoRR abs/2406.13620 (2024) - 2023
- [j24]Yuri Faenza, Xuan Zhang:
Affinely representable lattices, stable matchings, and choice functions. Math. Program. 197(2): 721-760 (2023) - [j23]Yuri Faenza, Danny Segev, Lingyi Zhang:
Approximation algorithms for the generalized incremental knapsack problem. Math. Program. 198(1): 27-83 (2023) - [c20]Eric Balkanski, Yuri Faenza, Noémie Périvier:
The Power of Greedy for Online Minimum Cost Matching on the Line. EC 2023: 185-205 - [c19]Yuri Faenza, Swati Gupta, Xuan Zhang:
Discovering Opportunities in New York City's Discovery Program: Disadvantaged Students in Highly Competitive Markets. EC 2023: 585 - [i29]Yuri Faenza, Luca Ferrarini:
The Total Matching Polytope of Complete Bipartite Graphs. CoRR abs/2303.00328 (2023) - [i28]Yuri Faenza, Chengyue He, Jay Sethuraman:
Scarf's algorithm and stable marriages. CoRR abs/2303.00791 (2023) - [i27]Federico D'Onofrio, Yuri Faenza, Lingyi Zhang:
The Incremental Knapsack Problem with Monotone Submodular All-or-Nothing Profits. CoRR abs/2304.12967 (2023) - 2022
- [j22]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): 100567 (2022) - [j21]Yuri Faenza, Xuan Zhang:
Legal Assignments and Fast EADAM with Consent via Classic Theory of Stable Matchings. Oper. Res. 70(3): 1873-1890 (2022) - [j20]Yuri Faenza, Telikepalli Kavitha:
Quasi-Popular Matchings, Optimality, and Extended Formulations. Math. Oper. Res. 47(1): 427-457 (2022) - [j19]Yuri Faenza, Gonzalo Muñoz, Sebastian Pokutta:
New limits of treewidth-based tractability in optimization. Math. Program. 191(2): 559-594 (2022) - [j18]Ágnes Cseh, Yuri Faenza, Telikepalli Kavitha, Vladlena Powers:
Understanding Popular Matchings via Stable Matchings. SIAM J. Discret. Math. 36(1): 188-213 (2022) - [c18]Eric Balkanski, Yuri Faenza, Mathieu Kubik:
The Simultaneous Semi-random Model for TSP. IPCO 2022: 43-56 - [i26]Yuri Faenza, Swati Gupta, Xuan Zhang:
Discovering Opportunities in New York City's Discovery Program: an Analysis of Affirmative Action Mechanisms. CoRR abs/2203.00544 (2022) - [i25]Eric Balkanski, Yuri Faenza, Noémie Périvier:
The Power of Greedy for Online Minimum Cost Matching on the Line. CoRR abs/2210.03166 (2022) - [i24]Yuri Faenza, Clifford Stein, Jia Wan:
Internal Closedness and von Neumann-Morgenstern Stability in Matching Theory: Structures and Complexity. CoRR abs/2211.17050 (2022) - 2021
- [j17]Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer:
Separation routine and extended formulations for the stable set problem in claw-free graphs. Math. Program. 188(1): 53-84 (2021) - [j16]Daniel Bienstock, Yuri Faenza, Xuan Zhang:
Pitch, extension complexity, and covering problems. Oper. Res. Lett. 49(3): 357-364 (2021) - [j15]Yuri Faenza, Ioannis Mourtos, Michalis Samaris, Jay Sethuraman:
(Un)stable matchings with blocking costs. Oper. Res. Lett. 49(5): 655-662 (2021) - [c17]Yuri Faenza, Xuan Zhang:
Affinely Representable Lattices, Stable Matchings, and Choice Functions. IPCO 2021: 89-103 - [i23]Manuel Aprile, Michele Conforti, Yuri Faenza, Samuel Fiorini, Tony Huynh, Marco Macchia:
Slack matrices, k-products, and 2-level polytopes. CoRR abs/2106.12829 (2021) - 2020
- [j14]Michele Conforti, Marco Di Summa, Yuri Faenza:
Balas formulation for the union of polytopes is optimal. Math. Program. 180(1): 311-326 (2020) - [j13]Manuel Aprile, Yuri Faenza:
Extended formulations from communication protocols in output-efficient time. Math. Program. 183(1): 41-59 (2020) - [c16]Yunhao Tang, Shipra Agrawal, Yuri Faenza:
Reinforcement Learning for Integer Programming: Learning to Cut. ICML 2020: 9367-9376 - [c15]Yuri Faenza, Telikepalli Kavitha:
Quasi-popular Matchings, Optimality, and Extended Formulations. SODA 2020: 325-344 - [i22]Manuel Aprile, Michele Conforti, Yuri Faenza, Samuel Fiorini, Tony Huynh, Marco Macchia:
Recognizing Cartesian products of matrices and polytopes. CoRR abs/2002.02264 (2020) - [i21]Yuri Faenza, Swati Gupta, Xuan Zhang:
Impact of Bias on School Admissions and Targeted Interventions. CoRR abs/2004.10846 (2020) - [i20]Yuri Faenza, Danny Segev, Lingyi Zhang:
Approximation Algorithms for The Generalized Incremental Knapsack Problem. CoRR abs/2009.07248 (2020) - [i19]Yuri Faenza, Xuan Zhang:
Affinely representable lattices, stable matchings, and choice functions. CoRR abs/2011.06763 (2020)
2010 – 2019
- 2019
- [j12]Adam Bohn, Yuri Faenza, Samuel Fiorini, Vissarion Fisikopoulos, Marco Macchia, Kanstantsin Pashkovich:
Enumeration of 2-level polytopes. Math. Program. Comput. 11(1): 173-210 (2019) - [c14]Manuel Aprile, Yuri Faenza:
Extended Formulations from Communication Protocols in Output-Efficient Time. IPCO 2019: 43-56 - [c13]Yuri Faenza, Telikepalli Kavitha, Vladlena Powers, Xingyu Zhang:
Popular Matchings and Limits to Tractability. SODA 2019: 2790-2809 - [i18]Yuri Faenza, Telikepalli Kavitha:
Quasi-popular Matchings, Optimality, and Extended Formulations. CoRR abs/1904.05974 (2019) - [i17]Yunhao Tang, Shipra Agrawal, Yuri Faenza:
Reinforcement Learning for Integer Programming: Learning to Cut. CoRR abs/1906.04859 (2019) - 2018
- [j11]Manuel Aprile, Alfonso Cevallos, Yuri Faenza:
On 2-Level Polytopes Arising in Combinatorial Settings. SIAM J. Discret. Math. 32(3): 1857-1886 (2018) - [c12]Yuri Faenza, Igor Malinovic:
A PTAS for the Time-Invariant Incremental Knapsack Problem. ISCO 2018: 157-169 - [c11]Yuri Faenza, Igor Malinovic, Monaldo Mastrolilli, Ola Svensson:
On Bounded Pitch Inequalities for the Min-Knapsack Polytope. ISCO 2018: 170-182 - [i16]Yuri Faenza, Igor Malinovic, Monaldo Mastrolilli, Ola Svensson:
On bounded pitch inequalities for the min-knapsack polytope. CoRR abs/1801.08850 (2018) - [i15]Yuri Faenza, Vladlena Powers, Xingyu Zhang:
Two-sided popular matchings in bipartite graphs with forbidden/forced elements and weights. CoRR abs/1803.01478 (2018) - [i14]Yuri Faenza, Telikepalli Kavitha, Vladlena Powers, Xingyu Zhang:
Popular Matchings and Limits to Tractability. CoRR abs/1805.11473 (2018) - [i13]Yuri Faenza, Gonzalo Muñoz, Sebastian Pokutta:
Limits of Treewidth-based tractability in Optimization. CoRR abs/1807.02551 (2018) - [i12]Yuri Faenza, Xuan Zhang:
Legal Assignments and fast EADAM with consent via classical theory of stable matchings. CoRR abs/1809.08506 (2018) - [i11]Ágnes Cseh, Yuri Faenza, Telikepalli Kavitha, Vladlena Powers:
Popularity, stability, and the dominant matching polytope. CoRR abs/1811.06897 (2018) - [i10]Manuel Aprile, Yuri Faenza:
Extended formulations from communication protocols in output-efficient time. CoRR abs/1811.08529 (2018) - 2017
- [c10]Manuel Aprile, Yuri Faenza, Samuel Fiorini, Tony Huynh, Marco Macchia:
Extension Complexity of Stable Set Polytopes of Bipartite Graphs. WG 2017: 75-87 - [i9]Yuri Faenza, Igor Malinovic:
Improved approximation algorithms and disjunctive relaxations for some knapsack problems. CoRR abs/1701.07299 (2017) - [i8]Manuel Aprile, Alfonso Cevallos, Yuri Faenza:
On vertices and facets of combinatorial 2-level polytopes. CoRR abs/1702.03187 (2017) - [i7]Manuel Aprile, Yuri Faenza, Samuel Fiorini, Tony Huynh, Marco Macchia:
Extension complexity of stable set polytopes of bipartite graphs. CoRR abs/1702.08741 (2017) - [i6]Adam Bohn, Yuri Faenza, Samuel Fiorini, Vissarion Fisikopoulos, Marco Macchia, Kanstantsin Pashkovich:
Enumeration of 2-level polytopes. CoRR abs/1703.01943 (2017) - 2016
- [c9]Manuel Aprile, Alfonso Cevallos, Yuri Faenza:
On Vertices and Facets of Combinatorial 2-Level Polytopes. ISCO 2016: 177-188 - 2015
- [j10]Yuri Faenza, Samuel Fiorini, Roland Grappe, Hans Raj Tiwary:
Extended formulations, nonnegative factorizations, and randomized communication protocols. Math. Program. 153(1): 75-94 (2015) - [j9]Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza:
Reverse split rank. Math. Program. 154(1-2): 273-303 (2015) - [j8]Yuri Faenza, Laura Sanità:
On the existence of compact ε-approximated formulations for knapsack in the original space. Oper. Res. Lett. 43(3): 339-342 (2015) - [j7]Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza, Roland Grappe:
Reverse Chvátal-Gomory Rank. SIAM J. Discret. Math. 29(1): 166-181 (2015) - [c8]Adam Bohn, Yuri Faenza, Samuel Fiorini, Vissarion Fisikopoulos, Marco Macchia, Kanstantsin Pashkovich:
Enumeration of 2-Level Polytopes. ESA 2015: 191-202 - [c7]Marco Di Summa, Friedrich Eisenbrand, Yuri Faenza, Carsten Moldenhauer:
On largest volume simplices and sub-determinants. SODA 2015: 315-323 - [i5]Yuri Faenza, Laura Sanità:
On the existence of compact ε-approximated formulations for knapsack in the original space. CoRR abs/1503.04717 (2015) - 2014
- [j6]Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer:
Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition. J. ACM 61(4): 20:1-20:41 (2014) - [c6]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: 187-198 - [c5]Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza:
Reverse Split Rank. IPCO 2014: 234-248 - [i4]Marco Di Summa, Friedrich Eisenbrand, Yuri Faenza, Carsten Moldenhauer:
On largest volume simplices and sub-determinants. CoRR abs/1406.3512 (2014) - [i3]Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza:
Reverse Split Rank. CoRR abs/1407.2034 (2014) - 2013
- [j5]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): 1492-1502 (2013) - [c4]Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza, Roland Grappe:
Reverse Chvátal-Gomory Rank. IPCO 2013: 133-144 - 2012
- [j4]Flavia Bonomo, Yuri Faenza, Gianpaolo Oriolo:
On coloring problems with local constraints. Discret. Math. 312(12-13): 2027-2039 (2012) - [c3]Yuri Faenza, Samuel Fiorini, Roland Grappe, Hans Raj Tiwary:
Extended Formulations, Nonnegative Factorizations, and Randomized Communication Protocols. ISCO 2012: 129-140 - [c2]Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer:
Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs. SODA 2012: 1298-1308 - 2011
- [j3]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): 213-217 (2011) - [c1]Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer:
An algorithmic decomposition of claw-free graphs leading to an O(n3)-algorithm for the weighted stable set problem. SODA 2011: 630-646 - [i2]Yuri Faenza, Gianpaolo Oriolo, Claudia Snels:
A fast algorithm to remove proper and homogenous pairs of cliques (while preserving some graph invariants). CoRR abs/1103.2601 (2011) - [i1]Yuri Faenza, Samuel Fiorini, Roland Grappe, Hans Raj Tiwary:
Extended formulations, non-negative factorizations and randomized communication protocols. CoRR abs/1105.4127 (2011)
2000 – 2009
- 2009
- [j2]Flavia Bonomo, Yuri Faenza, Gianpaolo Oriolo:
On coloring problems with local constraints. Electron. Notes Discret. Math. 35: 215-220 (2009) - [j1]Yuri Faenza, Volker Kaibel:
Extended Formulations for Packing and Partitioning Orbitopes. Math. Oper. Res. 34(3): 686-697 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 18:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
