Publisher
Springer International Publishing
Reference17 articles.
1. Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41(1), 153–180 (1994). https://doi.org/10.1145/174644.174650. ISSN 0004-5411
2. Bodlaender, H.L., Cygan, M., Kratsch, S., Nederlof, J.: Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth. Inf. Comput. 243, 86–111 (2015). https://doi.org/10.1016/j.ic.2014.12.008
3. Bonsma, P.S., Broersma, H., Patel, V., Pyatkin, A.V.: The complexity of finding uniform sparsest cuts in various graph classes. J. Discrete Algorithms 14, 136–149 (2012). https://doi.org/10.1016/j.jda.2011.12.008
4. Brinkop, H., Jansen, K.: Solving cut-problems in quadratic time for graphs with bounded treewidth. https://arxiv.org/abs/2101.00694
5. Lecture Notes in Computer Science;C Calabro,2009