Subclasses of Baxter Permutations Based on Pattern Avoidance
From MaRDI portal
Publication:5740186
DOI10.1007/978-3-319-34171-2_14zbMath1479.05002arXiv1112.1374OpenAlexW1932153945MaRDI QIDQ5740186
Sajin Koroth, Shankar Balachandran
Publication date: 25 July 2016
Published in: Computer Science – Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1112.1374
Cites Work
- The Hopf algebra of diagonal rectangulations.
- A bijection between permutations and floorplans, and its applications
- Simple permutations and pattern restricted permutations
- Optimal orientations of cells in slicing floorplan designs
- Fast recognition of Baxter permutations using syntactical and complete bipartite composite dag's
- Trees, slices, and wheels: On the floorplan area minimization problem
This page was built for publication: Subclasses of Baxter Permutations Based on Pattern Avoidance