| Publication | Date of Publication | Type |
|---|
Von Neumann-Morgenstern stability and internal closedness in matching theory
Mathematical Programming. Series A. Series B | 2026-05-08 | Paper |
| Non-distributive lattices, stable matchings, and linear optimization | 2025-12-22 | Paper |
The total matching polytope of complete bipartite graphs
Operations Research Letters | 2025-05-03 | Paper |
| Von Neumann-Morgenstern stability and internal closedness in matching theory | 2025-02-07 | Paper |
| Two-stage stochastic stable matching | 2025-02-07 | Paper |
The simultaneous semi-random model for TSP
Mathematical Programming. Series A. Series B | 2024-08-20 | Paper |
Slack matrices, k-products, and 2-level polytopes
Discrete Applied Mathematics | 2024-06-20 | Paper |
Affinely representable lattices, stable matchings, and choice functions
Mathematical Programming. Series A. Series B | 2023-03-14 | Paper |
| The Total Matching Polytope of Complete Bipartite Graphs | 2023-03-01 | Paper |
| Scarf's algorithm and stable marriages | 2023-03-01 | Paper |
Approximation algorithms for the generalized incremental knapsack problem
Mathematical Programming. Series A. Series B | 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
Operations Research | 2022-08-05 | Paper |
On inequalities with bounded coefficients and pitch for the min knapsack polytope
Discrete Optimization | 2022-06-09 | Paper |
Quasi-popular matchings, optimality, and extended formulations
Mathematics of Operations Research | 2022-05-17 | Paper |
New limits of treewidth-based tractability in optimization
Mathematical Programming. Series A. Series B | 2022-03-22 | Paper |
Understanding popular matchings via stable matchings
SIAM Journal on Discrete Mathematics | 2022-02-09 | Paper |
Affinely representable lattices, stable matchings, and choice functions
Integer Programming and Combinatorial Optimization | 2021-12-21 | Paper |
(Un)stable matchings with blocking costs
Operations Research Letters | 2021-12-13 | Paper |
Pitch, extension complexity, and covering problems
Operations Research Letters | 2021-12-13 | Paper |
Recognizing Cartesian products of matrices and polytopes
(available as arXiv preprint) | 2021-12-08 | Paper |
Separation routine and extended formulations for the stable set problem in claw-free graphs
Mathematical Programming. Series A. Series B | 2021-07-02 | Paper |
Quasi-popular Matchings, Optimality, and Extended Formulations
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Extended formulations from communication protocols in output-efficient time
Mathematical Programming. Series A. Series B | 2020-08-28 | Paper |
Balas formulation for the union of polytopes is optimal
Mathematical Programming. Series A. Series B | 2020-02-20 | Paper |
Extended formulations from communication protocols in output-efficient time
Lecture Notes in Computer Science | 2020-02-06 | Paper |
Popular matchings and limits to tractability
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
| Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs | 2019-05-10 | Paper |
Enumeration of 2-level polytopes
Mathematical Programming Computation | 2019-05-03 | Paper |
On the existence of compact $\varepsilon$-approximated formulations for knapsack in the original space
Operations Research Letters | 2018-09-28 | Paper |
A PTAS for the time-invariant incremental knapsack problem
(available as arXiv preprint) | 2018-08-17 | Paper |
On bounded pitch inequalities for the MIN-knapsack polytope
(available as arXiv preprint) | 2018-08-17 | Paper |
On 2-level polytopes arising in combinatorial settings
SIAM Journal on Discrete Mathematics | 2018-08-07 | Paper |
Extension complexity of stable set polytopes of bipartite graphs
(available as arXiv preprint) | 2018-01-04 | Paper |
On largest volume simplices and sub-determinants
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
| scientific article; zbMATH DE number 6783420 (Why is no real title available?) | 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
Lecture Notes in Computer Science | 2016-11-30 | Paper |
Reverse split rank
Mathematical Programming. Series A. Series B | 2015-12-09 | Paper |
Reverse Chvátal-Gomory rank
SIAM Journal on Discrete Mathematics | 2015-11-27 | Paper |
Enumeration of 2-level polytopes
Lecture Notes in Computer Science | 2015-11-19 | Paper |
Extended formulations, nonnegative factorizations, and randomized communication protocols
Mathematical Programming. Series A. Series B | 2015-10-14 | Paper |
Solving the weighted stable set problem in claw-free graphs via decomposition
Journal of the ACM | 2015-08-14 | Paper |
Reverse split rank
Integer Programming and Combinatorial Optimization | 2014-06-02 | Paper |
On the convergence of the affine hull of the Chvàtal-Gomory closures
SIAM Journal on Discrete Mathematics | 2014-01-21 | Paper |
On coloring problems with local constraints
Electronic Notes in Discrete Mathematics | 2013-07-19 | Paper |
Reverse Chvátal-Gomory rank
Lecture Notes in Computer Science | 2013-03-19 | Paper |
Extended formulations, nonnegative factorizations, and randomized communication protocols
Lecture Notes in Computer Science | 2012-11-02 | Paper |
On coloring problems with local constraints
Discrete Mathematics | 2012-06-18 | Paper |
| Stable sets in claw-free graphs: a journey through algorithms and polytopes | 2012-01-26 | Paper |
A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants)
Operations Research Letters | 2011-08-19 | Paper |
Extended formulations for packing and partitioning orbitopes
Mathematics of Operations Research | 2011-04-27 | Paper |
