default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDManuel Aprile
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Manuel Aprile
, Michele Conforti, Samuel Fiorini, Yuri Faenza, Tony Huynh, Marco Macchia:
Slack matrices, k-products, and 2-level polytopes. Discret. Appl. Math. 354: 199-213 (2024)- [j10]Manuel Aprile, Michele Conforti, Marco Di Summa:
Binary Extended Formulations and Sequential Convexification. Math. Oper. Res. 49(3): 1566-1581 (2024) - [j9]Manuel Aprile, Gennadiy Averkov, Marco Di Summa, Christopher Hojny:
The role of rationality in integer-programming relaxations. Math. Program. 205(1): 745-771 (2024) - [i14]Manuel Aprile, Samuel Fiorini, Gwenaël Joret, Stefan Kober, Michal T. Seweryn, Stefan Weltge, Yelena Yuditsky:
Integer programs with nearly totally unimodular matrices: the cographic case. CoRR abs/2407.09477 (2024) - 2023
- [j8]Manuel Aprile, Matthew Drescher, Samuel Fiorini, Tony Huynh:
A 7/3-approximation algorithm for feedback vertex set in tournaments via Sherali-Adams. Discret. Appl. Math. 337: 149-160 (2023) - [j7]Manuel Aprile, Matthew Drescher, Samuel Fiorini, Tony Huynh:
A tight approximation algorithm for the cluster vertex deletion problem. Math. Program. 197(2): 1069-1091 (2023) - 2022
- [j6]Manuel Aprile, Samuel Fiorini:
Regular Matroids Have Polynomial Extension Complexity. Math. Oper. Res. 47(1): 540-559 (2022) - [j5]Manuel Aprile:
Extended formulations for matroid polytopes through randomized protocols. Oper. Res. Lett. 50(2): 145-149 (2022) - [i13]Manuel Aprile:
Exact approaches for the Connected Vertex Cover problem. CoRR abs/2203.09868 (2022) - [i12]Manuel Aprile, Gennadiy Averkov, Marco Di Summa, Christopher Hojny:
The role of rationality in integer-programming relaxations. CoRR abs/2206.12253 (2022) - 2021
- [j4]Manuel Aprile, Samuel Fiorini, Tony Huynh, Gwenaël Joret, David R. Wood:
Smaller Extended Formulations for Spanning Tree Polytopes in Minor-closed Classes and Beyond. Electron. J. Comb. 28(4) (2021) - [c4]Manuel Aprile, Matthew Drescher, Samuel Fiorini, Tony Huynh:
A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem. IPCO 2021: 340-353 - [i11]Manuel Aprile, Michele Conforti, Marco Di Summa:
Binary extended formulations and sequential convexification. CoRR abs/2106.00354 (2021) - [i10]Manuel Aprile, Samuel Fiorini, Tony Huynh, Gwenaël Joret, David R. Wood:
Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond. CoRR abs/2106.11945 (2021) - [i9]Manuel Aprile:
Extended formulations for matroid polytopes through randomized protocols. CoRR abs/2106.12453 (2021) - [i8]Manuel Aprile, Michele Conforti, Yuri Faenza, Samuel Fiorini, Tony Huynh, Marco Macchia:
Slack matrices, k-products, and 2-level polytopes. CoRR abs/2106.12829 (2021) - 2020
- [j3]Manuel Aprile, Yuri Faenza:
Extended formulations from communication protocols in output-efficient time. Math. Program. 183(1): 41-59 (2020) - [i7]Manuel Aprile, Michele Conforti, Yuri Faenza, Samuel Fiorini, Tony Huynh, Marco Macchia:
Recognizing Cartesian products of matrices and polytopes. CoRR abs/2002.02264 (2020) - [i6]Manuel Aprile, Matthew Drescher, Samuel Fiorini, Tony Huynh:
A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem. CoRR abs/2007.08057 (2020) - [i5]Manuel Aprile, Matthew Drescher, Samuel Fiorini, Tony Huynh:
A simple 7/3-approximation algorithm for feedback vertex set in tournaments. CoRR abs/2008.08779 (2020)
2010 – 2019
- 2019
- [j2]Manuel Aprile, Natalia Castro, Graciela Ferreira, Juan Piccini, Franco Robledo, Pablo Romero:
Graph fragmentation problem: analysis and synthesis. Int. Trans. Oper. Res. 26(1): 41-53 (2019) - [c3]Manuel Aprile, Yuri Faenza:
Extended Formulations from Communication Protocols in Output-Efficient Time. IPCO 2019: 43-56 - [i4]Manuel Aprile, Samuel Fiorini:
Regular matroids have polynomial extension complexity. CoRR abs/1909.08539 (2019) - 2018
- [j1]Manuel Aprile, Alfonso Cevallos, Yuri Faenza:
On 2-Level Polytopes Arising in Combinatorial Settings. SIAM J. Discret. Math. 32(3): 1857-1886 (2018) - [i3]Manuel Aprile, Yuri Faenza:
Extended formulations from communication protocols in output-efficient time. CoRR abs/1811.08529 (2018) - 2017
- [c2]Manuel Aprile, Yuri Faenza, Samuel Fiorini, Tony Huynh, Marco Macchia:
Extension Complexity of Stable Set Polytopes of Bipartite Graphs. WG 2017: 75-87 - [i2]Manuel Aprile, Alfonso Cevallos, Yuri Faenza:
On vertices and facets of combinatorial 2-level polytopes. CoRR abs/1702.03187 (2017) - [i1]Manuel Aprile, Yuri Faenza, Samuel Fiorini, Tony Huynh, Marco Macchia:
Extension complexity of stable set polytopes of bipartite graphs. CoRR abs/1702.08741 (2017) - 2016
- [c1]Manuel Aprile, Alfonso Cevallos, Yuri Faenza:
On Vertices and Facets of Combinatorial 2-Level Polytopes. ISCO 2016: 177-188
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
