Publisher
Springer International Publishing
Reference8 articles.
1. Bereg, S., Holroyd, A., Nachmanson, L., Pupyrev, S.: Representing permutations with few moves. SIAM J. Disc. Math. 30(4), 1950–1977 (2016).
https://doi.org/10.1137/15M1036105
.
http://arxiv.org/abs/1508.03674
2. Bereg, S., Holroyd, A.E., Nachmanson, L., Pupyrev, S.: Drawing permutations with few corners. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol. 8242, pp. 484–495. Springer, Cham (2013).
https://doi.org/10.1007/978-3-319-03841-4_42
.
http://arxiv.org/abs/1306.4048
3. Birman, J.S., Williams, R.F.: Knotted periodic orbits in dynamical systems–I: Lorenz’s equation. Topology 22(1), 47–82 (1983).
https://doi.org/10.1016/0040-9383(83)90045-9
4. Firman, O., Kindermann, P., Ravsky, A., Wolff, A., Zink, J.: Computing height-optimal tangles faster. Arxiv report (2019).
http://arxiv.org/abs/1901.06548
5. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Complexity of Finding Tangles;Lecture Notes in Computer Science;2023