Yuri Faenza

Orcid: 0000-0002-3148-2159

According to our database1, Yuri Faenza authored at least 54 papers between 2009 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
The simultaneous semi-random model for TSP.
Math. Program., July, 2024

The total matching polytope of complete bipartite graphs.
Oper. Res. Lett., 2024

Slack matrices, k-products, and 2-level polytopes.
Discret. Appl. Math., 2024

An Algorithm for the Assignment Game Beyond Additive Valuations.
CoRR, 2024

Von Neumann-Morgenstern Stability and Internal Closedness in Matching Theory.
Proceedings of the Integer Programming and Combinatorial Optimization, 2024

Two-Stage Stochastic Stable Matching.
Proceedings of the Integer Programming and Combinatorial Optimization, 2024

2023
Approximation algorithms for the generalized incremental knapsack problem.
Math. Program., March, 2023

Affinely representable lattices, stable matchings, and choice functions.
Math. Program., February, 2023

The Incremental Knapsack Problem with Monotone Submodular All-or-Nothing Profits.
CoRR, 2023

Scarf's algorithm and stable marriages.
CoRR, 2023

Discovering Opportunities in New York City's Discovery Program: Disadvantaged Students in Highly Competitive Markets.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

The Power of Greedy for Online Minimum Cost Matching on the Line.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

2022
Understanding Popular Matchings via Stable Matchings.
SIAM J. Discret. Math., 2022

New limits of treewidth-based tractability in optimization.
Math. Program., 2022

Quasi-Popular Matchings, Optimality, and Extended Formulations.
Math. Oper. Res., 2022

Legal Assignments and Fast EADAM with Consent via Classic Theory of Stable Matchings.
Oper. Res., 2022

On inequalities with bounded coefficients and pitch for the min knapsack polytope.
Discret. Optim., 2022

Internal Closedness and von Neumann-Morgenstern Stability in Matching Theory: Structures and Complexity.
CoRR, 2022

Discovering Opportunities in New York City's Discovery Program: an Analysis of Affirmative Action Mechanisms.
CoRR, 2022

2021
(Un)stable matchings with blocking costs.
Oper. Res. Lett., 2021

Pitch, extension complexity, and covering problems.
Oper. Res. Lett., 2021

Separation routine and extended formulations for the stable set problem in claw-free graphs.
Math. Program., 2021

2020
Balas formulation for the union of polytopes is optimal.
Math. Program., 2020

Extended formulations from communication protocols in output-efficient time.
Math. Program., 2020

Impact of Bias on School Admissions and Targeted Interventions.
CoRR, 2020

Recognizing Cartesian products of matrices and polytopes.
CoRR, 2020

Reinforcement Learning for Integer Programming: Learning to Cut.
Proceedings of the 37th International Conference on Machine Learning, 2020

2019
Enumeration of 2-level polytopes.
Math. Program. Comput., 2019

Popular Matchings and Limits to Tractability.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018
On 2-Level Polytopes Arising in Combinatorial Settings.
SIAM J. Discret. Math., 2018

Popularity, stability, and the dominant matching polytope.
CoRR, 2018

Legal Assignments and fast EADAM with consent via classical theory of stable matchings.
CoRR, 2018

Limits of Treewidth-based tractability in Optimization.
CoRR, 2018

Two-sided popular matchings in bipartite graphs with forbidden/forced elements and weights.
CoRR, 2018

On Bounded Pitch Inequalities for the Min-Knapsack Polytope.
Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

A PTAS for the Time-Invariant Incremental Knapsack Problem.
Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

2017
Improved approximation algorithms and disjunctive relaxations for some knapsack problems.
CoRR, 2017

Extension Complexity of Stable Set Polytopes of Bipartite Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

2016
On Vertices and Facets of Combinatorial 2-Level Polytopes.
Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

2015
Reverse Chvátal-Gomory Rank.
SIAM J. Discret. Math., 2015

On the existence of compact ε-approximated formulations for knapsack in the original space.
Oper. Res. Lett., 2015

Extended formulations, nonnegative factorizations, and randomized communication protocols.
Math. Program., 2015

Reverse split rank.
Math. Program., 2015

On largest volume simplices and sub-determinants.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014
Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition.
J. ACM, 2014

Solving the Stable Set Problem in Terms of the Odd Cycle Packing Number.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

2013
On the Convergence of the Affine Hull of the Chvátal-Gomory Closures.
SIAM J. Discret. Math., 2013

2012
Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011
A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants).
Oper. Res. Lett., 2011

Extended formulations, non-negative factorizations and randomized communication protocols
CoRR, 2011

A fast algorithm to remove proper and homogenous pairs of cliques (while preserving some graph invariants)
CoRR, 2011

An algorithmic decomposition of claw-free graphs leading to an O(n<sup>3</sup>)-algorithm for the weighted stable set problem.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2009
Extended Formulations for Packing and Partitioning Orbitopes.
Math. Oper. Res., 2009

On coloring problems with local constraints.
Electron. Notes Discret. Math., 2009


  Loading...