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

Scalable Graph Algorithms for Bioinformatics using Structure, Parameterization and Dynamic Updates, ERC Consolidator Grant, 9/2025-8/2030 Sequencing technologies have developed to be cheap and ...

Polyglot persistence is becoming the norm in big data. Gone are the days when relational databases were the one store to rule them all; now the notion of using stores with data models that best align ...

This paper presents a patrol problem, where a patroller traverses a graph through edges to detect potential attacks at nodes. To design a patrol policy, the patroller needs to take into account not ...

Understanding the relationships in graph database theory allows us to work with the new 'shape' of data itself. Businesspeople like graphs. C-suite executives are fond of pie charts, Venn diagrams, ...

Researchers thought that they were five years away from solving a math riddle from the 1980's. In reality, and without knowing, they had nearly cracked the problem and had just given away much of the ...

A graph product is the fundamental group of a graph of groups. Amongst the simplest examples are HNN groups and free products with amalgamation. The torsion and conjugacy theorems are proved for any ...