Janos Vidali

According to our database, Janos Vidali authored at least 10 papers between 2010 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2022

Cubic vertex-transitive graphs of girth six.

Primoz Potocnik, Janos Vidali

Discret. Math., 2022

2021

On few-class Q-polynomial association schemes: feasible parameters and nonexistence results.

Alexander L. Gavrilyuk, Janos Vidali, Jason S. Williford

Ars Math. Contemp., 2021

2020

DiscreteZOO: A Fingerprint Database of Discrete Objects.

Katja Bercic, Janos Vidali

Math. Comput. Sci., 2020

On Tight 4-Designs in Hamming Association Schemes.

Alexander L. Gavrilyuk, Sho Suda, Janos Vidali

Comb., 2020

2019

The Sylvester graph and Moore graphs.

Aleksandar Jurisic, Janos Vidali

Eur. J. Comb., 2019

Girth-regular graphs.

Primoz Potocnik, Janos Vidali

Ars Math. Contemp., 2019

2018

Using Symbolic Computation to Prove Nonexistence of Distance-Regular Graphs.

Janos Vidali

Electron. J. Comb., 2018

DiscreteZOO: Towards a Fingerprint Database of Discrete Objects.

Katja Bercic, Janos Vidali

Proceedings of the Mathematical Software - ICMS 2018, 2018

2012

Extremal 1-codes in distance-regular graphs of diameter 3.

Aleksandar Jurisic, Janos Vidali

Des. Codes Cryptogr., 2012

2010

Collisions for variants of the BLAKE hash function.

Janos Vidali, Peter Nose, Enes Pasalic

Inf. Process. Lett., 2010