default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTony Huynh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j37]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): 351-376 (2024)- [j36]Manuel Aprile, Michele Conforti, Samuel Fiorini, Yuri Faenza, Tony Huynh, Marco Macchia:
Slack matrices, k-products, and 2-level polytopes. Discret. Appl. Math. 354: 199-213 (2024) - [j35]Matthew Drescher, Samuel Fiorini, Tony Huynh:
A simple (2+ϵ)-approximation algorithm for Split Vertex Deletion. Eur. J. Comb. 121: 103844 (2024) - [j34]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): 19-42 (2024) - [j33]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): 1438-1450 (2024) - [i39]Katie Clinch, Matthew Drescher, Tony Huynh, Abdallah Saffidine:
Constructions, bounds, and algorithms for peaceable queens. CoRR abs/2406.06974 (2024) - 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) - [c9]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: 270-277 - [i38]Ali Mokhtari, Drake Rawls, Tony Huynh, Jeremiah Green, Mohsen Amini Salehi:
E2C: A Visual Simulator to Reinforce Education of Heterogeneous Computing Systems. CoRR abs/2303.10901 (2023) - [i37]Sandra Albrechtsen, Tony Huynh, Raphael W. Jacobs, Paul Knappe, Paul Wollan:
The induced two paths problem. CoRR abs/2305.04721 (2023) - 2022
- [j30]Tony Huynh, Gwenaël Joret, Piotr Micek, Michal T. Seweryn, Paul Wollan:
Excluding a Ladder. Comb. 42(3): 405-432 (2022) - [j29]Tony Huynh, Gwenaël Joret, David R. Wood:
Subgraph densities in a surface. Comb. Probab. Comput. 31(5): 812-839 (2022) - [j28]Marc Distel, Robert Hickingbotham, Tony Huynh, David R. Wood:
Improved product structure for graphs on surfaces. Discret. Math. Theor. Comput. Sci. 24(2) (2022) - [j27]Ahmad Abdi, Gérard Cornuéjols, Tony Huynh, Dabeen Lee:
Idealness of k-wise intersecting families. Math. Program. 192(1): 29-50 (2022) - [j26]Ahmad Abdi, Gérard Cornuéjols, Tony Huynh, Dabeen Lee:
Correction to: Idealness of k-wise intersecting families. Math. Program. 192(1): 51-55 (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) - [i36]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 abs/2206.02395 (2022) - [i35]Katie Clinch, Jackson Goerner, Tony Huynh, Freddie Illingworth:
Notes on Aharoni's rainbow cycle conjecture. CoRR abs/2211.07897 (2022) - [i34]Patrick Hompe, Tony Huynh:
Aharoni's rainbow cycle conjecture holds up to an additive constant. CoRR abs/2212.05697 (2022) - 2021
- [j24]Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mütze, Raphael Steiner, Birgit Vogtenhuber:
Flip Distances Between Graph Orientations. Algorithmica 83(1): 116-143 (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) - [j21]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): 192-202 (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 - [i33]Tony Huynh, O-joung Kwon:
On the Erdős-Pósa property for long holes in C4-free graphs. CoRR abs/2105.11799 (2021) - [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
- [j19]Tony Huynh, Gwenaël Joret, Piotr Micek, David R. Wood:
Seymour's Conjecture on 2-Connected Graphs of Large Pathwidth. Comb. 40(6): 839-868 (2020) - [j18]Tony Huynh, Peter Nelson:
The Matroid Secretary Problem for Minor-Closed Classes and Random Matroids. SIAM J. Discret. Math. 34(1): 163-176 (2020) - [c7]Ahmad Abdi, Gérard Cornuéjols, Tony Huynh, Dabeen Lee:
Idealness of k-wise Intersecting Families. IPCO 2020: 1-12 - [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 - [i30]Zdenek Dvorák, Tony Huynh, Gwenaël Joret, Chun-Hung Liu, David R. Wood:
Notes on Graph Product Structure Theory. CoRR abs/2001.08860 (2020) - [i29]Tony Huynh, Gwenaël Joret, Piotr Micek, Michal T. Seweryn, Paul Wollan:
Excluding a ladder. CoRR abs/2002.00496 (2020) - [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) - [i27]Tony Huynh, Bruce A. Reed, David R. Wood, Liana Yepremyan:
Notes on Tree- and Path-chromatic Number. CoRR abs/2002.05363 (2020) - [i26]Tony Huynh, Gwenaël Joret, David R. Wood:
Subgraph densities in a surface. CoRR abs/2003.13777 (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)
2010 – 2019
- 2019
- [j17]Tony Huynh, Felix Joos, Paul Wollan:
A Unified Erdős-Pósa Theorem for Constrained Cycles. Comb. 39(1): 91-133 (2019) - [j16]Krystal Guo, Tony Huynh, Marco Macchia:
The Biclique Covering Number of Grids. Electron. J. Comb. 26(4): 4 (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) - [c4]Wouter Cames van Batenburg, Tony Huynh, Gwenaël Joret, Jean-Florent Raymond:
A tight Erdős-Pósa function for planar minors. SODA 2019: 1485-1500 - [c3]Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mütze, Raphael Steiner, Birgit Vogtenhuber:
Flip Distances Between Graph Orientations. WG 2019: 120-134 - [i22]Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mütze, Raphael Steiner, Birgit Vogtenhuber:
Flip distances between graph orientations. CoRR abs/1902.06103 (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) - [i18]Ahmad Abdi, Gérard Cornuéjols, Tony Huynh, Dabeen Lee:
Idealness of k-wise intersecting families. CoRR abs/1912.00614 (2019) - 2018
- [j14]Spencer Backman, Tony Huynh:
Transfinite Ford-Fulkerson on a finite network. Comput. 7(4): 341-347 (2018) - [j13]Jim Geelen, Tony Huynh, R. Bruce Richter:
Explicit bounds for graph minors. J. Comb. Theory B 132: 80-106 (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) - [i17]Tony Huynh, Gwenaël Joret, Piotr Micek, David R. Wood:
Seymour's conjecture on 2-connected graphs of large pathwidth. CoRR abs/1801.01833 (2018) - [i16]Pierre Aboulker, Samuel Fiorini, Tony Huynh, Marco Macchia, Johanna Seif:
Extension Complexity of the Correlation Polytope. CoRR abs/1806.00541 (2018) - [i15]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 abs/1806.00825 (2018) - [i14]Wouter Cames van Batenburg, Tony Huynh, Gwenaël Joret, Jean-Florent Raymond:
A tight Erdős-Pósa function for planar minors. CoRR abs/1807.04969 (2018) - [i13]Krystal Guo, Tony Huynh, Marco Macchia:
The biclique covering number of grids. CoRR abs/1811.03396 (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) - [j9]Tony Huynh, Sang-il Oum, Maryam Verdian-Rizi:
Even-cycle decompositions of graphs with no odd-K4-minor. Eur. J. Comb. 65: 1-14 (2017) - [j8]Patrick Bennett, Ilario Bonacina, Nicola Galesi, Tony Huynh, Mike Molloy, Paul Wollan:
Space proof complexity for random 3-CNFs. Inf. Comput. 255: 165-176 (2017) - [j7]Tony Huynh, Andrew D. King, Sang-il Oum, Maryam Verdian-Rizi:
Strongly Even-Cycle Decomposable Graphs. J. Graph Theory 84(2): 158-175 (2017) - [j6]Tony Huynh, Ringi Kim:
Tree-Chromatic Number Is Not Equal to Path-Chromatic Number*. J. Graph Theory 86(2): 213-222 (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
- [j4]Luis A. Goddyn, Tony Huynh, Tanmay Deshpande:
On Hilbert bases of cuts. Discret. Math. 339(2): 721-728 (2016) - [i9]Tony Huynh, Peter Nelson:
The matroid secretary problem for minor-closed classes and random matroids. CoRR abs/1603.06822 (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
- [i6]Patrick Bennett, Ilario Bonacina, Nicola Galesi, Tony Huynh, Mike Molloy, Paul Wollan:
Space proof complexity for random 3-CNFs. CoRR abs/1503.01613 (2015) - [i5]Spencer Backman, Tony Huynh:
Transfinite Ford-Fulkerson on a Finite Network. CoRR abs/1504.04363 (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) - 2014
- [j3]Tony Huynh:
Extremal Problems for Subset Divisors. Electron. J. Comb. 21(1): 1 (2014) - [j2]Tony Huynh, Stefan H. M. van Zwam:
Intertwining Connectivities in Representable Matroids. SIAM J. Discret. Math. 28(1): 188-196 (2014) - [i3]Ilario Bonacina, Nicola Galesi, Tony Huynh, Paul Wollan:
Space proof complexity for random $3$-CNFs via a $(2-ε)$-Hall's Theorem. CoRR abs/1411.1619 (2014) - [i2]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. TR14 (2014) - 2012
- [i1]Tony Huynh, Andrew D. King, Sang-il Oum, Maryam Verdian-Rizi:
Strongly even cycle decomposable graphs. CoRR abs/1209.0160 (2012) - 2011
- [j1]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): 3126-3139 (2011) - [c1]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: 348-350
Coauthor Index
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-10-07 22:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
