| Publication | Date of Publication | Type |
|---|
Enumeration of pattern-avoiding alternating sign matrices: an asymptotic dichotomy
Annals of Combinatorics | 2026-04-01 | Paper |
A logical limit law for \(231\)-avoiding permutations
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2024-09-17 | Paper |
Random cographs: Brownian graphon limit and asymptotic degree distribution
Random Structures & Algorithms | 2023-10-12 | Paper |
| scientific article; zbMATH DE number 7731162 (Why is no real title available?) | 2023-08-23 | Paper |
scientific article; zbMATH DE number 7731162 (Why is no real title available?)
(available as arXiv preprint) | 2023-08-23 | Paper |
Preimages under the bubblesort operator
The Electronic Journal of Combinatorics | 2023-01-11 | Paper |
Linear-sized independent sets in random cographs and increasing subsequences in separable permutations
Combinatorial Theory | 2022-11-23 | Paper |
| Scaling limit of graph classes through split decomposition | 2022-07-25 | Paper |
Scaling limits of permutation classes with a finite specification: a dichotomy
Advances in Mathematics | 2022-07-15 | Paper |
| The interval posets of permutations seen from the decomposition tree perspective | 2021-10-19 | Paper |
Counting phylogenetic networks of level 1 and 2
Journal of Mathematical Biology | 2021-01-19 | Paper |
Universal limits of substitution-closed permutation classes
Journal of the European Mathematical Society (JEMS) | 2020-12-17 | Paper |
A decorated tree approach to random permutations in substitution-closed classes
Electronic Journal of Probability | 2020-07-29 | Paper |
A decorated tree approach to random permutations in substitution-closed classes
Electronic Journal of Probability | 2020-07-29 | Paper |
Some families of trees arising in permutation analysis
The Electronic Journal of Combinatorics | 2020-06-04 | Paper |
| Slicings of parallelogram polyominoes, or how Baxter and Schröder can be reconciled | 2020-05-26 | Paper |
Two first-order logics of permutations
Journal of Combinatorial Theory. Series A | 2020-02-21 | Paper |
Slicings of parallelogram polyominoes: Catalan, Schröder, Baxter, and other sequences
The Electronic Journal of Combinatorics | 2019-08-05 | Paper |
Slicings of parallelogram polyominoes: Catalan, Schröder, Baxter, and other sequences
The Electronic Journal of Combinatorics | 2019-08-05 | Paper |
Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers
Theoretical Computer Science | 2019-06-18 | Paper |
| Enumeration of permutations sorted with two passes through a stack and \(D_{8}\) symmetries | 2019-05-24 | Paper |
| Combinatorial specification of permutation classes | 2019-05-24 | Paper |
Combinatorial specification of permutation classes
(available as arXiv preprint) | 2019-05-24 | Paper |
| Analysis of algorithms for permutations biased by their number of records | 2019-04-29 | Paper |
Scaling limits of permutation classes with a finite specification: a dichotomy
(available as arXiv preprint) | 2019-03-18 | Paper |
Semi-Baxter and strong-Baxter: two relatives of the Baxter sequence
SIAM Journal on Discrete Mathematics | 2018-12-05 | Paper |
The Brownian limit of separable permutations
The Annals of Probability | 2018-08-16 | Paper |
The Brownian limit of separable permutations
The Annals of Probability | 2018-08-16 | Paper |
Semi-Baxter and strong-Baxter permutations
Séminaire Lotharingien de Combinatoire | 2018-04-20 | Paper |
An algorithm computing combinatorial specifications of permutation classes
Discrete Applied Mathematics | 2017-05-15 | Paper |
Permutation classes and polyomino classes with excluded submatrices
Mathematical Structures in Computer Science | 2017-04-04 | Paper |
A general theory of Wilf-equivalence for Catalan structures
The Electronic Journal of Combinatorics | 2016-01-25 | Paper |
A general theory of Wilf-equivalence for Catalan structures
The Electronic Journal of Combinatorics | 2016-01-25 | Paper |
An algorithm for deciding the finiteness of the number of simple permutations in permutation classes
Advances in Applied Mathematics | 2015-02-06 | Paper |
Operators of equivalent sorting power and related Wilf-equivalences
The Electronic Journal of Combinatorics | 2014-10-23 | Paper |
Refined enumeration of permutations sorted with two stacks and a \(D_8\)-symmetry
Annals of Combinatorics | 2014-09-04 | Paper |
Combinatorics of non-ambiguous trees
Advances in Applied Mathematics | 2014-08-28 | Paper |
| Combinatorics of non-ambiguous trees | 2014-02-18 | Paper |
Operators of equivalent sorting power and related Wilf-equivalences
(available as arXiv preprint) | 2014-02-18 | Paper |
| Operators of equivalent sorting power and related Wilf-equivalences | 2014-02-18 | Paper |
| Some simple varieties of trees arising in permutation analysis | 2014-02-18 | Paper |
On the enumeration of \(d\)-minimal permutations
(available as arXiv preprint) | 2014-02-14 | Paper |
| On the enumeration of \(d\)-minimal permutations | 2014-02-14 | Paper |
Geometric grid classes of permutations
Transactions of the American Mathematical Society | 2013-09-16 | Paper |
Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial
PU.M.A. Pure Mathematics and Applications | 2012-09-18 | Paper |
On the inverse image of pattern classes under bubble sort
Journal of Combinatorics | 2012-07-16 | Paper |
Average-case analysis of perfect sorting by reversals
Discrete Mathematics, Algorithms and Applications | 2012-06-12 | Paper |
Enumeration of pin-permutations
The Electronic Journal of Combinatorics | 2011-06-01 | Paper |
Enumeration of pin-permutations
The Electronic Journal of Combinatorics | 2011-06-01 | Paper |
| The longest common pattern problem for two permutations | 2011-02-22 | Paper |
Some statistics on permutations avoiding generalized patterns
(available as arXiv preprint) | 2011-02-22 | Paper |
| Posets and permutations in the duplication-loss model | 2011-02-22 | Paper |
Posets and permutations in the duplication-loss model: minimal permutations with \(d\) descents
Theoretical Computer Science | 2010-06-07 | Paper |
Average-Case Analysis of Perfect Sorting by Reversals
Combinatorial Pattern Matching | 2009-07-07 | Paper |
A variant of the tandem duplication-random loss model of genome rearrangement
Theoretical Computer Science | 2009-03-17 | Paper |
Longest Common Separable Pattern Among Permutations
Combinatorial Pattern Matching | 2008-06-17 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
A logical limit law for $231$-avoiding permutations
(available as arXiv preprint) | N/A | Paper |
Dense and nondense limits for uniform random intersection graphs
(available as arXiv preprint) | N/A | Paper |
A canonical tree decomposition for order types, and some applications
(available as arXiv preprint) | N/A | Paper |
