20142020

Research output per year

If you made any changes in Pure these will be visible here soon.

Research Output

Filter
Conference Paper
2019

A tight Erdős-Pósa function for planar minors

Van Batenburg, W. C., Huynh, T., Joret, G. & Raymond, J. F., 1 Jan 2019, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms: 30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019; San Diego; United States; 6 January 2019 through 9 January 2019. Philadelphia PA USA: Society for Industrial & Applied Mathematics (SIAM), p. 1485-1500 16 p.

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearch

Flip Distances Between Graph Orientations

Aichholzer, O., Cardinal, J., Huynh, T., Knauer, K., Mütze, T., Steiner, R. & Vogtenhuber, B., 12 Sep 2019, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): 45th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2019; Catalonia; Spain; 19 June 2019 through 21 June 2019. Sau, I. & Thilikos, D. M. (eds.). Switzerland: Springer-Verlag London Ltd., Vol. 11789. p. 120-134 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11789 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

2017

Extension Complexity of Stable Set Polytopes of Bipartite Graphs

Aprile, M., Faenza, Y., Fiorini, S., Huynh, T. & Macchia, M., 1 Jan 2017, Graph-Theoretic Concepts in Computer Science: 43rd International Workshop, WG 2017 Eindhoven, The Netherlands, June 21–23, 2017 Revised Selected Papers. Bodlaender, H. L. & Woeginger, G. J. (eds.). 1 ed. Cham Switzerland: Springer, p. 75-87 13 p. (Lecture Notes in Computer Science ; vol. 10520 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

3 Citations (Scopus)