Jan Legerský

I am a maintainer of the Python package PyRigi for the research in rigidity and flexibility of bar-and-joint frameworks.

I was the principal investigator of the project Paradoxical flexibility of frameworks (October 2022 - September 2025).

Previously, I was a PostDoc at Research Institute for Symbolic Computation at Johannes Kepler University in Linz, Austria. I did my PhD in Marie Sklodowska-Curie Innovative Training Network ARCADES at JKU in Linz. My supervisor was Josef Schicho.

Doctoral degree in Engineering Sciences (Computer Mathematics), 2019

Johannes Kepler University Linz, RISC
Master's degree in Theoretical Computer Science, 2016

Czech Technical University in Prague, FNSPE
Bachelor's degree in Theoretical Computer Science, 2013

Czech Technical University in Prague, FNSPE

Research

Joint project between RICAM in Linz and FIT, CTU in Prague.

New proof of the classification of Bricard’s octahedra

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

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

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

Matteo Gallet, Georg Grasegger, Matthias Himmelmann, Jan Legerský. PyRigi - a general-purpose Python package for the rigidity and flexibility of bar-and-joint frameworks. ACM Transactions on Mathematical Software, 2026.

Oleksandr Slyvka, Jan Rubeš, Rodrigo Alves, Jan Legerský. Learning Minimally Rigid Graphs with High Realization Counts. IJCAI, 2026.

Sean Dewar, Georg Grasegger, Jan Legerský. Constructing reflection-symmetric flexible realisations of graphs. Ars Mathematica Contemporanea, 2026.

Katie Clinch, Dániel Garamvölgyi, John Haslegrave, Tony Huynh, Jan Legerský, Anthony Nixon. Stable cuts, NAC-colourings and flexible realisations of graphs. Journal of Graph Theory, 2026.