Skip to content
Snippets Groups Projects
Commit 35aab52d authored by Janoš Vidali's avatar Janoš Vidali
Browse files

Add CV for Janoš Vidali

parent 7e9d95d5
No related branches found
No related tags found
No related merge requests found
\begin{participant}[type=R,PM=6,gender=male]{Jano\v{s} Vidali}
is a teaching assistant at the Faculty of Mathematics and Physics,
University of Ljubljana.
On the undergraduate level,
he took the Interdisciplinary study of Computer Science and Mathematics,
and graduated with a thesis from cryptography,
which was also his initial research area.
Later, he started researching in algebraic combinatorics,
particularly distance-regular graphs,
which was also the topic of his PhD thesis.
His current research interests also include
some other related aspects of algebraic combinatorics,
such as $Q$-polynomial association schemes.
He has (co-)authored $5$ papers published in international journals,
and $2$ in the proceedings of international conferences.
In 2015, he started a project, together with Katja Ber\v{c}i\v{c},
which would gather various censuses of graphs
and make them easily accessible and searchable.
They soon realized that there was no reason
to limit the collection to just graphs --
instead, the project aims to become
a repository of various discrete objects.
Thus, the project was named {\em DiscreteZOO}.
Jano\v{s} Vidali has contributed a Sage package
which acts as a framework and interface to the repository,
and currently supports accessing graphs from Sage.
He has also developed a package named {\tt sage-drg},
which can be used to compute parameters
of association schemes and distance-regular graphs
and check for their feasibility.
Besides that, he has also contributed to Sage itself,
(co-)authoring $8$ tickets.
\end{participant}
%%% Local Variables:
%%% mode: latex
%%% TeX-master: "../proposal"
%%% End:
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Please register or to comment