A puzzle that has long flummoxed computers and the scientists who program them has suddenly become far more manageable. A new algorithm efficiently solves the graph isomorphism problem, computer ...
Expanders graphs are sparse but well-connected. These seemingly contrasting properties have led to many applications in theoretical computer science, from complexity ...
On the 27th of June 2025, M.Sc. Nicola Rizzo defends his PhD thesis on Indexable Sequence Graphs: Exploiting Uniqueness in the Pangenome Era. The thesis is related to research done in the Department ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results