| Publication | Date of Publication | Type |
|---|
| Integer programs with nearly totally unimodular matrices: the cographic case | 2026-07-03 | Paper |
The red-blue-yellow matching problem
(available as arXiv preprint) | 2026-01-01 | Paper |
The red-blue-yellow matching problem
Discrete Optimization | 2026-01-01 | Paper |
The Strong Total Cover Problem
(available as arXiv preprint) | 2026-01-01 | Paper |
| Exact approaches for the connected vertex cover problem | 2025-11-17 | Paper |
Binary extended formulations and sequential convexification
Mathematics of Operations Research | 2024-11-07 | Paper |
Slack matrices, k-products, and 2-level polytopes
Discrete Applied Mathematics | 2024-06-20 | Paper |
The role of rationality in integer-programming relaxations
Mathematical Programming. Series A. Series B | 2024-04-09 | Paper |
Graph fragmentation problem: analysis and synthesis
International Transactions in Operational Research | 2023-11-15 | Paper |
A 7 / 3-approximation algorithm for feedback vertex set in tournaments via Sherali-Adams
Discrete Applied Mathematics | 2023-06-15 | Paper |
A tight approximation algorithm for the cluster vertex deletion problem
Mathematical Programming. Series A. Series B | 2023-03-14 | Paper |
Regular matroids have polynomial extension complexity
Mathematics of Operations Research | 2022-05-17 | Paper |
Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond
The Electronic Journal of Combinatorics | 2022-04-04 | Paper |
| Exact approaches for the Connected Vertex Cover problem | 2022-03-18 | Paper |
Extended formulations for matroid polytopes through randomized protocols
Operations Research Letters | 2022-03-11 | Paper |
A tight approximation algorithm for the cluster vertex deletion problem
Integer Programming and Combinatorial Optimization | 2021-12-21 | Paper |
Recognizing Cartesian products of matrices and polytopes
(available as arXiv preprint) | 2021-12-08 | Paper |
Extended formulations for matroid polytopes through randomized protocols
(available as arXiv preprint) | 2021-06-23 | Paper |
Extended formulations from communication protocols in output-efficient time
Mathematical Programming. Series A. Series B | 2020-08-28 | Paper |
| A simple 7/3-approximation algorithm for feedback vertex set in tournaments | 2020-08-20 | Paper |
Extended formulations from communication protocols in output-efficient time
Lecture Notes in Computer Science | 2020-02-06 | Paper |
A simple 7/3-approximation algorithm for feedback vertex set in tournaments
(available as arXiv preprint) | 2020-01-01 | 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 vertices and facets of combinatorial 2-level polytopes
Lecture Notes in Computer Science | 2016-11-30 | Paper |
