Tony Chi Thong Huynh
| Titolo | Pubblicato in | Anno |
|---|---|---|
| Transfinite Ford-Fulkerson on a finite network | COMPUTABILITY | 2018 |
| Characterizing polytopes in the 0/1-cube with bounded Chvátal-Gomory rank | MATHEMATICS OF OPERATIONS RESEARCH | 2018 |
| Explicit bounds for graph minors | JOURNAL OF COMBINATORIAL THEORY | 2018 |
| The biclique covering number of grids | ELECTRONIC JOURNAL OF COMBINATORICS | 2018 |
| Extension complexity of the correlation polytope | OPERATIONS RESEARCH LETTERS | 2018 |
| Space proof complexity for random 3-CNFs | INFORMATION AND COMPUTATION | 2017 |
| Even-cycle decompositions of graphs with no odd-K4-minor | EUROPEAN JOURNAL OF COMBINATORICS | 2017 |
| Tree-Chromatic Number Is Not Equal to Path-Chromatic Number* | JOURNAL OF GRAPH THEORY | 2017 |
| Smaller Extended Formulations for the Spanning Tree Polytope of Bounded-Genus Graphs | DISCRETE & COMPUTATIONAL GEOMETRY | 2017 |
| Strongly Even-Cycle Decomposable Graphs | JOURNAL OF GRAPH THEORY | 2017 |
| On Hilbert bases of cuts | DISCRETE MATHEMATICS | 2016 |
© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma