Regular matroids have polynomial extension complexity M Aprile, S Fiorini Mathematics of Operations Research 47 (1), 540-559, 2022 | 21 | 2022 |

On 2-level polytopes arising in combinatorial settings M Aprile, A Cevallos, Y Faenza SIAM Journal on Discrete Mathematics 32 (3), 1857-1886, 2018 | 20 | 2018 |

A tight approximation algorithm for the cluster vertex deletion problem M Aprile, M Drescher, S Fiorini, T Huynh Mathematical Programming, 1-23, 2023 | 15 | 2023 |

Extension complexity of stable set polytopes of bipartite graphs M Aprile, Y Faenza, S Fiorini, T Huynh, M Macchia Graph-Theoretic Concepts in Computer Science: 43rd International Workshop …, 2017 | 15 | 2017 |

Graph fragmentation problem: analysis and synthesis M Aprile, N Castro, G Ferreira, J Piccini, F Robledo, P Romero International Transactions in Operational Research 26 (1), 41-53, 2019 | 10 | 2019 |

Extended formulations from communication protocols in output-efficient time M Aprile, Y Faenza Mathematical Programming 183 (1), 41-59, 2020 | 9 | 2020 |

Extended formulations for matroid polytopes through randomized protocols M Aprile Operations Research Letters 50 (2), 145-149, 2022 | 8 | 2022 |

Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond M Aprile, S Fiorini, T Huynh, G Joret, DR Wood arXiv preprint arXiv:2106.11945, 2021 | 8 | 2021 |

A tight approximation algorithm for the cluster vertex deletion problem M Aprile, M Drescher, S Fiorini, T Huynh Integer Programming and Combinatorial Optimization: 22nd International …, 2021 | 7 | 2021 |

On some problems related to 2-level polytopes MF Aprile EPFL, 2018 | 7 | 2018 |

Analysis of node-resilience strategies under natural disasters MF Aprile, N Castro, F Robledo, P Romero nternational Conference on Design of Reliable Communication Networks, 2017 | 6 | 2017 |

On vertices and facets of combinatorial 2-level polytopes M Aprile, A Cevallos, Y Faenza International Symposium on Combinatorial Optimization, 177-188, 2016 | 6 | 2016 |

A simple 7/3-approximation algorithm for feedback vertex set in tournaments M Aprile, M Drescher, S Fiorini, T Huynh arXiv preprint arXiv:2008.08779, 2020 | 4 | 2020 |

Recognizing Cartesian products of matrices and polytopes M Aprile, M Conforti, Y Faenza, S Fiorini, T Huynh, M Macchia Graphs and Combinatorial Optimization: from Theory to Applications: CTW2020 …, 2021 | 3 | 2021 |

The role of rationality in integer-programming relaxations M Aprile, G Averkov, M Di Summa, C Hojny Mathematical Programming 205 (1), 745-771, 2024 | 2 | 2024 |

Binary extended formulations and sequential convexification M Aprile, M Conforti, M Di Summa Mathematics of Operations Research, 2023 | 1 | 2023 |

Slack matrices, k-products, and 2-level polytopes M Aprile, M Conforti, S Fiorini, Y Faenza, T Huynh, M Macchia Discrete Applied Mathematics, 2022 | 1 | 2022 |

Integer programs with nearly totally unimodular matrices: the cographic case M Aprile, S Fiorini, G Joret, S Kober, MT Seweryn, S Weltge, Y Yuditsky arXiv preprint arXiv:2407.09477, 2024 | | 2024 |

A 7/3-approximation algorithm for feedback vertex set in tournaments via Sherali–Adams M Aprile, M Drescher, S Fiorini, T Huynh Discrete Applied Mathematics 337, 149-160, 2023 | | 2023 |

Exact approaches for the Connected Vertex Cover problem M Aprile Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 29-40, 2023 | | 2023 |