In the teaching of computer science, metaphors and analogies are especially fitting: the essence of algorithms is abstract discrete structures, and to help learners quickly grasp the logic within, we ...

The paper considers a project scheduling problem in weighted directed graphs in which arcs represent operations while nodes are identified with starting and finishing endpoints of the operations; arc ...

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

Sometimes, wrapping your head around mathematical concepts can be tricky without a visual aid. Thankfully we have makers like ...

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