Vincent Vatter

According to our database, Vincent Vatter authored at least 46 papers between 2002 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

On Erdős's Proof of the Existence of Cages.

Vincent Vatter

Am. Math. Mon., November, 2023

2022

Letter Graphs and Geometric Grid Classes of Permutations.

Bogdan Alecu, Robert Ferguson, Mamadou Moustapha Kanté, Vadim V. Lozin, Vincent Vatter, Victor Zamaraev

SIAM J. Discret. Math., December, 2022

Letter graphs and modular decomposition.

Robert Ferguson, Vincent Vatter

Discret. Appl. Math., 2022

How Many Pop-Stacks Does It Take To Sort A Permutation?

Michael H. Albert, Vincent Vatter

Comput. J., 2022

2021

Bijective Proofs of Proper Coloring Theorems.

Bruce E. Sagan, Vincent Vatter

Am. Math. Mon., 2021

Containing All Permutations.

Michael Engen, Vincent Vatter

Am. Math. Mon., 2021

2020

A Probabilistic Proof of a Lemma That Is Not Burnside's.

Vincent Vatter

Am. Math. Mon., 2020

2019

Rationality for subclasses of 321-avoiding permutations.

Michael H. Albert, Robert Brignall, Nik Ruskuc, Vincent Vatter

Eur. J. Comb., 2019

On the dimension of downsets of integer partitions and compositions.

Michael Engen, Vincent Vatter

Australas. J Comb., 2019

2018

Generating permutations with restricted containers.

Michael H. Albert, Cheyne Homberger, Jay Pantone, Nathaniel Shar, Vincent Vatter

J. Comb. Theory, Ser. A, 2018

A Counterexample Regarding Labelled Well-Quasi-Ordering.

Robert Brignall, Michael Engen, Vincent Vatter

Graphs Comb., 2018

Universal Layered Permutations.

Michael H. Albert, Michael Engen, Jay Pantone, Vincent Vatter

Electron. J. Comb., 2018

2017

Linear Clique-Width for Hereditary Classes of Cographs.

Robert Brignall, Nicholas Korpelainen, Vincent Vatter

J. Graph Theory, 2017

2016

On the effective and automatic enumeration of polynomial permutation classes.

Cheyne Homberger, Vincent Vatter

J. Symb. Comput., 2016

An Erdős-Hajnal analogue for permutation classes.

Vincent Vatter

Discret. Math. Theor. Comput. Sci., 2016

The Complexity of Pattern Matching for 321-Avoiding and Skew-Merged Permutations.

Michael H. Albert, Marie-Louise Lackner, Martin Lackner, Vincent Vatter

Discret. Math. Theor. Comput. Sci., 2016

Pattern-avoiding involutions: exact and asymptotic enumeration.

Miklós Bóna, Cheyne Homberger, Jay Pantone, Vincent Vatter

Australas. J Comb., 2016

Two vignettes on full rook placements.

Jonathan Bloom, Vincent Vatter

Australas. J Comb., 2016

2015

Well-Quasi-Order for Permutation Graphs Omitting a Path and a Clique.

Aistis Atminas, Robert Brignall, Nicholas Korpelainen, Vadim V. Lozin, Vincent Vatter

Electron. J. Comb., 2015

2014

A stack and pop stack in series.

Rebecca Smith, Vincent Vatter

Australas. J Comb., 2014

Inflations of geometric grid classes: three case studies.

Michael H. Albert, M. D. Atkinson, Vincent Vatter

Australas. J Comb., 2014

2013

Generating and Enumerating 321-Avoiding and Skew-Merged Simple Permutations.

Michael H. Albert, Vincent Vatter

Electron. J. Comb., 2013

2012

Finding regular insertion encodings for permutation classes.

Vincent Vatter

J. Symb. Comput., 2012

Counting s(3+1)-avoiding permutations.

M. D. Atkinson, Bruce E. Sagan, Vincent R. Vatter

Eur. J. Comb., 2012

2011

Maximal Independent Sets and Separating Covers.

Vincent Vatter

Am. Math. Mon., 2011

On Partial Well-Order for Monotone Grid Classes of Permutations.

Vincent Vatter, Steve Waton

Order, 2011

On convex permutations.

Michael H. Albert, Steve Linton, Nikola Ruskuc, Vincent Vatter, Steve Waton

Discret. Math., 2011

On Points Drawn from a Circle.

Vincent Vatter, Steve Waton

Electron. J. Comb., 2011

2010

Small configurations in simple permutations.

Vincent Vatter

Eur. J. Comb., 2010

2009

The enumeration of permutations sortable by pop stacks in parallel.

Rebecca Smith, Vincent Vatter

Inf. Process. Lett., 2009

Almost avoiding permutations.

Robert Brignall, Shalosh B. Ekhad, Rebecca Smith, Vincent Vatter

Discret. Math., 2009

Counting 1324, 4231-Avoiding Permutations.

Michael H. Albert, M. D. Atkinson, Vincent Vatter

Electron. J. Comb., 2009

2008

Simple permutations: Decidability and unavoidable substructures.

Robert Brignall, Nikola Ruskuc, Vincent Vatter

Theor. Comput. Sci., 2008

Simple permutations and algebraic generating functions.

Robert Brignall, Sophie Huczynska, Vincent Vatter

J. Comb. Theory, Ser. A, 2008

Reconstructing compositions.

Vincent Vatter

Discret. Math., 2008

Enumeration Schemes for Restricted Permutations.

Vincent Vatter

Comb. Probab. Comput., 2008

A Sharp Bound for the Reconstruction of Partitions.

Vincent Vatter

Electron. J. Comb., 2008

Decomposing simple permutations, with enumerative consequences.

Robert Brignall, Sophie Huczynska, Vincent Vatter

Comb., 2008

2006

Finitely labeled generating trees and restricted permutations.

Vincent Vatter

J. Symb. Comput., 2006

Maximal independent sets in graphs with at most <i>r</i> cycles.

Goh Chee Ying, Khee Meng Koh, Bruce E. Sagan, Vincent R. Vatter

J. Graph Theory, 2006

Maximal and maximum independent sets in graphs with at most <i>r</i> cycles.

Bruce E. Sagan, Vincent R. Vatter

J. Graph Theory, 2006

Grid Classes and the Fibonacci Dichotomy for Restricted Permutations.

Sophie Huczynska, Vincent Vatter

Electron. J. Comb., 2006

2004

Bounding quantities related to the packing density of 1(ℓ+1)ℓ⋯2.

Martin Hildebrand, Bruce E. Sagan, Vincent R. Vatter

Adv. Appl. Math., 2004

2002

Permutations Avoiding Two Patterns of Length Three.

Vincent R. Vatter

Electron. J. Comb., 2002

Profile Classes and Partial Well-Order for Permutations.

Maximillian M. Murphy, Vincent R. Vatter

Electron. J. Comb., 2002

Pattern Frequency Sequences and Internal Zeros.

Miklós Bóna, Bruce E. Sagan, Vincent R. Vatter

Adv. Appl. Math., 2002