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. - Shaolei Quan; Freeman Zhong; Wing Liu; Pervez M. Aziz; Tai Jing; Jen Dong; Chintan Desai; Hairong Gao; Monica Garcia; Gary Hom; Tony Huynh; Hiroshi Kimura; et al. (ISSCC, 2011)

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. - Freeman Zhong; Shaolei Quan; Wing Liu; Pervez M. Aziz; Tai Jing; Jen Dong; Chintan Desai; Hairong Gao; Monica Garcia; Gary Hom; Tony Huynh; Hiroshi Kimura; et al. (IEEE J. Solid State Circuits, 2011)

Extremal Problems for Subset Divisors. - Tony Huynh (Electron. J. Comb., 2014)

Space proof complexity for random 3-CNFs via a (2-ε)-Hall's Theorem. - Ilario Bonacina; Nicola Galesi; Tony Huynh; Paul Wollan (Electron. Colloquium Comput. Complex., 2014)

Intertwining Connectivities in Representable Matroids. - Tony Huynh; Stefan H. M. van Zwam (SIAM J. Discret. Math., 2014)

Characterizing Polytopes Contained in the $0/1$-Cube with Bounded Chvátal-Gomory Rank. - Yohann Benchetrit; Samuel Fiorini; Tony Huynh; Stefan Weltge (CoRR, 2016)

On Hilbert bases of cuts. - Luis A. Goddyn; Tony Huynh; Tanmay Deshpande (Discret. Math., 2016)

Extension Complexity of Stable Set Polytopes of Bipartite Graphs. - Manuel Aprile; Yuri Faenza; Samuel Fiorini; Tony Huynh; Marco Macchia (WG, 2017)

Smaller Extended Formulations for the Spanning Tree Polytope of Bounded-Genus Graphs. - Samuel Fiorini; Tony Huynh; Gwenaël Joret; Kanstantsin Pashkovich (Discret. Comput. Geom., 2017)

Even-cycle decompositions of graphs with no odd-K4-minor. - Tony Huynh; Sang-il Oum; Maryam Verdian-Rizi (Eur. J. Comb., 2017)

Space proof complexity for random 3-CNFs. - Patrick Bennett; Ilario Bonacina; Nicola Galesi; Tony Huynh; Mike Molloy 001; Paul Wollan (Inf. Comput., 2017)

Tree-Chromatic Number Is Not Equal to Path-Chromatic Number*. - Tony Huynh; Ringi Kim (J. Graph Theory, 2017)

Strongly Even-Cycle Decomposable Graphs. - Tony Huynh; Andrew D. King; Sang-il Oum; Maryam Verdian-Rizi (J. Graph Theory, 2017)

The Excluded Minors for Isometric Realizability in the Plane. - Samuel Fiorini; Tony Huynh; Gwenaël Joret; Antonios Varvitsiotis (SIAM J. Discret. Math., 2017)

Transfinite Ford-Fulkerson on a finite network. - Spencer Backman; Tony Huynh (Comput., 2018)

Short rainbow cycles in sparse graphs. - Matt DeVos; Sebastián González Hermosillo de la Maza; Krystal Guo; Daryl Funk; Tony Huynh; Bojan Mohar; Amanda Montejano (CoRR, 2018)

Explicit bounds for graph minors. - Jim Geelen; Tony Huynh; R. Bruce Richter (J. Comb. Theory B, 2018)

Characterizing Polytopes in the 0/1-Cube with Bounded Chvátal-Gomory Rank. - Yohann Benchetrit; Samuel Fiorini; Tony Huynh; Stefan Weltge (Math. Oper. Res., 2018)

A Tight Erdös-Pósa Function for Wheel Minors. - Pierre Aboulker; Samuel Fiorini; Tony Huynh; Gwenaël Joret; Jean-Florent Raymond; Ignasi Sau (SIAM J. Discret. Math., 2018)

A tight Erdős-Pósa function for planar minors. - Wouter Cames van Batenburg; Tony Huynh; Gwenaël Joret; Jean-Florent Raymond (SODA, 2019)

A Unified Erdős-Pósa Theorem for Constrained Cycles. - Tony Huynh; Felix Joos; Paul Wollan (Comb., 2019)

The Biclique Covering Number of Grids. - Krystal Guo; Tony Huynh; Marco Macchia (Electron. J. Comb., 2019)

Extension complexity of the correlation polytope. - Pierre Aboulker; Samuel Fiorini; Tony Huynh; Marco Macchia; Johanna Seif (Oper. Res. Lett., 2019)

The stable set problem in graphs with bounded genus and bounded odd cycle packing number. - Michele Conforti; Samuel Fiorini; Tony Huynh; Gwenaël Joret; Stefan Weltge (SODA, 2020)

Seymour's Conjecture on 2-Connected Graphs of Large Pathwidth. - Tony Huynh; Gwenaël Joret; Piotr Micek; David R. Wood (Comb., 2020)

Notes on Graph Product Structure Theory. - Zdenek Dvorák 001; Tony Huynh; Gwenaël Joret; Chun-Hung Liu; David R. Wood (CoRR, 2020)

Recognizing Cartesian products of matrices and polytopes. - Manuel Aprile; Michele Conforti; Yuri Faenza; Samuel Fiorini; Tony Huynh; Marco Macchia (CoRR, 2020)

Notes on Tree- and Path-chromatic Number. - Tony Huynh; Bruce A. Reed; David R. Wood; Liana Yepremyan (CoRR, 2020)

A simple 7/3-approximation algorithm for feedback vertex set in tournaments. - Manuel Aprile; Matthew Drescher; Samuel Fiorini; Tony Huynh (CoRR, 2020)

The Matroid Secretary Problem for Minor-Closed Classes and Random Matroids. - Tony Huynh; Peter Nelson (SIAM J. Discret. Math., 2020)

Flip Distances Between Graph Orientations. - Oswin Aichholzer; Jean Cardinal; Tony Huynh; Kolja Knauer; Torsten Mütze; Raphael Steiner; Birgit Vogtenhuber (Algorithmica, 2021)

Smaller Extended Formulations for Spanning Tree Polytopes in Minor-closed Classes and Beyond. - Manuel Aprile; Samuel Fiorini; Tony Huynh; Gwenaël Joret; David R. Wood (Electron. J. Comb., 2021)

On the Erdős-Pósa property for long holes in C4-free graphs. - Tony Huynh; O-joung Kwon (CoRR, 2021)

Unavoidable Minors for Graphs with Large ℓ p-Dimension. - Samuel Fiorini; Tony Huynh; Gwenaël Joret; Carole Muller (Discret. Comput. Geom., 2021)

Short rainbow cycles in graphs and matroids. - Matt DeVos; Matthew Drescher; Daryl Funk; Sebastián González Hermosillo de la Maza; Krystal Guo; Tony Huynh; Bojan Mohar; Amanda Montejano (J. Graph Theory, 2021)

Strengthening convex relaxations of 0/1-sets using Boolean formulas. - Samuel Fiorini; Tony Huynh; Stefan Weltge (Math. Program., 2021)

Excluding a Ladder. - Tony Huynh; Gwenaël Joret; Piotr Micek; Michal T. Seweryn; Paul Wollan (Comb., 2022)

Notes on Aharoni's rainbow cycle conjecture. - Katie Clinch; Jackson Goerner; Tony Huynh; Freddie Illingworth (CoRR, 2022)

Subgraph densities in a surface. - Tony Huynh; Gwenaël Joret; David R. Wood (Comb. Probab. Comput., 2022)

Improved product structure for graphs on surfaces. - Marc Distel; Robert Hickingbotham; Tony Huynh; David R. Wood (Discret. Math. Theor. Comput. Sci., 2022)

Idealness of k-wise intersecting families. - Ahmad Abdi; Gérard Cornuéjols; Tony Huynh; Dabeen Lee (Math. Program., 2022)

Correction to: Idealness of k-wise intersecting families. - Ahmad Abdi; Gérard Cornuéjols; Tony Huynh; Dabeen Lee (Math. Program., 2022)

Extended formulations for stable set polytopes of graphs without two disjoint odd cycles. - Michele Conforti; Samuel Fiorini; Tony Huynh; Stefan Weltge (Math. Program., 2022)

E2C: A Visual Simulator to Reinforce Education of Heterogeneous Computing Systems. - Ali Mokhtari; Drake Rawls; Tony Huynh; Jeremiah Green; Mohsen Amini Salehi (IPDPS Workshops, 2023)

The induced two paths problem. - Sandra Albrechtsen; Tony Huynh; Raphael W. Jacobs; Paul Knappe; Paul Wollan (CoRR, 2023)

A tight approximation algorithm for the cluster vertex deletion problem. - Manuel Aprile; Matthew Drescher; Samuel Fiorini; Tony Huynh (Math. Program., 2023)

A 7/3-approximation algorithm for feedback vertex set in tournaments via Sherali-Adams. - Manuel Aprile; Matthew Drescher; Samuel Fiorini; Tony Huynh (Discret. Appl. Math., 2023)

Constructions, bounds, and algorithms for peaceable queens. - Katie Clinch; Matthew Drescher; Tony Huynh; Abdallah Saffidine (CoRR, 2024)

Spanning disks in triangulations of surfaces. - Katie Clinch; Sean Dewar; Niloufar Fuladi; Maximilian Gorsky; Tony Huynh; Eleftherios Kastis; Anthony Nixon; Brigitte Servatius (CoRR, 2024)

Product structure of graph classes with bounded treewidth. - Rutger Campbell; Katie Clinch; Marc Distel; J. Pascal Gollin; Kevin Hendrey; Robert Hickingbotham; Tony Huynh; Freddie Illingworth; Youri Tamitegama; Jane Tan; David R. Wood (Comb. Probab. Comput., 2024)

Slack matrices, k-products, and 2-level polytopes. - Manuel Aprile; Michele Conforti; Samuel Fiorini; Yuri Faenza; Tony Huynh; Marco Macchia (Discret. Appl. Math., 2024)

A simple (2+ϵ)-approximation algorithm for Split Vertex Deletion. - Matthew Drescher; Samuel Fiorini; Tony Huynh (Eur. J. Comb., 2024)

A Menger-Type Theorem for Two Induced Paths. - Sandra Albrechtsen; Tony Huynh; Raphael W. Jacobs; Paul Knappe; Paul Wollan (SIAM J. Discret. Math., 2024)

On the Erdős-Pósa Property for Long Holes in ( boldsymbol{C_4} )-Free Graphs. - Tony Huynh; O-joung Kwon (SIAM J. Discret. Math., 2024)

A coarse Erdős-Pósa theorem. - Jungho Ahn; J. Pascal Gollin; Tony Huynh; O-joung Kwon (SODA, 2025)

Aharoni's rainbow cycle conjecture holds up to an additive constant. - Patrick Hompe; Tony Huynh (J. Comb. Theory B, 2025)

Cluster deletion and clique partitioning in graphs with bounded clique number. - Nicola Galesi; Tony Huynh; Fariba Ranjbar (CoRR, 2025)