default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarco Macchia
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]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)- [j6]Miriana Di Stefano, Salvatore Galati, Lisa Piazza, Carlotta Granchi, Simone Mancini, Filippo Fratini, Marco Macchia, Giulio Poli, Tiziano Tuccinardi:
VenomPred 2.0: A Novel In Silico Platform for an Extended and Human Interpretable Toxicological Profiling of Small Molecules. J. Chem. Inf. Model. 64(7): 2275-2289 (2024) - 2023
- [j5]Salvatore Galati, Miriana Di Stefano, Marco Macchia, Giulio Poli, Tiziano Tuccinardi:
MolBook UNIPI─Create, Manage, Analyze, and Share Your Chemical Data for Free. J. Chem. Inf. Model. 63(13): 3977-3982 (2023) - 2021
- [j4]Samuel Fiorini, Marco Macchia, Kanstantsin Pashkovich:
Bounds on the Number of 2-Level Polytopes, Cones, and Configurations. Discret. Comput. Geom. 65(3): 587-600 (2021) - [i7]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
- [i6]Manuel Aprile, Michele Conforti, Yuri Faenza, Samuel Fiorini, Tony Huynh, Marco Macchia:
Recognizing Cartesian products of matrices and polytopes. CoRR abs/2002.02264 (2020)
2010 – 2019
- 2019
- [j3]Krystal Guo, Tony Huynh, Marco Macchia:
The Biclique Covering Number of Grids. Electron. J. Comb. 26(4): 4 (2019) - [j2]Adam Bohn, Yuri Faenza, Samuel Fiorini, Vissarion Fisikopoulos, Marco Macchia, Kanstantsin Pashkovich:
Enumeration of 2-level polytopes. Math. Program. Comput. 11(1): 173-210 (2019) - [j1]Pierre Aboulker, Samuel Fiorini, Tony Huynh, Marco Macchia, Johanna Seif:
Extension complexity of the correlation polytope. Oper. Res. Lett. 47(1): 47-51 (2019) - 2018
- [i5]Pierre Aboulker, Samuel Fiorini, Tony Huynh, Marco Macchia, Johanna Seif:
Extension Complexity of the Correlation Polytope. CoRR abs/1806.00541 (2018) - [i4]Samuel Fiorini, Marco Macchia, Kanstantsin Pashkovich:
Bounds on the number of 2-level polytopes, cones and configurations. CoRR abs/1806.06011 (2018) - [i3]Krystal Guo, Tony Huynh, Marco Macchia:
The biclique covering number of grids. CoRR abs/1811.03396 (2018) - 2017
- [c3]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, Yuri Faenza, Samuel Fiorini, Tony Huynh, Marco Macchia:
Extension complexity of stable set polytopes of bipartite graphs. CoRR abs/1702.08741 (2017) - [i1]Adam Bohn, Yuri Faenza, Samuel Fiorini, Vissarion Fisikopoulos, Marco Macchia, Kanstantsin Pashkovich:
Enumeration of 2-level polytopes. CoRR abs/1703.01943 (2017) - 2016
- [c2]Samuel Fiorini, Vissarion Fisikopoulos, Marco Macchia:
Two-Level Polytopes with a Prescribed Facet. ISCO 2016: 285-296 - 2015
- [c1]Adam Bohn, Yuri Faenza, Samuel Fiorini, Vissarion Fisikopoulos, Marco Macchia, Kanstantsin Pashkovich:
Enumeration of 2-Level Polytopes. ESA 2015: 191-202
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:19 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:
