default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVincent Vatter
Person information
- affiliation: University of Florida, Gainesville, FL, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j47]Vincent Vatter
:
Counting Parity Palindrome Compositions. Am. Math. Mon. 131(5): 432 (2024)- 2023
- [j46]Vincent Vatter:
On Erdős's Proof of the Existence of Cages. Am. Math. Mon. 130(10): 892 (2023) - 2022
- [j45]Michael H. Albert, Vincent Vatter:
How Many Pop-Stacks Does It Take To Sort A Permutation? Comput. J. 65(10): 2610-2614 (2022) - [j44]Robert Ferguson, Vincent Vatter:
Letter graphs and modular decomposition. Discret. Appl. Math. 309: 215-220 (2022) - [j43]Bogdan Alecu, Robert Ferguson, Mamadou Moustapha Kanté, Vadim V. Lozin, Vincent Vatter, Victor Zamaraev:
Letter Graphs and Geometric Grid Classes of Permutations. SIAM J. Discret. Math. 36(4): 2774-2797 (2022) - 2021
- [j42]Michael Engen, Vincent Vatter:
Containing All Permutations. Am. Math. Mon. 128(1): 4-24 (2021) - [j41]Bruce E. Sagan, Vincent Vatter:
Bijective Proofs of Proper Coloring Theorems. Am. Math. Mon. 128(6): 483-499 (2021) - 2020
- [j40]Vincent Vatter:
A Probabilistic Proof of a Lemma That Is Not Burnside's. Am. Math. Mon. 127(1): 63 (2020)
2010 – 2019
- 2019
- [j39]Michael Engen, Vincent Vatter:
On the dimension of downsets of integer partitions and compositions. Australas. J Comb. 74: 98-111 (2019) - [j38]Michael H. Albert, Robert Brignall, Nik Ruskuc, Vincent Vatter:
Rationality for subclasses of 321-avoiding permutations. Eur. J. Comb. 78: 44-72 (2019) - 2018
- [j37]Michael H. Albert, Michael Engen, Jay Pantone, Vincent Vatter:
Universal Layered Permutations. Electron. J. Comb. 25(3): 3 (2018) - [j36]Robert Brignall, Michael Engen, Vincent Vatter:
A Counterexample Regarding Labelled Well-Quasi-Ordering. Graphs Comb. 34(6): 1395-1409 (2018) - [j35]Michael H. Albert, Cheyne Homberger, Jay Pantone, Nathaniel Shar, Vincent Vatter:
Generating permutations with restricted containers. J. Comb. Theory A 157: 205-232 (2018) - 2017
- [j34]Robert Brignall, Nicholas Korpelainen, Vincent Vatter:
Linear Clique-Width for Hereditary Classes of Cographs. J. Graph Theory 84(4): 501-511 (2017) - 2016
- [j33]Jonathan Bloom, Vincent Vatter:
Two vignettes on full rook placements. Australas. J Comb. 64: 77-87 (2016) - [j32]Miklós Bóna, Cheyne Homberger, Jay Pantone, Vincent Vatter:
Pattern-avoiding involutions: exact and asymptotic enumeration. Australas. J Comb. 64: 88-119 (2016) - [j31]Michael H. Albert, Marie-Louise Lackner, Martin Lackner, Vincent Vatter:
The Complexity of Pattern Matching for 321-Avoiding and Skew-Merged Permutations. Discret. Math. Theor. Comput. Sci. 18(2) (2016) - [j30]Vincent Vatter:
An Erdős-Hajnal analogue for permutation classes. Discret. Math. Theor. Comput. Sci. 18(2) (2016) - [j29]Cheyne Homberger, Vincent Vatter:
On the effective and automatic enumeration of polynomial permutation classes. J. Symb. Comput. 76: 84-96 (2016) - 2015
- [j28]Aistis Atminas, Robert Brignall, Nicholas Korpelainen, Vadim V. Lozin, Vincent Vatter:
Well-Quasi-Order for Permutation Graphs Omitting a Path and a Clique. Electron. J. Comb. 22(2): 2 (2015) - [i1]Michael H. Albert, Marie-Louise Lackner, Martin Lackner, Vincent Vatter:
The Complexity of Pattern Matching for 321-Avoiding and Skew-Merged Permutations. CoRR abs/1510.06051 (2015) - 2014
- [j27]Michael H. Albert, M. D. Atkinson, Vincent Vatter:
Inflations of geometric grid classes: three case studies. Australas. J Comb. 58: 27-47 (2014) - [j26]Rebecca Smith, Vincent Vatter:
A stack and pop stack in series. Australas. J Comb. 58: 157-171 (2014) - 2013
- [j25]Michael H. Albert, Vincent Vatter:
Generating and Enumerating 321-Avoiding and Skew-Merged Simple Permutations. Electron. J. Comb. 20(2): 44 (2013) - 2012
- [j24]M. D. Atkinson, Bruce E. Sagan, Vincent R. Vatter:
Counting s(3+1)-avoiding permutations. Eur. J. Comb. 33(1): 49-61 (2012) - [j23]Vincent Vatter:
Finding regular insertion encodings for permutation classes. J. Symb. Comput. 47(3): 259-265 (2012) - 2011
- [j22]Vincent Vatter, Steve Waton:
On Points Drawn from a Circle. Electron. J. Comb. 18(1) (2011) - [j21]Michael H. Albert, Steve Linton, Nikola Ruskuc, Vincent Vatter, Steve Waton:
On convex permutations. Discret. Math. 311(8-9): 715-722 (2011) - [j20]Vincent Vatter, Steve Waton:
On Partial Well-Order for Monotone Grid Classes of Permutations. Order 28(2): 193-199 (2011) - [j19]Vincent Vatter:
Maximal Independent Sets and Separating Covers. Am. Math. Mon. 118(5): 418-423 (2011) - 2010
- [j18]Vincent Vatter:
Small configurations in simple permutations. Eur. J. Comb. 31(7): 1781-1784 (2010)
2000 – 2009
- 2009
- [j17]Michael H. Albert, M. D. Atkinson, Vincent Vatter:
Counting 1324, 4231-Avoiding Permutations. Electron. J. Comb. 16(1) (2009) - [j16]Robert Brignall, Shalosh B. Ekhad, Rebecca Smith, Vincent Vatter:
Almost avoiding permutations. Discret. Math. 309(23-24): 6626-6631 (2009) - [j15]Rebecca Smith, Vincent Vatter:
The enumeration of permutations sortable by pop stacks in parallel. Inf. Process. Lett. 109(12): 626-629 (2009) - 2008
- [j14]Robert Brignall, Sophie Huczynska, Vincent Vatter:
Decomposing simple permutations, with enumerative consequences. Comb. 28(4): 385-400 (2008) - [j13]Vincent Vatter:
A Sharp Bound for the Reconstruction of Partitions. Electron. J. Comb. 15(1) (2008) - [j12]Vincent Vatter:
Enumeration Schemes for Restricted Permutations. Comb. Probab. Comput. 17(1): 137-159 (2008) - [j11]Vincent Vatter:
Reconstructing compositions. Discret. Math. 308(9): 1524-1530 (2008) - [j10]Robert Brignall, Sophie Huczynska, Vincent Vatter:
Simple permutations and algebraic generating functions. J. Comb. Theory A 115(3): 423-441 (2008) - [j9]Robert Brignall, Nikola Ruskuc, Vincent Vatter:
Simple permutations: Decidability and unavoidable substructures. Theor. Comput. Sci. 391(1-2): 150-163 (2008) - 2006
- [j8]Sophie Huczynska, Vincent Vatter:
Grid Classes and the Fibonacci Dichotomy for Restricted Permutations. Electron. J. Comb. 13(1) (2006) - [j7]Goh Chee Ying, Khee Meng Koh, Bruce E. Sagan, Vincent R. Vatter:
Maximal independent sets in graphs with at most r cycles. J. Graph Theory 53(4): 270-282 (2006) - [j6]Bruce E. Sagan, Vincent R. Vatter:
Maximal and maximum independent sets in graphs with at most r cycles. J. Graph Theory 53(4): 283-314 (2006) - [j5]Vincent Vatter:
Finitely labeled generating trees and restricted permutations. J. Symb. Comput. 41(5): 559-572 (2006) - 2004
- [j4]Martin Hildebrand, Bruce E. Sagan, Vincent R. Vatter:
Bounding quantities related to the packing density of 1(ℓ+1)ℓ⋯2. Adv. Appl. Math. 33(3): 633-653 (2004) - 2002
- [j3]Miklós Bóna, Bruce E. Sagan, Vincent R. Vatter:
Pattern Frequency Sequences and Internal Zeros. Adv. Appl. Math. 28(3-4): 395-420 (2002) - [j2]Maximillian M. Murphy, Vincent R. Vatter:
Profile Classes and Partial Well-Order for Permutations. Electron. J. Comb. 9(2) (2002) - [j1]Vincent R. Vatter:
Permutations Avoiding Two Patterns of Length Three. Electron. J. Comb. 9(2) (2002)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-03 21:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
