3 citations · 3 across the 2 of their papers we have counts for
2 papers
cs.DM2019
An Improved Upper Bound for the Ring Loading Problem
Karl Däubel
The Ring Loading Problem emerged in the 1990s to model an important special case of telecommunication networks (SONET rings) which gained attention from practitioners and theorists…
math.CO2018★ 3 cited
On orthogonal symmetric chain decompositions
Karl Däubel, Sven Jäger, Torsten Mütze +1
The -cube is the poset obtained by ordering all subsets of by inclusion, and it can be partitioned into chains, which is the min…