36 citations · 177 across the 35 of their papers we have counts for
Showing 2009Show all
2 papers · 1 filter
math.GT2009★ 6 cited
Computing braid groups of graphs with applications to robot motion planning
V. Kurlin
We design an algorithm writing down presentations of graph braid groups. Generators are represented in terms of actual motions of robots moving without collisions on a given graph.…
cs.FL2009
On Descriptional Complexity of the Planarity Problem for Gauss Words
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…