Highly connected rigidity matroids have unique underlying graphs. - Tibor Jordán; Viktória E. Kaszanitzky (Eur. J. Comb., 2013)

Sparse hypergraphs with applications in combinatorial rigidity. - Tibor Jordán; Viktória E. Kaszanitzky (Discret. Appl. Math., 2015)

Rigid Two-Dimensional Frameworks with Two Coincident Points. - Zsolt Fekete; Tibor Jordán; Viktória E. Kaszanitzky (Graphs Comb., 2015)

Gain-Sparsity and Symmetry-Forced Rigidity in the Plane. - Tibor Jordán; Viktória E. Kaszanitzky; Shin-ichi Tanigawa (Discret. Comput. Geom., 2016)

On Minimally Highly Vertex-Redundantly Rigid Graphs. - Viktória E. Kaszanitzky; Csaba Király 001 (Graphs Comb., 2016)

Lifting symmetric pictures to polyhedral scenes. - Viktória E. Kaszanitzky; Bernd Schulze (Ars Math. Contemp., 2017)

Characterizing minimally flat symmetric hypergraphs. - Viktória E. Kaszanitzky; Bernd Schulze (Discret. Appl. Math., 2018)

Rigid Cylindrical Frameworks with Two Coincident Points. - Bill Jackson; Viktória E. Kaszanitzky; Anthony Nixon (Graphs Comb., 2019)

Global rigidity of periodic graphs under fixed-lattice representations. - Viktória E. Kaszanitzky; Bernd Schulze; Shin-ichi Tanigawa (J. Comb. Theory B, 2021)

Sufficient Conditions for the Global Rigidity of Periodic Graphs. - Viktória E. Kaszanitzky; Csaba Király 001; Bernd Schulze (Discret. Comput. Geom., 2022)

Sufficient connectivity conditions for rigidity of symmetric frameworks. - Viktória E. Kaszanitzky; Bernd Schulze (Eur. J. Comb., 2023)