| A unified Erdős-Pósa theorem for constrained cycles T Huynh, F Joos, P Wollan Combinatorica 39 (1), 91-133, 2016 | 46 | 2016 |
| Improved product structure for graphs on surfaces M Distel, R Hickingbotham, T Huynh, DR Wood Discrete Mathematics & Theoretical Computer Science 24 (Graph Theory), 2022 | 36 | 2022 |
| Notes on graph product structure theory Z Dvořák, T Huynh, G Joret, CH Liu, DR Wood 2019-20 MATRIX Annals, 513-533, 2021 | 36* | 2021 |
| The linkage problem for group-labelled graphs TCT Huynh University of Waterloo, 2009 | 35 | 2009 |
| A Menger-type theorem for two induced paths S Albrechtsen, T Huynh, RW Jacobs, P Knappe, P Wollan SIAM Journal on Discrete Mathematics 38 (2), 1438-1450, 2024 | 29* | 2024 |
| A tight approximation algorithm for the cluster vertex deletion problem M Aprile, M Drescher, S Fiorini, T Huynh Mathematical Programming 197 (2), 1069-1091, 2023 | 28 | 2023 |
| 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 | 28 | 2019 |
| Universality in minor-closed graph classes T Huynh, B Mohar, R Šámal, C Thomassen, DR Wood arXiv preprint arXiv:2109.00327, 2021 | 27 | 2021 |
| Subgraph densities in a surface T Huynh, G Joret, DR Wood Combinatorics, Probability and Computing 31 (5), 812-839, 2022 | 26 | 2022 |
| 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 | 24* | 2017 |
| Strengthening convex relaxations of 0/1-sets using Boolean formulas S Fiorini, T Huynh, S Weltge Mathematical programming 190 (1), 467-482, 2021 | 23 | 2021 |
| 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 | 23 | 2020 |
| 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 | 20 | 2024 |
| Explicit bounds for graph minors J Geelen, T Huynh, RB Richter Journal of Combinatorial Theory, Series B 132, 80-106, 2018 | 19* | 2018 |
| 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 | 18 | 2020 |
| A coarse Erdős-Pósa theorem J Ahn, JP Gollin, T Huynh, O Kwon arXiv preprint arXiv:2407.05883, 2024 | 17 | 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 | 17 | 2021 |
| 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 | 17 | 2017 |
| Tree densities in sparse graph classes T Huynh, DR Wood Canadian Journal of Mathematics 74 (5), 1385-1404, 2022 | 16 | 2022 |
| Excluding a ladder T Huynh, G Joret, P Micek, MT Seweryn, P Wollan Combinatorica 42 (3), 405-432, 2022 | 15 | 2022 |
Samuel FioriniUniversité libre de BruxellesVerified email at ulb.ac.be
