20 citations · 171 across the 37 of their papers we have counts for
5 papers · 1 filter
Improved product structure for graphs on surfaces
Marc Distel, Robert Hickingbotham, Tony Huynh +1
Dujmović, Joret, Micek, Morin, Ueckerdt and Wood [J. ACM 2020] proved that for every graph with Euler genus there is a graph with treewidth at most 4 and a path suc…
Universality in minor-closed graph classes
Tony Huynh, Bojan Mohar, Robert Šámal +2
Stanislaw Ulam asked whether there exists a universal countable planar graph (that is, a countable planar graph that contains every countable planar graph as a subgraph). János Pac…
Slack matrices, -products, and -level polytopes
Manuel Aprile, Michele Conforti, Yuri Faenza +3
In this paper, we study algorithmic questions concerning products of matrices and their consequences for recognition algorithms for polyhedra. The 1-product of matrices , $S_2…
Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond
Manuel Aprile, Samuel Fiorini, Tony Huynh +2
Let be a connected -vertex graph in a proper minor-closed class . We prove that the extension complexity of the spanning tree polytope of is . Th…
On the Erdős-Pósa property for long holes in -free graphs
Tony Huynh, O-joung Kwon
We prove that there exists a function such that for every -free graph and every , either contains vertex-disjoint…