• A. Brodnik, A. Malnič, R. Požar, The simultaneous conjugacy problem in the symmetric group, Math. Comp. 90 (2021), 2977-2995.
• A. Brodnik, A. Malnič, R. Požar, A subquadratic algorithm for the simultaneous conjugacy problem, J.
• Graph Theory 100 (2022), 630-637.
• R. Diestel, Graph Theory, Springer-Verlag, New York, 2005.
• M. Fontet, Calcul de centralisateur d'un grupe de permutatations, Bull. Soc. Math. France Mem. 49-50 (1977), 53-63.
• C. M. Hoffmann, Group-Theoretic Algorithms and Graph Isomorphism. Lecture Notes in Computer
• Science, vol.136. (1982) Springer.
• C. M. Hoffmann, Subcomplete generalization of graph isomorphism. J. of Comp.and Sys. Sci. 25 (1982), 332-359.
• R. Požar, Fast computation of the centralizer of a permutation group in the symmetric group, J. Symb.Comput. 123 (2024), 102287.
• M. A. Sridhar, A fast algorithm for testing isomorphism of permutation networks, IEEE Trans. Computers (TC) 38(6) (1989), 903-909.
• A. Yavuz Oruc, M. Yaman Oruc, On testing isomorphism of permutation networks. IEEE Trans. Computers (TC) 34 (1985), 958-962.

Learning and teaching methods:
●Reading the assigned literature
●Occasional consultations with the lecturer
●Summarizing the learned material

Assessment:
●Report on the studied material
●Presentation of the knowledge learned