Manuel Aprile

Orcid: 0000-0002-6805-6903

According to our database1, Manuel Aprile authored at least 16 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The role of rationality in integer-programming relaxations.
Math. Program., May, 2024

2023
A 7/3-approximation algorithm for feedback vertex set in tournaments via Sherali-Adams.
Discret. Appl. Math., October, 2023

A tight approximation algorithm for the cluster vertex deletion problem.
Math. Program., February, 2023

2022
Extended formulations for matroid polytopes through randomized protocols.
Oper. Res. Lett., 2022

Regular Matroids Have Polynomial Extension Complexity.
Math. Oper. Res., 2022

Exact approaches for the Connected Vertex Cover problem.
CoRR, 2022

2021
Slack matrices, k-products, and 2-level polytopes.
CoRR, 2021

Binary extended formulations and sequential convexification.
CoRR, 2021

Smaller Extended Formulations for Spanning Tree Polytopes in Minor-closed Classes and Beyond.
Electron. J. Comb., 2021

2020
Extended formulations from communication protocols in output-efficient time.
Math. Program., 2020

A simple 7/3-approximation algorithm for feedback vertex set in tournaments.
CoRR, 2020

Recognizing Cartesian products of matrices and polytopes.
CoRR, 2020

2019
Graph fragmentation problem: analysis and synthesis.
Int. Trans. Oper. Res., 2019

2018
On 2-Level Polytopes Arising in Combinatorial Settings.
SIAM J. Discret. Math., 2018

2017
Extension Complexity of Stable Set Polytopes of Bipartite Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

2016
On Vertices and Facets of Combinatorial 2-Level Polytopes.
Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016


  Loading...