Yuri Faenza - RankMe

88 papers A* 11A 1B 9C 4Journal 62Unranked 1

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