Hard in theory, easy in practice: Why graph isomorphism algorithms seem to be so effective

Graphs are everywhere. In discrete mathematics, they are structures that show the connections between points, much like a ...
Quanta Magazine

A New Algorithm for Graph Crossings, Hiding in Plain Sight

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

Landmark Algorithm Breaks 30-Year Impasse

Computer scientists are abuzz over a fast new algorithm for solving one of the central problems in the field. (January 15, 2017, update: On January 4, Babai retracted his claim that the new algorithm ...
Helsinki

Andreas Grigorjew defends his PhD thesis on Algorithms and Graph Structures for Splitting Network Flows, in Theory and Practice

On the 19th of February 2025, M.Sc. Andreas Grigorjew defends his PhD thesis on Algorithms and Graph Structures for Splitting Network Flows, in Theory and Practice. The thesis is related to research ...
JSTOR Daily

A Branch-and-Cut Algorithm for the Plant-Cycle Location Problem

The Journal of the Operational Research Society, Vol. 55, No. 5 (May, 2004), pp. 513-520 (8 pages) The Plant-Cycle Location Problem (PCLP) is defined on a graph $G=(I ...