\begin{thebibliography}{10}

\bibitem{aldred2005permuting}
Robert E.~L. Aldred, Mike~D. Atkinson, Hans~P. van Ditmarsch, Chris~C. Handley,
  Derek~A. Holton, and D.~J. McCaughan, Permuting machines and priority queues,
  {\em Theoret. Comput. Sci.} {\bf 349} (2005), 309--317.

\bibitem{asinowski2013orders}
Andrei Asinowski, Gill Barequet, Mireille Bousquet-M{\'e}lou, Toufik Mansour,
  and Ron~Y Pinter, Orders induced by segments in floorplans and $(2-14-3,
  3-41-2) $-avoiding permutations, {\em Electron. J. Combin.} {\bf 20} (2013),
  P35.

\bibitem{asinowski2010separable}
Andrei Asinowski and Toufik Mansour, Separable $d$-permutations and guillotine
  partitions, {\em Ann. Comb.} {\bf 14} (2010), 17--43.

\bibitem{atkinson1995priority}
Mike~D. Atkinson, Stephen~A. Linton, and Louise~A. Walker, Priority queues and
  multisets, {\em Electron. J. Combin.} {\bf 2} (1995), R24.

\bibitem{atkinson1993permutational}
Mike~D. Atkinson and Murali Thiyagarajah, The permutational power of a priority
  queue, {\em BIT} {\bf 33} (1993), 1--6.

\bibitem{aval2021baxter}
Jean-Christophe Aval, Adrien Boussicault, Mathilde Bouvel, Olivier Guibert, and
  Matteo Silimbani, Baxter tree-like tableaux, (2021),
  \url{https://arxiv.org/abs/2108.06212}.

\bibitem{Bax:65}
Glen Baxter, On fixed points of the composite of commuting functions, {\em
  Proc. Amer. Math. Soc.} {\bf 15} (1964), 851--855.

\bibitem{baxterjoichi}
Glen Baxter and J.~T. Joichi, On permutations induced by commuting functions,
  and an embedding question, {\em Math. Scand.} {\bf 13} (1963), 140--150.

\bibitem{bonichon2010baxter}
Nicolas Bonichon, Mireille Bousquet-M{\'e}lou, and {\'E}ric Fusy, Baxter
  permutations and plane bipolar orientations, {\em S{\'e}m. Lothar. Combin.}
  {\bf 61} (2010), B61Ah.

\bibitem{bose1998pattern}
Prosenjit Bose, Jonathan~F. Buss, and Anna Lubiw, Pattern matching for
  permutations, {\em Inform. Process. Lett.} {\bf 65} (1998), 277--283.

\bibitem{bouvel2018semi}
Mathilde Bouvel, Veronica Guerrini, Andrew Rechnitzer, and Simone Rinaldi,
  Semi-{B}axter and strong-{B}axter: two relatives of the {B}axter sequence,
  {\em SIAM J. Discrete Math.} {\bf 32} (2018), 2795--2819.

\bibitem{burrill2016tableau}
Sophie Burrill, Julien Courtiel, {\'E}ric Fusy, Stephen Melczer, and Marni
  Mishna, Tableau sequences, open diagrams, and {B}axter families, {\em
  European J. Combin.} {\bf 58} (2016), 144--165.

\bibitem{cardinal_open}
Jean Cardinal, Order and geometry workshop 2016 --- problem booklet,
  \url{http://orderandgeometry2016.tcs.uj.edu.pl/docs/OG2016-Problem-Booklet.pdf},
  2016.

\bibitem{silveira2018note}
Jean Cardinal, Vera Sacristán, and Rodrigo~I. Silveira, A note on flips in
  diagonal rectangulations, {\em Discrete Math. Theor. Comput. Sci.} {\bf {vol.
  20 no. 2}} (2018), 1--22.

\bibitem{dulucq1998baxter}
Serge Dulucq and Olivier Guibert, Baxter permutations, {\em Discrete Math.}
  {\bf 180} (1998), 143--156.

\bibitem{earnest2014permutation}
Michael~J. Earnest and Samuel~C. Gutekunst, Permutation patterns in {L}atin
  squares, {\em Aust. J. Combin.} {\bf 59} (2014), 218--228.

\bibitem{eriksson2000combinatorial}
Kimmo Eriksson and Svante Linusson, A combinatorial theory of
  higher-dimensional permutation arrays, {\em Adv. in Appl. Math.} {\bf 25}
  (2000), 194--211.

\bibitem{felsner2011bijections}
Stefan Felsner, {\'E}ric Fusy, Marc Noy, and David Orden, Bijections for
  {B}axter families and related objects, {\em J. Combin. Theory Ser. A} {\bf
  118} (2011), 993--1020.

\bibitem{felsner2020plattenbauten}
Stefan Felsner, Kolja Knauer, and Torsten Ueckerdt, Plattenbauten: touching
  rectangles in space, In Isolde Adler and Haiko M{\"u}ller, editors, {\em
  International Workshop on Graph-Theoretic Concepts in Computer Science}, Vol.
  12301 of {\em Lect. Notes in Comp. Sci.}, pp.  161--173. Springer, 2020.

\bibitem{fusy_meanders}
{\'E}ric Fusy, Baxter permutations and meanders,
  \url{https://igm.univ-mlv.fr/~fusy/Talks/baxter_meanders.pdf}, 2012.

\bibitem{fusy2012bijective}
{\'E}ric Fusy, Bijective counting of involutive {B}axter permutations, {\em
  Fund. Inform.} {\bf 117} (2012), 179--188.

\bibitem{guibert2000doubly}
Olivier Guibert and Svante Linusson, Doubly alternating {B}axter permutations
  are {C}atalan, {\em Discrete Math.} {\bf 217} (2000), 157--166.

\bibitem{gunby2019asymptotics}
Benjamin Gunby and D{\"o}m{\"o}t{\"o}r P{\'a}lv{\"o}lgyi, Asymptotics of
  pattern avoidance in the {K}lazar set partition and permutation-tuple
  settings, {\em European J. Combin.} {\bf 82} (2019), 102992.

\bibitem{oeis}
OEIS~Foundation Inc., The on-line encyclopedia of integer sequences, 2022.
  Available at \url{http://oeis.org/}.

\bibitem{knuth1973art}
Donald~E. Knuth, {\em The Art of Computer Programming, volume 3: Searching and
  sorting}, Addison-Wesley Publishing Company, 1973.

\bibitem{mansour2020enumeration}
Toufik Mansour, Enumeration and {W}ilf-classification of permutations avoiding
  four patterns of length 4, {\em Discrete Math. Lett}  (2020), 67--94.

\bibitem{rotem1981stack}
Doron Rotem, Stack sortable permutations, {\em Discrete Math.} {\bf 33} (1981),
  185--196.

\bibitem{salo2020cutting}
Ville Salo, Cutting corners, (2020), \url{https://arxiv.org/abs/2002.08730}.

\bibitem{shapiro1991bootstrap}
Louis Shapiro and A.~Brooke Stephens, Bootstrap percolation, the {S}chr{\"o}der
  numbers, and the n-kings problem, {\em SIAM J. Discrete Math.} {\bf 4}
  (1991), 275--280.

\bibitem{simion1985restricted}
Rodica Simion and Frank~W. Schmidt, Restricted permutations, {\em European J.
  Combin.} {\bf 6} (1985), 383--406.

\bibitem{stembridge1996fully}
John~R. Stembridge, On the fully commutative elements of {C}oxeter groups, {\em
  J. Algebraic Combin.} {\bf 5} (1996), 353--385.

\bibitem{west2006enumeration}
Julian West and Olivier Guibert, Enumeration of {R}eading’s twisted {B}axter
  permutations, In {\em The Fourth Annual International Conference on
  Permutation Patterns. Reykjavik University, Reykjavik}, 2006.

\end{thebibliography}
