# Research

#### Movable Graphs

Graphs with infinitely many realizations in the plane satisfying edge length constraints

#### Number of Real Embeddings of Minimally Rigid Graphs

Finding edge lengths of minimally rigid graphs with many real embeddings.

#### Construction of algorithms for Parallel Addition

Parallel Addition algorithms in non-standard numeration systems are constructed by so called Extending Window Method.

# Publications

. On the maximal number of real embeddings of minimally rigid graphs in $\mathbb{R}^2$, $\mathbb{R}^3$ and $S^2$. submitted, 2018.

. Graphs with Flexible Labelings allowing Injective Realizations. submitted, 2018.

. Minimal non-integer alphabets allowing parallel addition. Acta Polytechnica, 2018.

. Graphs with Flexible Labelings. Journal of Discrete and Computational Geometry, 2018.

. On the Maximal Number of Real Embeddings of Spatial Minimally Rigid Graphs. Proceedings of ISSAC ‘18, 2018.

# Talks

Graphs with flexible labelings allowing injective realizations
Sep 27, 2018
Graphs with flexible labelings
Jun 6, 2018
Lower bounds on the maximal number of realizations
Jun 5, 2018
On the Maximal Number of Real Embeddings of Spatial Minimally Rigid Graphs
Jul 19, 2018
Method for construction of parallel addition algorithms
May 27, 2015