Univerza na Primorskem Fakulteta za matematiko, naravoslovje in informacijske tehnologije
Kategorija Raziskovalni matematični seminar
Distances in graphs and the application to the problem of locating objects in a graph
Similarity of matrix tuples
How to Get Where You Want to Go (Topological complexity of motion planning)
Using association schemes to prove Erdős-Ko-Rado type results
On the Nullity of Altans and Iterated Altans
How to Search in the Right Direction
Understanding graphs with no long claws
Excluding a single-crossing matching minor
Excluding a single-crossing matching minor
Allocation of Indivisible Items with given Preference Graphs.