Author:
Biedl Therese,Chimani Markus,Derka Martin,Mutzel Petra
Funder
NSERC
NSERC Vanier CSG
Deutsche Forschungsgemeinschaft
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference33 articles.
1. Ajtai, M., Chvátal, V., Newborn, M.M., Szemerédi, E.: Crossing-free subgraphs. In: Hammer, P.L., Rosa, A., Sabidussi, G., Turgeon, J. (ed.) Theory and Practice of Combinatorics, Volume 60 of North-Holland Mathematics Studies, pp 9 – 12. North-Holland (1982). https://www.sciencedirect.com/science/article/pii/S0304020808734844
2. Biedl, T., Chimani, M., Derka, M., Mutzel, P.: Crossing number for graphs with bounded pathwidth. In: ISAAC ’07, LIPIcs, pp. 13:1–13:13 (2017). https://doi.org/10.4230/LIPIcs.ISAAC.2017.13
3. Bienstock, D.: Some provably hard crossing number problems. Discrete Comput. Geom. 6, 443–459 (1991)
4. Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305–1317 (1996)
5. Bodlaender, H.L., Kloks, T.: Efficient and constructive algorithms for the pathwidth and treewidth of graphs. J. Algorithms 21(2), 358–402 (1996)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献