A unified Erdős-Pósa theorem for constrained cycles T Huynh, F Joos, P Wollan Combinatorica 39 (1), 91-133, 2016 | 36 | 2016 |
The linkage problem for group-labelled graphs T Huynh University of Waterloo, 2009 | 32 | 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 | 26 | 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 | 23* | 2017 |
Subgraph densities in a surface T Huynh, G Joret, DR Wood Combinatorics, Probability and Computing 31 (5), 812-839, 2022 | 22 | 2022 |
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 | 22 | 2019 |
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 | 18 | 2020 |
Improved product structure for graphs on surfaces M Distel, R Hickingbotham, T Huynh, DR Wood Discrete Mathematics & Theoretical Computer Science 24 (Graph Theory), 2022 | 17 | 2022 |
Strengthening convex relaxations of 0/1-sets using Boolean formulas S Fiorini, T Huynh, S Weltge Mathematical programming 190 (1), 467-482, 2021 | 17 | 2021 |
Universality in minor-closed graph classes T Huynh, B Mohar, R Šámal, C Thomassen, DR Wood arXiv preprint arXiv:2109.00327, 2021 | 17 | 2021 |
Explicit bounds for graph minors J Geelen, T Huynh, RB Richter Journal of Combinatorial Theory, Series B 132, 80-106, 2018 | 17* | 2018 |
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 | 15 | 2017 |
A tight approximation algorithm for the cluster vertex deletion problem M Aprile, M Drescher, S Fiorini, T Huynh Mathematical Programming, 1-23, 2023 | 14 | 2023 |
Extended formulations for stable set polytopes of graphs without two disjoint odd cycles M Conforti, S Fiorini, T Huynh, S Weltge International Conference on Integer Programming and Combinatorial …, 2020 | 14 | 2020 |
Tree densities in sparse graph classes T Huynh, DR Wood Canadian Journal of Mathematics 74 (5), 1385-1404, 2022 | 13 | 2022 |
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 | 13 | 2021 |
Product structure of graph classes with bounded treewidth R Campbell, K Clinch, M Distel, JP Gollin, K Hendrey, R Hickingbotham, ... Combinatorics, Probability and Computing 33 (3), 351-376, 2024 | 12 | 2024 |
Flip distances between graph orientations O Aichholzer, J Cardinal, T Huynh, K Knauer, T Mütze, R Steiner, ... Algorithmica 83 (1), 116-143, 2021 | 12 | 2021 |
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 | 11 | 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 | 11 | 2017 |