The following pages link to Yuri Faenza (Q427863):
Displaying 41 items.
- (Q635516) (redirect page) (← links)
- A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants) (Q635519) (← links)
- Extended formulations, nonnegative factorizations, and randomized communication protocols (Q745681) (← links)
- Reverse split rank (Q896287) (← links)
- A PTAS for the time-invariant incremental knapsack problem (Q1661876) (← links)
- On bounded pitch inequalities for the MIN-knapsack polytope (Q1661877) (← links)
- Extension complexity of stable set polytopes of bipartite graphs (Q1687905) (← links)
- Enumeration of 2-level polytopes (Q1741129) (← links)
- On the existence of compact $\varepsilon$-approximated formulations for knapsack in the original space (Q1785373) (← links)
- Separation routine and extended formulations for the stable set problem in claw-free graphs (Q2039230) (← links)
- Recognizing Cartesian products of matrices and polytopes (Q2056923) (← links)
- (Un)stable matchings with blocking costs (Q2060342) (← links)
- Pitch, extension complexity, and covering problems (Q2060545) (← links)
- New limits of treewidth-based tractability in optimization (Q2118087) (← links)
- The simultaneous semi-random model for TSP (Q2164675) (← links)
- Balas formulation for the union of polytopes is optimal (Q2297650) (← links)
- On inequalities with bounded coefficients and pitch for the min knapsack polytope (Q2673233) (← links)
- Approximation algorithms for the generalized incremental knapsack problem (Q2687039) (← links)
- On Vertices and Facets of Combinatorial 2-Level Polytopes (Q2835675) (← links)
- On the Convergence of the Affine Hull of the Chvátal--Gomory Closures (Q2870517) (← links)
- Solving the stable set problem in terms of the odd cycle packing number (Q2978512) (← links)
- (Q3109934) (← links)
- Extended Formulations for Packing and Partitioning Orbitopes (Q3169060) (← links)
- Reverse Chvátal--Gomory Rank (Q3453572) (← links)
- Understanding Popular Matchings via Stable Matchings (Q5028352) (← links)
- Quasi-Popular Matchings, Optimality, and Extended Formulations (Q5076707) (← links)
- Legal Assignments and Fast EADAM with Consent via Classic Theory of Stable Matchings (Q5095181) (← links)
- Quasi-popular Matchings, Optimality, and Extended Formulations (Q5146785) (← links)
- Popular Matchings and Limits to Tractability (Q5236364) (← links)
- On largest volume simplices and sub-determinants (Q5362979) (← links)
- (Q5365068) (← links)
- Reverse Split Rank (Q5418999) (← links)
- Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition (Q5501925) (← links)
- (Q5743477) (← links)
- On coloring problems with local constraints (Q5891093) (← links)
- On coloring problems with local constraints (Q5891606) (← links)
- Affinely representable lattices, stable matchings, and choice functions (Q5918423) (← links)
- Extended formulations from communication protocols in output-efficient time (Q5918910) (← links)
- Affinely representable lattices, stable matchings, and choice functions (Q5925643) (← links)
- Slack matrices, \(k\)-products, and 2-level polytopes (Q6558684) (← links)
- The simultaneous semi-random model for TSP (Q6589752) (← links)
