Fish A., Lisitsa A., Vernitski A., “Visual Algebraic Proofs For Unknot Detection”, Diagrammatic Representation and Inference, Diagrams 2018, Lecture Notes in Artificial Intelligence, 10871, eds. Chapman P., Stapleton G., Moktefi A., PerezKriz S., Bellucci F., Springer International Publishing Ag, 2018, 89–104
Vernitski A., “Describing Semigroups With Defining Relations of the Form Xy = Yz and Yx = Zy and Connections With Knot Theory”, Semigr. Forum, 95:1 (2017), 66–82
Cherry Kearton, Vitaliy Kurlin, “All 2–dimensional links in 4–space live inside a universal 3–dimensional polyhedron”, Algebr. Geom. Topol., 8:3 (2008), 1223
Kurlin, V, “Three-page encoding and complexity theory for spatial graphs”, Journal of Knot Theory and Its Ramifications, 16:1 (2007), 59
Dujmovic, V, “Stacks, queues and tracks: Layouts of graph subdivisions”, Discrete Mathematics and Theoretical Computer Science, 7:1 (2005), 155
В. В. Вершинин, В. А. Курлин, “Трехстраничные вложения сингулярных узлов”, Функц. анализ и его прил., 38:1 (2004), 16–33 ; V. V. Vershinin, V. A. Kurlin, “Three-Page Embeddings of Singular Knots”, Funct. Anal. Appl., 38:1 (2004), 14–27
И. А. Дынников, “Алгоритмы распознавания в теории узлов”, УМН, 58:6(354) (2003), 45–92 ; I. A. Dynnikov, “Recognition algorithms in knot theory”, Russian Math. Surveys, 58:6 (2003), 1093–1139
В. А. Курлин, “Базисные вложения графов и метод трехстраничных вложений Дынникова”, УМН, 58:2(350) (2003), 163–164 ; V. A. Kurlin, “Basic embeddings of graphs and Dynnikov's three-page embedding method”, Russian Math. Surveys, 58:2 (2003), 372–374
Andreeva M.V., Dynnikov I.A., Polthier K., “A mathematical webservice for recognizing the unknot”, Mathematical Software, Proceedings, 2002, 201–207
В. А. Курлин, “Трехстраничные диаграммы Дынникова заузленных $3$-валентных графов”, Функц. анализ и его прил., 35:3 (2001), 84–88 ; V. A. Kurlin, “Dynnikov Three-Page Diagrams of Spatial $3$-Valent Graphs”, Funct. Anal. Appl., 35:3 (2001), 230–233