Volgen
Émile Nadeau
Émile Nadeau
Geverifieerd e-mailadres voor ru.is
Titel
Geciteerd door
Geciteerd door
Jaar
Combinatorial Exploration: An algorithmic framework for enumeration
MH Albert, C Bean, A Claesson, É Nadeau, J Pantone, H Ulfarsson
arXiv preprint arXiv:2202.07715, 2022
152022
Leaf realization problem, caterpillar graphs and prefix normal words
AB Massé, J De Carufel, A Goupil, M Lapointe, É Nadeau, É Vandomme
Theoretical Computer Science 732, 1-13, 2018
152018
Fully leafed induced subtrees
A Blondin Massé, J De Carufel, A Goupil, M Lapointe, É Nadeau, ...
International Workshop on Combinatorial Algorithms, 90-101, 2018
92018
Résolution du problème d’Elmsley pour les mélanges horseshoe
É Nadeau
Rapport technique, Laboratoire de combinatoire et d’informatique …, 2016
22016
Résultats sur le problème d’Elmsley pour les mélanges Horseshoe
É Nadeau, S Schanck
Rapport technique, Laboratoire de combinatoire et d’informatique …, 2015
22015
Permutations avoiding bipartite partially ordered patterns have a regular insertion encoding
C Bean, É Nadeau, J Pantone, H Ulfarsson
arXiv preprint arXiv:2312.07716, 2023
12023
Enumeration of Permutation Classes and Weighted Labelled Independent Sets
C Bean, É Nadeau, H Ulfarsson
Discrete Mathematics & Theoretical Computer Science 22 (2), 2021
12021
Multivariate combinatorial exploration with regular strategies
E Nadeau
2023
Using large random permutations to partition permutation classes
C Bean, É Nadeau, J Pantone, H Ulfarsson
Pure Mathematics and Applications 30 (1), 31-36, 2022
2022
Sous-arbres induits pleinement feuillus
É Nadeau
Université du Québec à Montréal, 2018
2018
Inversion-Counting Sequences of Permutation Classes
MH Albert, C Bean, A Claesson, É Nadeau, J Pantone, H Ulfarsson
2024 Spring Central Sectional Meeting, 0
Horseshoe Shuffles and Elmsley’s Problem
E Nadeau, S Schanck
ELMSLEY’S PROBLEM FOR HORSESHOE PERMUTATIONS
É NADEAU, S SCHANCK
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–13