Tony Huynh

According to our database1, Tony Huynh authored at least 43 papers between 2011 and 2021.

Collaborative distances:



In proceedings 
PhD thesis 




Strengthening convex relaxations of 0/1-sets using Boolean formulas.
Math. Program., 2021

Short rainbow cycles in graphs and matroids.
J. Graph Theory, 2021

Unavoidable Minors for Graphs with Large ℓ <sub>p</sub>-Dimension.
Discret. Comput. Geom., 2021

Slack matrices, k-products, and 2-level polytopes.
CoRR, 2021

Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond.
CoRR, 2021

On the Erdős-Pósa property for long holes in C<sub>4</sub>-free graphs.
CoRR, 2021

Flip Distances Between Graph Orientations.
Algorithmica, 2021

A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 2021

The Matroid Secretary Problem for Minor-Closed Classes and Random Matroids.
SIAM J. Discret. Math., 2020

A simple (2+ε)-approximation algorithm for Split Vertex Deletion.
CoRR, 2020

A simple 7/3-approximation algorithm for feedback vertex set in tournaments.
CoRR, 2020

Subgraph densities in a surface.
CoRR, 2020

Notes on Tree- and Path-chromatic Number.
CoRR, 2020

Recognizing Cartesian products of matrices and polytopes.
CoRR, 2020

Excluding a ladder.
CoRR, 2020

Notes on Graph Product Structure Theory.
CoRR, 2020

Seymour's Conjecture on 2-Connected Graphs of Large Pathwidth.
Comb., 2020

The stable set problem in graphs with bounded genus and bounded odd cycle packing number.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles.
Proceedings of the Integer Programming and Combinatorial Optimization, 2020

Idealness of k-wise Intersecting Families.
Proceedings of the Integer Programming and Combinatorial Optimization, 2020

Extension complexity of the correlation polytope.
Oper. Res. Lett., 2019

The Biclique Covering Number of Grids.
Electron. J. Comb., 2019

A Unified Erdős-Pósa Theorem for Constrained Cycles.
Comb., 2019

A tight Erdős-Pósa function for planar minors.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

A Tight Erdös-Pósa Function for Wheel Minors.
SIAM J. Discret. Math., 2018

Characterizing Polytopes in the 0/1-Cube with Bounded Chvátal-Gomory Rank.
Math. Oper. Res., 2018

Explicit bounds for graph minors.
J. Comb. Theory, Ser. B, 2018

Short rainbow cycles in sparse graphs.
CoRR, 2018

Transfinite Ford-Fulkerson on a finite network.
Comput., 2018

The Excluded Minors for Isometric Realizability in the Plane.
SIAM J. Discret. Math., 2017

Strongly Even-Cycle Decomposable Graphs.
J. Graph Theory, 2017

Tree-Chromatic Number Is Not Equal to Path-Chromatic Number<sup>*</sup>.
J. Graph Theory, 2017

Space proof complexity for random 3-CNFs.
Inf. Comput., 2017

Even-cycle decompositions of graphs with no odd-K<sub>4</sub>-minor.
Eur. J. Comb., 2017

Smaller Extended Formulations for the Spanning Tree Polytope of Bounded-Genus Graphs.
Discret. Comput. Geom., 2017

Extension Complexity of Stable Set Polytopes of Bipartite Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

On Hilbert bases of cuts.
Discret. Math., 2016

Characterizing Polytopes Contained in the $0/1$-Cube with Bounded Chvátal-Gomory Rank.
CoRR, 2016

Intertwining Connectivities in Representable Matroids.
SIAM J. Discret. Math., 2014

Space proof complexity for random 3-CNFs via a (2-ε)-Hall's Theorem.
Electron. Colloquium Comput. Complex., 2014

Extremal Problems for Subset Divisors.
Electron. J. Comb., 2014

A 1.0625 ~ 14.025 Gb/s Multi-Media Transceiver With Full-Rate Source-Series-Terminated Transmit Driver and Floating-Tap Decision-Feedback Equalizer in 40 nm CMOS.
IEEE J. Solid State Circuits, 2011

A 1.0625-to-14.025Gb/s multimedia transceiver with full-rate source-series-terminated transmit driver and floating-tap decision-feedback equalizer in 40nm CMOS.
Proceedings of the IEEE International Solid-State Circuits Conference, 2011