Остановите войну!
for scientists:
default search action
Tony Huynh
- > Home > Persons > Tony Huynh
Publications
- 2023
- [j32]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) - [j31]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
- [j25]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
- [j23]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) - [j22]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) - [j20]Samuel Fiorini, Tony Huynh, Stefan Weltge:
Strengthening convex relaxations of 0/1-sets using Boolean formulas. Math. Program. 190(1): 467-482 (2021) - [c8]Manuel Aprile, Matthew Drescher, Samuel Fiorini, Tony Huynh:
A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem. IPCO 2021: 340-353 - [i32]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) - [i31]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
- [c6]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 - [c5]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 - [i28]Manuel Aprile, Michele Conforti, Yuri Faenza, Samuel Fiorini, Tony Huynh, Marco Macchia:
Recognizing Cartesian products of matrices and polytopes. CoRR abs/2002.02264 (2020) - [i25]Manuel Aprile, Matthew Drescher, Samuel Fiorini, Tony Huynh:
A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem. CoRR abs/2007.08057 (2020) - [i24]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) - [i23]Matthew Drescher, Samuel Fiorini, Tony Huynh:
A simple (2+ε)-approximation algorithm for Split Vertex Deletion. CoRR abs/2009.11056 (2020) - 2019
- [j15]Pierre Aboulker, Samuel Fiorini, Tony Huynh, Marco Macchia, Johanna Seif:
Extension complexity of the correlation polytope. Oper. Res. Lett. 47(1): 47-51 (2019) - [i21]Samuel Fiorini, Tony Huynh, Gwenaël Joret, Carole Muller:
Unavoidable minors for graphs with large 𝓁p-dimension. CoRR abs/1904.02951 (2019) - [i20]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. CoRR abs/1908.06300 (2019) - [i19]Michele Conforti, Samuel Fiorini, Tony Huynh, Stefan Weltge:
Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles. CoRR abs/1911.12179 (2019) - 2018
- [j12]Yohann Benchetrit, Samuel Fiorini, Tony Huynh, Stefan Weltge:
Characterizing Polytopes in the 0/1-Cube with Bounded Chvátal-Gomory Rank. Math. Oper. Res. 43(3): 718-725 (2018) - [j11]Pierre Aboulker, Samuel Fiorini, Tony Huynh, Gwenaël Joret, Jean-Florent Raymond, Ignasi Sau:
A Tight Erdös-Pósa Function for Wheel Minors. SIAM J. Discret. Math. 32(3): 2302-2312 (2018) - [i16]Pierre Aboulker, Samuel Fiorini, Tony Huynh, Marco Macchia, Johanna Seif:
Extension Complexity of the Correlation Polytope. CoRR abs/1806.00541 (2018) - 2017
- [j10]Samuel Fiorini, Tony Huynh, Gwenaël Joret, Kanstantsin Pashkovich:
Smaller Extended Formulations for the Spanning Tree Polytope of Bounded-Genus Graphs. Discret. Comput. Geom. 57(3): 757-761 (2017) - [j5]Samuel Fiorini, Tony Huynh, Gwenaël Joret, Antonios Varvitsiotis:
The Excluded Minors for Isometric Realizability in the Plane. SIAM J. Discret. Math. 31(1): 438-453 (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 - [i12]Manuel Aprile, Yuri Faenza, Samuel Fiorini, Tony Huynh, Marco Macchia:
Extension complexity of stable set polytopes of bipartite graphs. CoRR abs/1702.08741 (2017) - [i11]Pierre Aboulker, Samuel Fiorini, Tony Huynh, Gwenaël Joret, Jean-Florent Raymond, Ignasi Sau:
A tight Erdős-Pósa function for wheel minors. CoRR abs/1710.06282 (2017) - [i10]Samuel Fiorini, Tony Huynh, Stefan Weltge:
Strengthening Convex Relaxations of 0/1-Sets Using Boolean Formulas. CoRR abs/1711.01358 (2017) - 2016
- [i8]Samuel Fiorini, Tony Huynh, Gwenaël Joret, Kanstantsin Pashkovich:
Smaller Extended Formulations for the Spanning Tree Polytope of Bounded-genus Graphs. CoRR abs/1604.07976 (2016) - [i7]Yohann Benchetrit, Samuel Fiorini, Tony Huynh, Stefan Weltge:
Characterizing Polytopes Contained in the $0/1$-Cube with Bounded Chvátal-Gomory Rank. CoRR abs/1611.06593 (2016) - 2015
- [i4]Samuel Fiorini, Tony Huynh, Gwenaël Joret, Antonios Varvitsiotis:
The excluded minors for isometric realizability in the plane. CoRR abs/1511.08054 (2015)
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-04-16 23:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint