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 ...

Distributed algorithms for graph problems represent a vibrant area of study that addresses the challenges of decentralised computation across interconnected networks. By partitioning complex graph ...

Graph cover problems form a critical area within discrete optimisation and theoretical computer science, addressing the challenge of selecting subsets of vertices (or edges) that satisfy predetermined ...

On Tuesday the 3rd of October 2023, M.Sc. Manuel Cáceres defends his PhD thesis on Parameterized and Safe & Complete Graph Algorithms for Bioinformatics. The thesis is related to research done in the ...