Articles by Arturo Merino

Efficient generation of rectangulations and elimination trees via permutation languages

-- Arturo Merino (Technische Universität Berlin)

In this talk we apply the Hartung-Hoang-Mütze-Williams permutation language framework to derive exhaustive generation algorithms for two further classes of combinatorial objects, as well as Hamilton paths and cycles on the corresponding polytopes: (3) different classes of rectangulations, which are subdivisions of a rectangle into smaller rectangles (see www.combos ...