1 citations · 2 across the 5 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2024★ 1 cited
On the Hardness of Gray Code Problems for Combinatorial Objects
Arturo Merino, Namrata, Aaron Williams
Can a list of binary strings be ordered so that consecutive strings differ in a single bit? Can a list of permutations be ordered so that consecutive permutations differ by a swap?…
cs.DM2023
Combinatorial generation via permutation languages. VI. Binary trees
Petr Gregor, Torsten Mütze, Namrata
In this paper we propose a notion of pattern avoidance in binary trees that generalizes the avoidance of contiguous tree patterns studied by Rowland and non-contiguous tree pattern…