APRILE, MANUEL FRANCESCO
APRILE, MANUEL FRANCESCO
Dipartimento di Matematica "Tullio Levi-Civita" - DM
A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem
2021 Aprile, M.; Drescher, M.; Fiorini, S.; Huynh, T.
A tight approximation algorithm for the cluster vertex deletion problem
2022 Aprile, M.; Drescher, M.; Fiorini, S.; Huynh, T.
Analysis and complexity of node-immunization under natural disasters
2017 Aprile, M.; Castro, N.; Robledo, F.; Romero, P.
Exact Approaches for the Connected Vertex Cover Problem
2024 Aprile, Manuel
Extended formulations for matroid polytopes through randomized protocols
2022 Aprile, M.
Extended formulations from communication protocols in output-efficient time
2020 Aprile, M.; Faenza, Y.
Extended Formulations from Communication Protocols in Output-Efficient Time
2019 Aprile, M; Faenza, Y
Extension complexity of stable set polytopes of bipartite graphs
2017 Aprile, M.; Faenza, Y.; Fiorini, S.; Huynh, T.; Macchia, M.
Graph fragmentation problem: analysis and synthesis
2019 Aprile, M.; Castro, N.; Ferreira, G.; Piccini, J.; Robledo, F.; Romero, P.
On 2-level polytopes arising in combinatorial settings
2018 Aprile, M.; Cevallos, A.; Faenza, Y.
On vertices and facets of combinatorial 2-level polytopes
2016 Aprile, M.; Cevallos, A.; Faenza, Y.
Recognizing cartesian products of matrices and polytopes
2021 Aprile, M.; Conforti, M.; Faenza, Y.; Fiorini, S.; Huynh, T.; Macchia, M.
Regular Matroids Have Polynomial Extension Complexity
2022 Aprile, M.; Fiorini, S.
Slack matrices, k-products, and 2-level polytopes
2022 Aprile, M.; Conforti, M.; Fiorini, S.; Faenza, Y.; Huynh, T.; Macchia, M.
Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond
2021 Aprile, M.; Fiorini, S.; Huynh, T.; Joret, G.; Wood, D. R.
The role of rationality in integer-programming relaxations
2023 Aprile, M.; Averkov, G.; Di Summa, M.; Hojny, C.