Algorithmic complexity, a cornerstone of theoretical computer science, examines the intrinsic resource requirements of computational problems and the limits of what can be efficiently computed. Within ...

Algorithmic graph theory and optimisation represents a critical nexus between discrete mathematics and computer science, underpinning the development of efficient methodologies for analysing complex ...

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

Two computer scientists found — in the unlikeliest of places — just the idea they needed to make a big leap in graph theory. This past October, as Jacob Holm and Eva Rotenberg were thumbing through a ...

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

In algorithms, as in life, negativity can be a drag. Consider the problem of finding the shortest path between two points on a graph — a network of nodes connected by links, or edges. Often, these ...

Scalable Graph Algorithms for Bioinformatics (SCALEBIO) is a project taking place during Sep 2025 - Aug 2030 at the University of Helsinki. It is funded by the European Research Council (ERC) under ...

A professor has helped create a powerful new algorithm that uncovers hidden patterns in complex networks, with potential uses in fraud detection, biology and knowledge discovery. University of ...