Author:
Masařík Tomáš,Muzi Irene,Pilipczuk Marcin,Rzążewski Paweł,Sorge Manuel
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference26 articles.
1. S. A. Amiri, K. Kawarabayashi, S. Kreutzer and P. Wollan: The ErdŐs-Pósa property for directed graphs, CoRR, arXiv:1603.025042016.
2. M. Andrews, J. Chuzhoy, V. Guruswami, S. Khanna, K. Talwar and L. Zhang: Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs, Combinatorica 30 (2010), 485–520.
3. T. Carpenter, A. Salmasi and A. Sidiropoulos: Routing symmetric demands in directed minor-free graphs with constant congestion, CoRR, abs/1711.01692, 2017.
4. C. Chekuri and J. Chuzhoy: Large-treewidth graph decompositions and applications, In Proceedings of the 45th Annual ACM Symposium on Theory of Computing (STOC 2013), pages 291–300. ACM, 2013.
5. C. Chekuri and J. Chuzhoy: Polynomial bounds for the grid-minor theorem, Journal of the ACM, 63 (2016), 40:1–40:65.