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

How Should I Label Log Scales in Charts and Graphs?

Forbes contributors publish independent expert analyses and insights. I help people communicate data clearly with graphs. In “When Should I Use Logarithmic Scales in My Charts and Graphs”, I showed ...
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 ...