Available identifiers
zbMath Open faenza.yuriMaRDI QIDQ427863
List of research outcomes
Publication | Date of Publication | Type |
---|
Affinely representable lattices, stable matchings, and choice functions | 2023-03-14 | Paper |
Approximation algorithms for the generalized incremental knapsack problem | 2023-03-01 | Paper |
The Total Matching Polytope of Complete Bipartite Graphs | 2023-03-01 | Paper |
Scarf's algorithm and stable marriages | 2023-03-01 | Paper |
Internal Closedness and von Neumann-Morgenstern Stability in Matching Theory: Structures and Complexity | 2022-11-30 | Paper |
The simultaneous semi-random model for TSP | 2022-08-16 | Paper |
Legal Assignments and Fast EADAM with Consent via Classic Theory of Stable Matchings | 2022-08-05 | Paper |
On inequalities with bounded coefficients and pitch for the min knapsack polytope | 2022-06-09 | Paper |
Quasi-Popular Matchings, Optimality, and Extended Formulations | 2022-05-17 | Paper |
New limits of treewidth-based tractability in optimization | 2022-03-22 | Paper |
Understanding Popular Matchings via Stable Matchings | 2022-02-09 | Paper |
Affinely representable lattices, stable matchings, and choice functions | 2021-12-21 | Paper |
(Un)stable matchings with blocking costs | 2021-12-13 | Paper |
Pitch, extension complexity, and covering problems | 2021-12-13 | Paper |
Recognizing Cartesian products of matrices and polytopes | 2021-12-08 | Paper |
Separation routine and extended formulations for the stable set problem in claw-free graphs | 2021-07-02 | Paper |
Quasi-popular Matchings, Optimality, and Extended Formulations | 2021-02-02 | Paper |
Extended formulations from communication protocols in output-efficient time | 2020-08-28 | Paper |
Balas formulation for the union of polytopes is optimal | 2020-02-20 | Paper |
Extended formulations from communication protocols in output-efficient time | 2020-02-06 | Paper |
Popular Matchings and Limits to Tractability | 2019-10-15 | Paper |
https://portal.mardi4nfdi.de/entity/Q5743477 | 2019-05-10 | Paper |
Enumeration of 2-level polytopes | 2019-05-03 | Paper |
On the existence of compact $\varepsilon$-approximated formulations for knapsack in the original space | 2018-09-28 | Paper |
A PTAS for the time-invariant incremental knapsack problem | 2018-08-17 | Paper |
On bounded pitch inequalities for the MIN-knapsack polytope | 2018-08-17 | Paper |
On Vertices and Facets of Combinatorial 2-Level Polytopes | 2018-08-07 | Paper |
Extension complexity of stable set polytopes of bipartite graphs | 2018-01-04 | Paper |
On largest volume simplices and sub-determinants | 2017-10-05 | Paper |
https://portal.mardi4nfdi.de/entity/Q5365068 | 2017-09-29 | Paper |
Solving the stable set problem in terms of the odd cycle packing number | 2017-04-25 | Paper |
On Vertices and Facets of Combinatorial 2-Level Polytopes | 2016-11-30 | Paper |
Reverse split rank | 2015-12-09 | Paper |
Reverse Chvátal--Gomory Rank | 2015-11-27 | Paper |
Enumeration of 2-level polytopes | 2015-11-19 | Paper |
Extended formulations, nonnegative factorizations, and randomized communication protocols | 2015-10-14 | Paper |
Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition | 2015-08-14 | Paper |
Reverse Split Rank | 2014-06-02 | Paper |
On the Convergence of the Affine Hull of the Chvátal--Gomory Closures | 2014-01-21 | Paper |
On coloring problems with local constraints | 2013-07-19 | Paper |
Reverse Chvátal--Gomory Rank | 2013-03-19 | Paper |
Extended formulations, nonnegative factorizations, and randomized communication protocols | 2012-11-02 | Paper |
On coloring problems with local constraints | 2012-06-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q3109934 | 2012-01-26 | Paper |
A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants) | 2011-08-19 | Paper |
Extended Formulations for Packing and Partitioning Orbitopes | 2011-04-27 | Paper |
Research outcomes over time
Doctoral students
No records found.
Known relations from the MaRDI Knowledge Graph
This page was built for person: Yuri Faenza