Mathilde Bouvel

45 papers A* 1B 3Journal 41

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Large chirotopes with computable numbers of triangulations. CoRR Mathilde Bouvel, Valentin Féray, Xavier Goaoc, Florent Koechlin
2025	J	`jnl`	A Canonical Tree Decomposition for Order Types, and Some Applications. SIAM J. Discret. Math. Mathilde Bouvel, Valentin Féray, Xavier Goaoc, Florent Koechlin
2025	J	`jnl`	Between Weak and Bruhat: The Middle Order on Permutations. Graphs Comb. Mathilde Bouvel, Luca S. Ferrari, Bridget Eileen Tenner
2025	J	`jnl`	Key-avoidance for alternating sign matrices. Discret. Math. Theor. Comput. Sci. Mathilde Bouvel, Rebecca Smith, Jessica Striker
2025	J	`jnl`	The Interval Posets of Permutations Seen from the Decomposition Tree Perspective. Order Mathilde Bouvel, Lapo Cioni, Benjamin Izart
2024	A*	`conf`	A Canonical Tree Decomposition for Chirotopes. SoCG Mathilde Bouvel, Valentin Féray, Xavier Goaoc, Florent Koechlin
2024	J	`jnl`	A canonical tree decomposition for order types, and some applications. CoRR Mathilde Bouvel, Valentin Féray, Xavier Goaoc, Florent Koechlin
2024	J	`jnl`	Record-biased permutations and their permuton limit. CoRR Mathilde Bouvel, Cyril Nicaud, Carine Pivoteau
2023	J	`jnl`	A logical limit law for Discret. Math. Theor. Comput. Sci. Michael Albert, Mathilde Bouvel, Valentin Féray, Marc Noy
2023	J	`jnl`	Baxter tree-like tableaux. Australas. J Comb. Jean-Christophe Aval, Adrien Boussicault, Mathilde Bouvel, Olivier Guibert, Matteo Silimbani
2023	J	`jnl`	Forty years of history. Eur. J. Comb. Marthe Bonamy, Patrice Ossona de Mendez, Éric Colin de Verdière, Mathilde Bouvel
2022	J	`jnl`	Linear-sized independent sets in random cographs and increasing subsequences in separable permutations. Comb. Theory Frédérique Bassino, Mathilde Bouvel, Michael Drmota, Valentin Féray, Lucas Gerin, Mickaël Maazoun, Adeline Pierrot
2022	J	`jnl`	Preimages under the Bubblesort Operator. Electron. J. Comb. Mathilde Bouvel, Lapo Cioni, Luca S. Ferrari
2022	J	`jnl`	Random cographs: Brownian graphon limit and asymptotic degree distribution. Random Struct. Algorithms Frédérique Bassino, Mathilde Bouvel, Valentin Féray, Lucas Gerin, Mickaël Maazoun, Adeline Pierrot
2020	J	`jnl`	Some Families of Trees Arising in Permutation Analysis. Electron. J. Comb. Mathilde Bouvel, Marni Mishna, Cyril Nicaud
2020	J	`jnl`	Two first-order logics of permutations. J. Comb. Theory A Michael H. Albert, Mathilde Bouvel, Valentin Féray
2019	J	`jnl`	Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers. Theor. Comput. Sci. Nicholas R. Beaton, Mathilde Bouvel, Veronica Guerrini, Simone Rinaldi
2019	J	`jnl`	Slicings of Parallelogram Polyominoes: Catalan, Schröder, Baxter, and Other Sequences. Electron. J. Comb. Nicholas R. Beaton, Mathilde Bouvel, Veronica Guerrini, Simone Rinaldi
2018	J	`jnl`	Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers. CoRR Nicholas R. Beaton, Mathilde Bouvel, Veronica Guerrini, Simone Rinaldi
2018	J	`jnl`	Semi-Baxter and Strong-Baxter: Two Relatives of the Baxter Sequence. SIAM J. Discret. Math. Mathilde Bouvel, Veronica Guerrini, Andrew Rechnitzer, Simone Rinaldi
2017	J	`jnl`	An algorithm computing combinatorial specifications of permutation classes. Discret. Appl. Math. Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot, Carine Pivoteau, Dominique Rossin
2017	J	`jnl`	Permutation classes and polyomino classes with excluded submatrices. Math. Struct. Comput. Sci. Daniela Battaglino, Mathilde Bouvel, Andrea Frosini, Simone Rinaldi
2016	J	`jnl`	Analysis of Algorithms for Permutations Biased by Their Number of Records. CoRR Nicolas Auger, Mathilde Bouvel, Cyril Nicaud, Carine Pivoteau
2015	J	`jnl`	A General Theory of Wilf-Equivalence for Catalan Structures. Electron. J. Comb. Michael H. Albert, Mathilde Bouvel
2015	J	`jnl`	An algorithm computing combinatorial specifications of permutation classes. CoRR Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot, Carine Pivoteau, Dominique Rossin
2015	J	`jnl`	An algorithm for deciding the finiteness of the number of simple permutations in permutation classes. Adv. Appl. Math. Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot, Dominique Rossin
2014	J	`jnl`	Combinatorics of non-ambiguous trees. Adv. Appl. Math. Jean-Christophe Aval, Adrien Boussicault, Mathilde Bouvel, Matteo Silimbani
2014	J	`jnl`	Operators of Equivalent Sorting Power and Related Wilf-equivalences. Electron. J. Comb. Michael H. Albert, Mathilde Bouvel
2014	J	`jnl`	Operators of equivalent sorting power and related Wilf-equivalences. CoRR Michael H. Albert, Mathilde Bouvel
2013	J	`jnl`	An algorithm for deciding the finiteness of the number of simple permutations in permutation classes. CoRR Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot, Dominique Rossin
2013	J	`jnl`	On the enumeration of d-minimal permutations. Discret. Math. Theor. Comput. Sci. Mathilde Bouvel, Luca Ferrari
2012	J	`jnl`	Average-case analysis of perfect sorting by reversals (Journal Version) CoRR Mathilde Bouvel, Cédric Chauve, Marni Mishna, Dominique Rossin
2011	J	`jnl`	Average-Case Analysis of Perfect Sorting by Reversals. Discret. Math. Algorithms Appl. Mathilde Bouvel, Cédric Chauve, Marni Mishna, Dominique Rossin
2011	J	`jnl`	Enumeration of Pin-Permutations. Electron. J. Comb. Frédérique Bassino, Mathilde Bouvel, Dominique Rossin
2010	J	`jnl`	Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial CoRR Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot, Dominique Rossin
2010	J	`jnl`	On the enumeration of d-minimal permutations CoRR Mathilde Bouvel, Luca Ferrari
2010	J	`jnl`	Posets and permutations in the duplication-loss model: Minimal permutations with d descents. Theor. Comput. Sci. Mathilde Bouvel, Elisa Pergola
2009	J	`jnl`	A variant of the tandem duplication - random loss model of genome rearrangement. Theor. Comput. Sci. Mathilde Bouvel, Dominique Rossin
2009	B	`conf`	Average-Case Analysis of Perfect Sorting by Reversals. CPM Mathilde Bouvel, Cédric Chauve, Marni Mishna, Dominique Rossin
2009	J	`jnl`	Average-case analysis of perfect sorting by reversals CoRR Mathilde Bouvel, Cédric Chauve, Marni Mishna, Dominique Rossin
2008	J	`jnl`	Posets and Permutations in the Duplication-Loss Model: Minimal Permutations with d Descents CoRR Mathilde Bouvel, Elisa Pergola
2007	B	`conf`	Longest Common Separable Pattern Among Permutations. CPM Mathilde Bouvel, Dominique Rossin, Stéphane Vialette
2007	J	`jnl`	Longest Common Separable Pattern between Permutations CoRR Mathilde Bouvel, Dominique Rossin, Stéphane Vialette
2006	J	`jnl`	Longest Common Pattern between two Permutations CoRR Dominique Rossin, Mathilde Bouvel
2005	B	`conf`	Combinatorial Search on Graphs Motivated by Bioinformatics Applications: A Brief Survey. WG Mathilde Bouvel, Vladimir Grebinski, Gregory Kucherov