60 citations · 165 across the 31 of their papers we have counts for
4 papers · 1 filter
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…
On L-shaped point set embeddings of trees: first non-embeddable examples
Torsten Mütze, Manfred Scheucher
An L-shaped embedding of a tree in a point set is a planar drawing of the tree where the vertices are mapped to distinct points and every edge is drawn as a sequence of two axis-al…
Realization of shift graphs as disjointness graphs of 1-intersecting curves in the plane
Torsten Mütze, Bartosz Walczak, Veit Wiechert
It is shown that shift graphs can be realized as disjointness graphs of 1-intersecting curves in the plane. This implies that the latter class of graphs is not -bounded.
Gray codes and symmetric chains
Petr Gregor, Sven Jäger, Torsten Mütze +2
We consider the problem of constructing a cyclic listing of all bitstrings of length with Hamming weights in the interval , where , by…