Tony Huynh
Tony Huynh
School of Mathematics, Monash University
Email verificata su - Home page
Citata da
Citata da
A unified Erdős-Pósa theorem for constrained cycles
T Huynh, F Joos, P Wollan
Combinatorica 39 (1), 91-133, 2016
The linkage problem for group-labelled graphs
T Huynh
University of Waterloo, 2009
Space proof complexity for random 3-CNFs
P Bennett, I Bonacina, N Galesi, T Huynh, M Molloy, P Wollan
Information and Computation 255, 165-176, 2017
Explicit bounds for graph minors
J Geelen, T Huynh, RB Richter
Journal of Combinatorial Theory, Series B 132, 80-106, 2018
Strengthening convex relaxations of 0/1-sets using Boolean formulas
S Fiorini, T Huynh, S Weltge
arXiv preprint arXiv:1711.01358, 2017
A tight Erdős-Pósa function for planar minors
WC van Batenburg, T Huynh, G Joret, JF Raymond
arXiv preprint arXiv:1807.04969, 2018
Extension complexity of stable set polytopes of bipartite graphs
M Aprile, Y Faenza, S Fiorini, T Huynh, M Macchia
International Workshop on Graph-Theoretic Concepts in Computer Science, 75-87, 2017
Notes on graph product structure theory
Z Dvořák, T Huynh, G Joret, CH Liu, DR Wood
arXiv preprint arXiv:2001.08860, 2020
Disparities in follow-up care for ballistic and non-ballistic long bone lower extremity fractures
SR Arceo, RP Runner, TD Huynh, MB Gottschalk, ML Schenker, ...
Injury 49 (12), 2193-2197, 2018
The excluded minors for isometric realizability in the plane
S Fiorini, T Huynh, G Joret, A Varvitsiotis
SIAM Journal on Discrete Mathematics 31 (1), 438-453, 2017
Even-cycle decompositions of graphs with no odd--minor
T Huynh, S Oum, M Verdian-Rizi
European Journal of Combinatorics 65, 1-14, 2017, 2017
The stable set problem in graphs with bounded genus and bounded odd cycle packing number
M Conforti, S Fiorini, T Huynh, G Joret, S Weltge
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
Tree‐Chromatic Number Is Not Equal to Path‐Chromatic Number
T Huynh, R Kim
Journal of Graph Theory 86 (2), 213-222, 2017
Extended formulations for stable set polytopes of graphs without two disjoint odd cycles
M Conforti, S Fiorini, T Huynh, S Weltge
Mathematical Programming, 1-20, 2021
Subgraph densities in a surface
T Huynh, G Joret, DR Wood
arXiv preprint arXiv:2003.13777, 2020
Characterizing polytopes in the 0/1-cube with bounded Chvátal-Gomory rank
Y Benchetrit, S Fiorini, T Huynh, S Weltge
Mathematics of Operations Research, 2018
A tight Erdős-Pósa function for wheel minors
P Aboulker, S Fiorini, T Huynh, G Joret, JF Raymond, I Sau
SIAM Journal on Discrete Mathematics 32 (3), 2302-2312, 2018
Smaller extended formulations for the spanning tree polytope of bounded-genus graphs
S Fiorini, T Huynh, G Joret, K Pashkovich
Discrete & Computational Geometry 57 (3), 757-761, 2017
On Hilbert bases of cuts
L Goddyn, T Huynh, T Deshpande
Discrete Mathematics 339 (2), 721-728, 2016
Flip distances between graph orientations
O Aichholzer, J Cardinal, T Huynh, K Knauer, T Mütze, R Steiner, ...
Algorithmica 83 (1), 116-143, 2021
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20