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.


More Publications

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

Preprint Project Slides

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

Preprint PDF Project Slides DOI


On the Classification of Motions of Laman Graphs
Jun 12, 2019
Paradoxical Mobility of $K_{3,3}$ Revisited
Jun 6, 2019
Rigidity and Flexibility of Graphs in SageMath
Jan 31, 2019
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