Imagine you're at a fair, and you see a booth with a giant dartboard. The booth owner challenges you to hit the bullseye. You take your shot, and the dart lands somewhere on the board. Now imagine ...

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

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

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