Funder
Polish National Science Centre
Subject
Discrete Mathematics and Combinatorics
Reference9 articles.
1. Approximating treewidth, pathwidth, frontsize, and shortest elimination tree;Bodlaender;J. Algorithms,1995
2. C. Chekuri, J. Chuzhoy, Large-treewidth graph decompositions and applications, in: Proc. of the 45st Annual ACM Symposium on Theory of Computing, 2013, pp. 291–300.
3. C. Chekuri, J. Chuzhoy, Degree-3 treewdith sparsifiers, in: Proc. of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms, 2015, pp. 242–255.
4. Z. Dvořák, S. Norin, Treewidth of graphs with balanced separations, Manuscript, 2014, arXiv:1408.3869.
5. Strongly sublinear separators and polynomial expansion;Dvořák;SIAM J. Discrete Math.,2016
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Sparse graphs without long induced paths;Journal of Combinatorial Theory, Series B;2024-05
2. Shallow Minors, Graph Products, and Beyond-Planar Graphs;SIAM Journal on Discrete Mathematics;2024-03-13
3. Improved Bounds for Weak Coloring Numbers;The Electronic Journal of Combinatorics;2022-03-25
4. On weighted sublinear separators;Journal of Graph Theory;2021-11-23
5. A note on sublinear separators and expansion;European Journal of Combinatorics;2021-03