Rok Pozar

15 papers Journal 15
YearRankTypeTitle / Venue / Authors
2026 J jnl
On reduced Hamilton walks.
Appl. Math. Comput.
Aleksander Malnic, Rok Pozar
2025 J jnl
Floyd-Warshall Algorithm for Sparse Graphs.
Algorithms
Dani Zugan, Rok Pozar, Andrej Brodnik
2024 J jnl
Fast computation of the centralizer of a permutation group in the symmetric group.
J. Symb. Comput.
Rok Pozar
2022 J jnl
A subquadratic algorithm for the simultaneous conjugacy problem.
J. Graph Theory
Andrej Brodnik, Aleksander Malnic, Rok Pozar
2022 J jnl
Modifications of the Floyd-Warshall algorithm with nearly quadratic expected-time.
Ars Math. Contemp.
Andrej Brodnik, Marko Grgurovic, Rok Pozar
2021 J jnl
The simultaneous conjugacy problem in the symmetric group.
Math. Comput.
Andrej Brodnik, Aleksander Malnic, Rok Pozar
2020 J jnl
A subquadratic algorithm for the simultaneous conjugacy problem.
CoRR
Andrej Brodnik, Aleksander Malnic, Rok Pozar
2019 J jnl
Computing stable epimorphisms onto finite groups.
J. Symb. Comput.
Rok Pozar
2019 J jnl
Fast permutation-word multiplication and the simultaneous conjugacy problem.
CoRR
Andrej Brodnik, Aleksander Malnic, Rok Pozar
2019 J jnl
On split liftings with sectional complements.
Math. Comput.
Aleksander Malnic, Rok Pozar
2017 J jnl
Smallest tetravalent half-arc-transitive graphs with the vertex-stabiliser isomorphic to the dihedral group of order 8.
J. Comb. Theory A
Primoz Potocnik, Rok Pozar
2016 J jnl
On the split structure of lifted groups.
Ars Math. Contemp.
Aleksander Malnic, Rok Pozar
2016 J jnl
Testing whether the lifted group splits.
Ars Math. Contemp.
Rok Pozar
2015 J jnl
Some computational aspects of solvable regular covers of graphs.
J. Symb. Comput.
Rok Pozar
2013 J jnl
Sectional split extensions arising from lifts of groups.
Ars Math. Contemp.
Rok Pozar