Tony Huynh

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 75

Top Topics

Bounded Treewidth

Tractable Classes

Top Venues

SIAM J. Discret. Math.

Publications

Manuel Aprile, Michele Conforti, Samuel Fiorini, Yuri Faenza, Tony Huynh, Marco Macchia
Slack matrices, k-products, and 2-level polytopes. Discret. Appl. Math. 354 (2024)
Tony Huynh, O-joung Kwon
On the Erdős-Pósa Property for Long Holes in \(\boldsymbol{C_4}\)-Free Graphs. SIAM J. Discret. Math. 38 (1) (2024)
Katie Clinch, Matthew Drescher, Tony Huynh, Abdallah Saffidine
Constructions, bounds, and algorithms for peaceable queens. CoRR (2024)
Sandra Albrechtsen, Tony Huynh, Raphael W. Jacobs, Paul Knappe, Paul Wollan
A Menger-Type Theorem for Two Induced Paths. SIAM J. Discret. Math. 38 (2) (2024)
Matthew Drescher, Samuel Fiorini, Tony Huynh
A simple (2+ϵ)-approximation algorithm for Split Vertex Deletion. Eur. J. Comb. 121 (2024)
Rutger Campbell, Katie Clinch, Marc Distel, J. Pascal Gollin, Kevin Hendrey, Robert Hickingbotham, Tony Huynh, Freddie Illingworth, Youri Tamitegama, Jane Tan, David R. Wood
Product structure of graph classes with bounded treewidth. Comb. Probab. Comput. 33 (3) (2024)
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 (2023)
Sandra Albrechtsen, Tony Huynh, Raphael W. Jacobs, Paul Knappe, Paul Wollan
The induced two paths problem. CoRR (2023)
Ali Mokhtari, Drake Rawls, Tony Huynh, Jeremiah Green, Mohsen Amini Salehi
E2C: A Visual Simulator to Reinforce Education of Heterogeneous Computing Systems. IPDPS Workshops (2023)
Manuel Aprile, Matthew Drescher, Samuel Fiorini, Tony Huynh
A tight approximation algorithm for the cluster vertex deletion problem. Math. Program. 197 (2) (2023)
Ali Mokhtari, Drake Rawls, Tony Huynh, Jeremiah Green, Mohsen Amini Salehi
E2C: A Visual Simulator to Reinforce Education of Heterogeneous Computing Systems. CoRR (2023)
Marc Distel, Robert Hickingbotham, Tony Huynh, David R. Wood
Improved product structure for graphs on surfaces. Discret. Math. Theor. Comput. Sci. 24 (2) (2022)
Patrick Hompe, Tony Huynh
Aharoni's rainbow cycle conjecture holds up to an additive constant. CoRR (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) (2022)
Tony Huynh, Gwenaël Joret, David R. Wood
Subgraph densities in a surface. Comb. Probab. Comput. 31 (5) (2022)
Rutger Campbell, Katie Clinch, Marc Distel, J. Pascal Gollin, Kevin Hendrey, Robert Hickingbotham, Tony Huynh, Freddie Illingworth, Youri Tamitegama, Jane Tan, David R. Wood
Product structure of graph classes with bounded treewidth. CoRR (2022)
Ahmad Abdi, Gérard Cornuéjols, Tony Huynh, Dabeen Lee
Idealness of k-wise intersecting families. Math. Program. 192 (1) (2022)
Katie Clinch, Jackson Goerner, Tony Huynh, Freddie Illingworth
Notes on Aharoni's rainbow cycle conjecture. CoRR (2022)
Tony Huynh, Gwenaël Joret, Piotr Micek, Michal T. Seweryn, Paul Wollan
Excluding a Ladder. Comb. 42 (3) (2022)
Ahmad Abdi, Gérard Cornuéjols, Tony Huynh, Dabeen Lee
Correction to: Idealness of k-wise intersecting families. Math. Program. 192 (1) (2022)
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, Stefan Weltge
Strengthening convex relaxations of 0/1-sets using Boolean formulas. Math. Program. 190 (1) (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 (2021)
Matt DeVos, Matthew Drescher, Daryl Funk, Sebastián González Hermosillo de la Maza, Krystal Guo, Tony Huynh, Bojan Mohar, Amanda Montejano
Short rainbow cycles in graphs and matroids. J. Graph Theory 96 (2) (2021)
Manuel Aprile, Michele Conforti, Yuri Faenza, Samuel Fiorini, Tony Huynh, Marco Macchia
Slack matrices, k-products, and 2-level polytopes. CoRR (2021)
Samuel Fiorini, Tony Huynh, Gwenaël Joret, Carole Muller
-Dimension. Discret. Comput. Geom. 66 (1) (2021)
Manuel Aprile, Matthew Drescher, Samuel Fiorini, Tony Huynh
A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem. IPCO (2021)
Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mütze, Raphael Steiner, Birgit Vogtenhuber
Flip Distances Between Graph Orientations. Algorithmica 83 (1) (2021)
Tony Huynh, O-joung Kwon
-free graphs. CoRR (2021)
Michele Conforti, Samuel Fiorini, Tony Huynh, Stefan Weltge
Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles. IPCO (2020)
Manuel Aprile, Matthew Drescher, Samuel Fiorini, Tony Huynh
A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem. CoRR (2020)
Ahmad Abdi, Gérard Cornuéjols, Tony Huynh, Dabeen Lee
Idealness of k-wise Intersecting Families. IPCO (2020)
Manuel Aprile, Michele Conforti, Yuri Faenza, Samuel Fiorini, Tony Huynh, Marco Macchia
Recognizing Cartesian products of matrices and polytopes. CoRR (2020)
Tony Huynh, Gwenaël Joret, Piotr Micek, David R. Wood
Seymour's Conjecture on 2-Connected Graphs of Large Pathwidth. Comb. 40 (6) (2020)
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)
Tony Huynh, Gwenaël Joret, Piotr Micek, Michal T. Seweryn, Paul Wollan
Excluding a ladder. CoRR (2020)
Zdenek Dvorák, Tony Huynh, Gwenaël Joret, Chun-Hung Liu, David R. Wood
Notes on Graph Product Structure Theory. CoRR (2020)
Tony Huynh, Peter Nelson
The Matroid Secretary Problem for Minor-Closed Classes and Random Matroids. SIAM J. Discret. Math. 34 (1) (2020)
Manuel Aprile, Matthew Drescher, Samuel Fiorini, Tony Huynh
A simple 7/3-approximation algorithm for feedback vertex set in tournaments. CoRR (2020)
Tony Huynh, Gwenaël Joret, David R. Wood
Subgraph densities in a surface. CoRR (2020)
Matthew Drescher, Samuel Fiorini, Tony Huynh
A simple (2+ε)-approximation algorithm for Split Vertex Deletion. CoRR (2020)
Tony Huynh, Bruce A. Reed, David R. Wood, Liana Yepremyan
Notes on Tree- and Path-chromatic Number. CoRR (2020)
Tony Huynh, Felix Joos, Paul Wollan
A Unified Erdős-Pósa Theorem for Constrained Cycles. Comb. 39 (1) (2019)
Michele Conforti, Samuel Fiorini, Tony Huynh, Stefan Weltge
Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles. CoRR (2019)
Ahmad Abdi, Gérard Cornuéjols, Tony Huynh, Dabeen Lee
Idealness of k-wise intersecting families. CoRR (2019)
Krystal Guo, Tony Huynh, Marco Macchia
The Biclique Covering Number of Grids. Electron. J. Comb. 26 (4) (2019)
Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mütze, Raphael Steiner, Birgit Vogtenhuber
Flip distances between graph orientations. CoRR (2019)
Samuel Fiorini, Tony Huynh, Gwenaël Joret, Carole Muller
-dimension. CoRR (2019)
Pierre Aboulker, Samuel Fiorini, Tony Huynh, Marco Macchia, Johanna Seif
Extension complexity of the correlation polytope. Oper. Res. Lett. 47 (1) (2019)
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 (2019)
Wouter Cames van Batenburg, Tony Huynh, Gwenaël Joret, Jean-Florent Raymond
A tight Erdős-Pósa function for planar minors. SODA (2019)
Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mütze, Raphael Steiner, Birgit Vogtenhuber
Flip Distances Between Graph Orientations. WG (2019)
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) (2018)
Krystal Guo, Tony Huynh, Marco Macchia
The biclique covering number of grids. CoRR (2018)
Jim Geelen, Tony Huynh, R. Bruce Richter
Explicit bounds for graph minors. J. Comb. Theory, Ser. B 132 (2018)
Matt DeVos, Sebastián González Hermosillo de la Maza, Krystal Guo, Daryl Funk, Tony Huynh, Bojan Mohar, Amanda Montejano
Short rainbow cycles in sparse graphs. CoRR (2018)
Spencer Backman, Tony Huynh
Transfinite Ford-Fulkerson on a finite network. Comput. 7 (4) (2018)
Pierre Aboulker, Samuel Fiorini, Tony Huynh, Marco Macchia, Johanna Seif
Extension Complexity of the Correlation Polytope. CoRR (2018)
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) (2018)
Wouter Cames van Batenburg, Tony Huynh, Gwenaël Joret, Jean-Florent Raymond
A tight Erdős-Pósa function for planar minors. CoRR (2018)
Tony Huynh, Gwenaël Joret, Piotr Micek, David R. Wood
Seymour's conjecture on 2-connected graphs of large pathwidth. CoRR (2018)
Tony Huynh, Andrew D. King, Sang-il Oum, Maryam Verdian-Rizi
Strongly Even-Cycle Decomposable Graphs. J. Graph Theory 84 (2) (2017)
Patrick Bennett, Ilario Bonacina, Nicola Galesi, Tony Huynh, Mike Molloy, Paul Wollan
Space proof complexity for random 3-CNFs. Inf. Comput. 255 (2017)
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 (2017)
Manuel Aprile, Yuri Faenza, Samuel Fiorini, Tony Huynh, Marco Macchia
Extension Complexity of Stable Set Polytopes of Bipartite Graphs. WG (2017)
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) (2017)
Samuel Fiorini, Tony Huynh, Stefan Weltge
Strengthening Convex Relaxations of 0/1-Sets Using Boolean Formulas. CoRR (2017)
Manuel Aprile, Yuri Faenza, Samuel Fiorini, Tony Huynh, Marco Macchia
Extension complexity of stable set polytopes of bipartite graphs. CoRR (2017)
Tony Huynh, Sang-il Oum, Maryam Verdian-Rizi
-minor. Eur. J. Comb. 65 (2017)
Samuel Fiorini, Tony Huynh, Gwenaël Joret, Antonios Varvitsiotis
The Excluded Minors for Isometric Realizability in the Plane. SIAM J. Discret. Math. 31 (1) (2017)
Tony Huynh, Ringi Kim
. J. Graph Theory 86 (2) (2017)
Luis A. Goddyn, Tony Huynh, Tanmay Deshpande
On Hilbert bases of cuts. Discret. Math. 339 (2) (2016)
Tony Huynh, Peter Nelson
The matroid secretary problem for minor-closed classes and random matroids. CoRR (2016)
Samuel Fiorini, Tony Huynh, Gwenaël Joret, Kanstantsin Pashkovich
Smaller Extended Formulations for the Spanning Tree Polytope of Bounded-genus Graphs. CoRR (2016)
Yohann Benchetrit, Samuel Fiorini, Tony Huynh, Stefan Weltge
Characterizing Polytopes Contained in the $0/1$-Cube with Bounded Chvátal-Gomory Rank. CoRR (2016)
Spencer Backman, Tony Huynh
Transfinite Ford-Fulkerson on a Finite Network. CoRR (2015)
Samuel Fiorini, Tony Huynh, Gwenaël Joret, Antonios Varvitsiotis
The excluded minors for isometric realizability in the plane. CoRR (2015)
Patrick Bennett, Ilario Bonacina, Nicola Galesi, Tony Huynh, Mike Molloy, Paul Wollan
Space proof complexity for random 3-CNFs. CoRR (2015)
Ilario Bonacina, Nicola Galesi, Tony Huynh, Paul Wollan
Space proof complexity for random $3$-CNFs via a $(2-ε)$-Hall's Theorem. CoRR (2014)
Tony Huynh, Stefan H. M. van Zwam
Intertwining Connectivities in Representable Matroids. SIAM J. Discret. Math. 28 (1) (2014)
Ilario Bonacina, Nicola Galesi, Tony Huynh, Paul Wollan
Space proof complexity for random 3-CNFs via a (2-ε)-Hall's Theorem. Electron. Colloquium Comput. Complex. 21 (2014)
Tony Huynh
Extremal Problems for Subset Divisors. Electron. J. Comb. 21 (1) (2014)
Tony Huynh, Andrew D. King, Sang-il Oum, Maryam Verdian-Rizi
Strongly even cycle decomposable graphs CoRR (2012)
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, Ruchi Kothari, Lijun Li, Cathy Liu, Scott Lowrie, Kathy Ling, Amaresh V. Malipatil, Ram Narayan, Tom Prokop, Chaitanya Palusa, Anil Rajashekara, Ashutosh Sinha, Charlie Zhong, Eric Zhang
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. ISSCC (2011)
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, Ruchi Kothari, Lijun Li, Cathy Liu, Scott Lowrie, Kathy Ling, Amaresh V. Malipatil, Ram Narayan, Tom Prokop, Chaitanya Palusa, Anil Rajashekara, Ashutosh Sinha, Charlie Zhong, Eric Zhang
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 46 (12) (2011)