Collisions for variants of the BLAKE hash function. - Janos Vidali; Peter Nose; Enes Pasalic (Inf. Process. Lett., 2010)

Extremal 1-codes in distance-regular graphs of diameter 3. - Aleksandar Jurisic; Janos Vidali (Des. Codes Cryptogr., 2012)

DiscreteZOO: Towards a Fingerprint Database of Discrete Objects. - Katja Bercic; Janos Vidali (ICMS, 2018)

Using Symbolic Computation to Prove Nonexistence of Distance-Regular Graphs. - Janos Vidali (Electron. J. Comb., 2018)

Girth-regular graphs. - Primoz Potocnik; Janos Vidali (Ars Math. Contemp., 2019)

The Sylvester graph and Moore graphs. - Aleksandar Jurisic; Janos Vidali (Eur. J. Comb., 2019)

On Tight 4-Designs in Hamming Association Schemes. - Alexander L. Gavrilyuk; Sho Suda; Janos Vidali (Comb., 2020)

DiscreteZOO: A Fingerprint Database of Discrete Objects. - Katja Bercic; Janos Vidali (Math. Comput. Sci., 2020)

On few-class Q-polynomial association schemes: feasible parameters and nonexistence results. - Alexander L. Gavrilyuk; Janos Vidali; Jason S. Williford (Ars Math. Contemp., 2021)

Cubic vertex-transitive graphs of girth six. - Primoz Potocnik; Janos Vidali (Discret. Math., 2022)