default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 162 matches
- 2024
- 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) - Matthew Drescher, Samuel Fiorini, Tony Huynh:
A simple (2+ϵ)-approximation algorithm for Split Vertex Deletion. Eur. J. Comb. 121: 103844 (2024) - Luca Ferrarini, Samuel Fiorini, Stefan Kober, Yelena Yuditsky:
Total Matching and Subdeterminants. ISCO 2024: 192-204 - 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
- 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) - 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) - Karthekeyan Chandrasekaran, Chandra Chekuri, Samuel Fiorini, Shubhang Kulkarni, Stefan Weltge:
Polyhedral Aspects of Feedback Vertex Set and Pseudoforest Deletion Set. CoRR abs/2303.12850 (2023) - Luca Ferrarini, Samuel Fiorini, Stefan Kober, Yelena Yuditsky:
Total Matching and Subdeterminants. CoRR abs/2312.17630 (2023) - 2022
- Veronica Tozzo, Chloé-Agathe Azencott, Samuele Fiorini, Emanuele Fava, Andrea Trucco, Annalisa Barla:
Where Do We Stand in Regularization for Life Science Studies? J. Comput. Biol. 29(3): 213-232 (2022) - Manuel Aprile, Samuel Fiorini:
Regular Matroids Have Polynomial Extension Complexity. Math. Oper. Res. 47(1): 540-559 (2022) - Michele Conforti, Samuel Fiorini, Tony Huynh, Stefan Weltge:
Extended formulations for stable set polytopes of graphs without two disjoint odd cycles. Math. Program. 192(1): 547-566 (2022) - 2021
- 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) - Samuel Fiorini, Tony Huynh, Gwenaël Joret, Carole Muller:
Unavoidable Minors for Graphs with Large ℓ p-Dimension. Discret. Comput. Geom. 66(1): 301-343 (2021) - 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) - Samuel Fiorini, Tony Huynh, Stefan Weltge:
Strengthening convex relaxations of 0/1-sets using Boolean formulas. Math. Program. 190(1): 467-482 (2021) - Samuel Fiorini, Gwenaël Joret, Stefan Weltge, Yelena Yuditsky:
Integer programs with bounded subdeterminants and two nonzeros per row. FOCS 2021: 13-24 - Manuel Aprile, Matthew Drescher, Samuel Fiorini, Tony Huynh:
A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem. IPCO 2021: 340-353 - Samuel Fiorini, Gwenaël Joret, Stefan Weltge, Yelena Yuditsky:
Integer programs with bounded subdeterminants and two nonzeros per row. CoRR abs/2106.05947 (2021) - 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) - 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
- Samuel Fiorini, Gwenaël Joret, Oliver Schaudt:
Improved approximation algorithms for hitting 3-vertex paths. Math. Program. 182(1): 355-367 (2020) - Michele Conforti, Samuel Fiorini, Tony Huynh, Stefan Weltge:
Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles. IPCO 2020: 104-116 - Michele Conforti, Samuel Fiorini, Tony Huynh, Gwenaël Joret, Stefan Weltge:
The stable set problem in graphs with bounded genus and bounded odd cycle packing number. SODA 2020: 2896-2915 - Manuel Aprile, Michele Conforti, Yuri Faenza, Samuel Fiorini, Tony Huynh, Marco Macchia:
Recognizing Cartesian products of matrices and polytopes. CoRR abs/2002.02264 (2020) - Manuel Aprile, Matthew Drescher, Samuel Fiorini, Tony Huynh:
A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem. CoRR abs/2007.08057 (2020) - 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) - Matthew Drescher, Samuel Fiorini, Tony Huynh:
A simple (2+ε)-approximation algorithm for Split Vertex Deletion. CoRR abs/2009.11056 (2020) - 2019
- Abbas Bazzi, Samuel Fiorini, Sebastian Pokutta, Ola Svensson:
No Small Linear Program Approximates Vertex Cover Within a Factor 2 - ɛ. Math. Oper. Res. 44(1): 147-172 (2019) - 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) - Pierre Aboulker, Samuel Fiorini, Tony Huynh, Marco Macchia, Johanna Seif:
Extension complexity of the correlation polytope. Oper. Res. Lett. 47(1): 47-51 (2019)
skipping 132 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-11-02 18:49 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint