Abstract elementary classes (AECs) constitute a broad framework within model theory that extends classical first‐order logic, accommodating structures and theories that lie beyond its reach. By ...

Abstract Forty years ago, Kleitman considered the numbers of crossings in good planar drawings of the complete bipartite graph ${K_{m,n}}$. Among other things, he ...

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