9 citations · 17 across the 9 of their papers we have counts for
1 paper · 1 filter
Vitaliy Kurlin, Alexei Lisitsa, Igor Potapov +1
In this paper we investigate the descriptional complexity of knot theoretic problems and show upper bounds for planarity problem of signed and unsigned knot diagrams represented by…