Tony Huynh
Tony Huynh
Department of Computer Science, Sapienza University of Rome
Zweryfikowany adres z di.uniroma1.it - Strona główna
Cytowane przez
Cytowane przez
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
Notes on graph product structure theory
Z Dvořák, T Huynh, G Joret, CH Liu, DR Wood
2019-20 MATRIX Annals, 513-533, 2021
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
Subgraph densities in a surface
T Huynh, G Joret, DR Wood
Combinatorics, Probability and Computing 31 (5), 812-839, 2022
Extended formulations for stable set polytopes of graphs without two disjoint odd cycles
M Conforti, S Fiorini, T Huynh, S Weltge
Mathematical Programming 192 (1), 547-566, 2022
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
A tight Erdős-Pósa function for planar minors
WC Van Batenburg, T Huynh, G Joret, JF Raymond
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
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
Mathematical programming 190 (1), 467-482, 2021
Universality in minor-closed graph classes
T Huynh, B Mohar, R Šámal, C Thomassen, DR Wood
arXiv preprint arXiv:2109.00327, 2021
Short rainbow cycles in graphs and matroids
M DeVos, M Drescher, D Funk, S Gonzalez Hermosillo de la Maza, K Guo, ...
Journal of Graph Theory 96 (2), 192-202, 2021
Improved product structure for graphs on surfaces
M Distel, R Hickingbotham, T Huynh, DR Wood
Discrete Mathematics & Theoretical Computer Science 24 (Graph Theory), 2022
Extension complexity of stable set polytopes of bipartite graphs
M Aprile, Y Faenza, S Fiorini, T Huynh, M Macchia
Graph-Theoretic Concepts in Computer Science: 43rd International Workshop …, 2017
A tight approximation algorithm for the cluster vertex deletion problem
M Aprile, M Drescher, S Fiorini, T Huynh
Integer Programming and Combinatorial Optimization: 22nd International …, 2021
Flip distances between graph orientations
O Aichholzer, J Cardinal, T Huynh, K Knauer, T Mütze, R Steiner, ...
Algorithmica 83 (1), 116-143, 2021
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
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
Tree densities in sparse graph classes
T Huynh, DR Wood
Canadian Journal of Mathematics 74 (5), 1385-1404, 2022
Product structure of graph classes with bounded treewidth
R Campbell, K Clinch, M Distel, JP Gollin, K Hendrey, R Hickingbotham, ...
arXiv preprint arXiv:2206.02395, 2022
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20