Stack words, standard tableaux and Baxter permutations
Proceedings of the 6th conference on Formal power series and algebraic combinatorics
Corner block list: an effective and efficient topological representation of non-slicing floorplan
Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
Floorplan representations: Complexity and connections
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Lattice congruences, fans and Hopf algebras
Journal of Combinatorial Theory Series A
A bijection between permutations and floorplans, and its applications
Discrete Applied Mathematics
On the number of rectangulations of a planar point set
Journal of Combinatorial Theory Series A
Bijections for Baxter families and related objects
Journal of Combinatorial Theory Series A
| Hi-index | 0.00 |
A rectangulation is a tiling of a rectangle by a finite number of rectangles. The rectangulation is called generic if no four of its rectangles share a single corner. We initiate the enumeration of generic rectangulations up to combinatorial equivalence by establishing an explicit bijection between generic rectangulations and a set of permutations defined by a pattern-avoidance condition analogous to the definition of the twisted Baxter permutations.