14 citations · 73 across the 14 of their papers we have counts for
4 papers · 1 filter
On the maximal number of real embeddings of minimally rigid graphs in , and
Evangelos Bartzos, Ioannis Z. Emiris, Jan Legerský +1
Rigidity theory studies the properties of graphs that can have rigid embeddings in a euclidean space or on a sphere and which in addition satisfy certain edge length…
Graphs with Flexible Labelings allowing Injective Realizations
Georg Grasegger, Jan Legerský, Josef Schicho
We consider realizations of a graph in the plane such that the distances between adjacent vertices satisfy the constraints given by an edge labeling. If there are infinitely many s…
On the maximal number of real embeddings of spatial minimally rigid graphs
Evangelos Bartzos, Ioannis Emiris, Jan Legerský +1
The number of embeddings of minimally rigid graphs in is (by definition) finite, modulo rigid transformations, for every generic choice of edge lengths. Even though…
Construction of Algorithms for Parallel Addition
Jan Legerský, Milena Svobodová
An algebraic number with no conjugate of modulus 1 can serve as the base of a numeration system with parallel addition, i.e., the sum of two op…