Tony Chi Thong Huynh | Ricerc@Sapienza

Pubblicazioni

Titolo	Pubblicato in	Anno
On the Erdős-Pósa property for long holes in C_4-free graphs	SIAM JOURNAL ON DISCRETE MATHEMATICS	2024
A Menger-Type Theorem for Two Induced Paths	SIAM JOURNAL ON DISCRETE MATHEMATICS	2024
A tight approximation algorithm for the cluster vertex deletion problem	MATHEMATICAL PROGRAMMING	2023
Product structure of graph classes with bounded treewidth	COMBINATORICS, PROBABILITY AND COMPUTING	2023
Excluding a Ladder	COMBINATORICA	2022
Tree densities in sparse graph classes	CANADIAN JOURNAL OF MATHEMATICS-JOURNAL CANADIEN DE MATHEMATIQUES	2022
Idealness of k-wise intersecting families	MATHEMATICAL PROGRAMMING	2022
Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond	ELECTRONIC JOURNAL OF COMBINATORICS	2021
Improved Product Structure for Graphs on Surfaces	DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE	2021
Slack matrices, k-products, and 2-level polytopes	DISCRETE APPLIED MATHEMATICS	2021
Short rainbow cycles in graphs and matroids	JOURNAL OF GRAPH THEORY	2021
Strengthening convex relaxations of 0/1-sets using Boolean formulas	MATHEMATICAL PROGRAMMING	2021
Seymour’s Conjecture on 2-Connected Graphs of Large Pathwidth	COMBINATORICA	2020
SUBGRAPH DENSITIES in A SURFACE	COMBINATORICS, PROBABILITY AND COMPUTING	2020
A simple 7/3-approximation algorithm for feedback vertex set in tournaments	DISCRETE APPLIED MATHEMATICS	2020
The matroid secretary problem for minor-closed classes and random matroids	SIAM JOURNAL ON DISCRETE MATHEMATICS	2020
A Unified Erdős–Pósa Theorem for Constrained Cycles	COMBINATORICA	2019
Unavoidable minors for graphs with large l_p-dimension	DISCRETE AND COMPUTATIONAL GEOMETRY	2019
Extended formulations for stable set polytopes of graphs without two disjoint odd cycles	MATHEMATICAL PROGRAMMING	2019
Flip distances between graph orientations	ALGORITHMICA	2019