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

More Publications

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

Preprint Dataset Project

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

Preprint Project Slides

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

Preprint Project DOI

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

Preprint PDF Project Slides DOI

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

Preprint Code Dataset Project DOI

Talks

Graphs with flexible labelings allowing injective realizations
Sep 27, 2018
Rigidity and Flexibility of Geometric Structures
Project Slides
Graphs with flexible labelings
Jun 6, 2018
Bond-node structures: rigidity, combinatorics and chemistry
Project Slides
Lower bounds on the maximal number of realizations
Jun 5, 2018
Bond-node structures: rigidity, combinatorics and chemistry
Project Slides
On the Maximal Number of Real Embeddings of Spatial Minimally Rigid Graphs
Jul 19, 2018
The International Symposium on Symbolic and Algebraic Computation (ISSAC 2018)
Project Slides
Method for construction of parallel addition algorithms
May 27, 2015
Workshop on Automatic Sequences
Project Slides

Contact