Tony Huynh

From MaRDI portal
Person:405130

Available identifiers

zbMath Open huynh.tonyWikidataQ102355629 ScholiaQ102355629MaRDI QIDQ405130

List of research outcomes





PublicationDate of PublicationType
Product structure of graph classes with bounded treewidth2024-11-05Paper
Product structure of graph classes with bounded treewidth2024-10-31Paper
Notes on Aharoni's rainbow cycle conjecture2024-10-31Paper
A simple \((2 + \epsilon)\)-approximation algorithm for split vertex deletion2024-09-30Paper
Slack matrices, \(k\)-products, and 2-level polytopes2024-06-20Paper
A Menger-type theorem for two induced paths2024-05-08Paper
Explicit bounds for graph minors2024-01-05Paper
Short rainbow cycles in graphs and matroids2023-09-29Paper
A \(7 / 3\)-approximation algorithm for feedback vertex set in tournaments via Sherali-Adams2023-06-15Paper
Improved product structure for graphs on surfaces2023-05-31Paper
Subgraph densities in a surface2023-03-31Paper
A tight approximation algorithm for the cluster vertex deletion problem2023-03-14Paper
Notes on Aharoni's rainbow cycle conjecture2022-11-14Paper
Excluding a ladder2022-11-09Paper
Tree densities in sparse graph classes2022-11-08Paper
Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles2022-10-14Paper
Idealness of k-wise Intersecting Families2022-10-14Paper
Product structure of graph classes with bounded treewidth2022-06-06Paper
Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond2022-04-04Paper
Extended formulations for stable set polytopes of graphs without two disjoint odd cycles2022-03-22Paper
Correction to: ``Idealness of \(k\)-wise intersecting families2022-03-22Paper
Idealness of \(k\)-wise intersecting families2022-03-22Paper
A tight approximation algorithm for the cluster vertex deletion problem2021-12-21Paper
Notes on tree- and path-chromatic number2021-12-10Paper
Notes on graph product structure theory2021-12-10Paper
Recognizing Cartesian products of matrices and polytopes2021-12-08Paper
Strengthening convex relaxations of 0/1-sets using Boolean formulas2021-10-20Paper
Universality in minor-closed graph classes2021-09-01Paper
Unavoidable minors for graphs with large \(\ell_p\)-dimension2021-07-02Paper
Seymour's conjecture on 2-connected graphs of large pathwidth2021-04-16Paper
The stable set problem in graphs with bounded genus and bounded odd cycle packing number2021-02-02Paper
Flip distances between graph orientations2021-02-01Paper
A tight Erdős-Pósa function for planar minors2020-10-20Paper
A simple $(2+\epsilon)$-approximation algorithm for Split Vertex Deletion2020-09-23Paper
A simple 7/3-approximation algorithm for feedback vertex set in tournaments2020-08-20Paper
Characterizing Polytopes in the 0/1-Cube with Bounded Chvátal-Gomory Rank2020-03-12Paper
Flip distances between graph orientations2020-02-24Paper
Extension complexity of the correlation polytope2020-02-10Paper
Excluding a ladder2020-02-02Paper
The biclique covering number of grids2019-11-15Paper
A tight Erdős-Pósa function for planar minors2019-10-15Paper
Transfinite Ford–Fulkerson on a finite network2019-03-20Paper
A Tight Erdös--Pósa Function for Wheel Minors2018-09-14Paper
Explicit bounds for graph minors2018-07-24Paper
Extension complexity of stable set polytopes of bipartite graphs2018-01-04Paper
Tree‐Chromatic Number Is Not Equal to Path‐Chromatic Number*2017-09-26Paper
Even-cycle decompositions of graphs with no odd-\(K_4\)-minor2017-08-31Paper
Space proof complexity for random 3-CNFs2017-08-08Paper
Smaller extended formulations for the spanning tree polytope of bounded-genus graphs2017-05-11Paper
The Excluded Minors for Isometric Realizability in the Plane2017-03-16Paper
Strongly Even-Cycle Decomposable Graphs2017-02-01Paper
On Hilbert bases of cuts2015-12-08Paper
Space proof complexity for random $3$-CNFs via a $(2-\epsilon)$-Hall's Theorem2014-11-06Paper
Extremal problems for subset divisors2014-09-04Paper
Intertwining Connectivities in Representable Matroids2014-06-19Paper
Aharoni's rainbow cycle conjecture holds up to an additive constantN/APaper

Research outcomes over time

This page was built for person: Tony Huynh