default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMiklós Bóna
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j61]Miklós Bóna
, Jay Pantone:
Permutations avoiding sets of patterns with long monotone subsequences. J. Symb. Comput. 116: 130-138 (2023)- [j60]Miklós Bóna, Boris G. Pittel:
Random plane increasing trees: Asymptotic enumeration of vertices by distance from leaves. Random Struct. Algorithms 63(1): 102-129 (2023) - [i3]David I. Bevan, Miklós Bóna, István Miklós:
Pattern Avoidance, Statistical Mechanics and Computational Complexity (Dagstuhl Seminar 23121). Dagstuhl Reports 13(3): 49-73 (2023) - 2020
- [j59]Miklós Bóna, Elijah DeJonge:
Pattern Avoiding Permutations with a Unique Longest Increasing Subsequence. Electron. J. Comb. 27(4): 4 (2020) - [j58]Miklós Bóna:
Stack words and a bound for 3-stack sortable permutations. Discret. Appl. Math. 284: 602-605 (2020) - [j57]Miklós Bóna:
Supercritical sequences, and the nonrationality of most principal permutation classes. Eur. J. Comb. 83 (2020) - [c3]Miklós Bóna:
A Method to Prove the Nonrationality of Some Combinatorial Generating Functions. LATIN 2020: 559-570
2010 – 2019
- 2019
- [j56]Miklós Bóna, István Mezö:
Limiting Probabilities for Vertices of a Given Rank in 1-2 Trees. Electron. J. Comb. 26(3): 3 (2019) - [j55]Miklós Bóna, Rebecca Smith:
Pattern avoidance in permutations and their squares. Discret. Math. 342(11): 3194-3200 (2019) - [j54]Miklós Bóna, Michael Cory:
Cyclic permutations avoiding pairs of patterns of length three. Discret. Math. Theor. Comput. Sci. 21(2) (2019) - 2018
- [i2]Michael Albert, David I. Bevan, Miklós Bóna, István Miklós:
Genomics, Pattern Avoidance, and Statistical Mechanics (Dagstuhl Seminar 18451). Dagstuhl Reports 8(11): 1-20 (2018) - 2017
- [c2]Miklós Bóna, Boris G. Pittel:
On the cycle structure of the product of random maximal cycles. ANALCO 2017: 1-15 - 2016
- [b2]Miklós Bóna:
Introduction to Enumerative and Analytic Combinatorics, Second Edition. Discrete mathematics and its applications, CRC Press 2016, ISBN 978-1-48-224909-5, pp. I-XXII, 1-534 - [j53]Miklós Bóna, Cheyne Homberger, Jay Pantone, Vincent Vatter:
Pattern-avoiding involutions: exact and asymptotic enumeration. Australas. J Comb. 64: 88-119 (2016) - [j52]Miklós Bóna:
On the number of vertices of each rank in phylogenetic trees and their generalizations. Discret. Math. Theor. Comput. Sci. 18(3) (2016) - [j51]Miklós Bóna, István Mezö:
Real zeros and partitions without singleton blocks. Eur. J. Comb. 51: 500-510 (2016) - [j50]Meera Sitharam, Andrew Vince, Menghan Wang, Miklós Bóna:
Symmetry in Sphere-Based Assembly Configuration Spaces. Symmetry 8(1): 5 (2016) - [i1]Michael Albert, Miklós Bóna, István Miklós, Einar Steingrímsson:
Pattern Avoidance and Genome Sorting (Dagstuhl Seminar 16071). Dagstuhl Reports 6(2): 65-77 (2016) - 2014
- [j49]Miklós Bóna:
k-Protected vertices in binary search trees. Adv. Appl. Math. 53: 1-11 (2014) - [j48]Miklós Bóna:
A New Upper Bound for 1324-Avoiding Permutations. Comb. Probab. Comput. 23(5): 717-724 (2014) - [j47]Miklós Bóna:
On a Family of Conjectures of Joel Lewis on Alternating Permutations. Graphs Comb. 30(3): 521-526 (2014) - [j46]Miklós Bóna:
Review of analytic combinatorics in several variables by Robin Pemantle and Mark Wilson. SIGACT News 45(3): 32-33 (2014) - 2013
- [j45]Miklós Bóna:
Review of Bijective Combinatorics by Nicholas Loehr. SIGACT News 44(1): 12-14 (2013) - [j44]Miklós Bóna:
Review of extremal combinatorics with applications to computer science (2nd edition) by Stasys Jukna. SIGACT News 44(3): 24-27 (2013) - [c1]Miklós Bóna, Andrew Vince:
The number of ways to assemble a graph. ANALCO 2013: 8-17 - 2012
- [b1]Miklós Bóna:
Combinatorics of Permutations, Second Edition. Discrete mathematics and its applications, CRC Press 2012, ISBN 978-1-43-985051-0, pp. 1-458 - [j43]Miklós Bóna:
Surprising Symmetries in Objects Counted by Catalan Numbers. Electron. J. Comb. 19(1): 62 (2012) - [j42]Andrew Vince, Miklós Bóna:
The Number of Ways to Assemble a Graph. Electron. J. Comb. 19(4): 54 (2012) - [j41]Miklós Bóna:
Review of the life and times of the central limit theorem by William J. Adams. SIGACT News 43(1): 32-33 (2012) - 2011
- [j40]Miklós Bóna:
Review of applied combinatorics by Fred S. Roberts and Barry Tesman. SIGACT News 42(3): 32-34 (2011) - [j39]Miklós Bóna:
Review of probability: theory and examples, 4th edition by Rick Durrett. SIGACT News 42(3): 42-45 (2011) - [j38]Miklós Bóna:
Review of proofs from THE BOOK (4th edition) by Martin Aigner and Günter M. Ziegler. SIGACT News 42(4): 32-37 (2011) - 2010
- [j37]Miklós Bóna:
The absence of a pattern and the occurrences of another. Discret. Math. Theor. Comput. Sci. 12(2): 89-102 (2010) - [j36]Miklós Bóna:
Analytic combinatorics by Philippe Flajolet and Robert Sedgewick, published by Cambridge Press, 2009 824 pages, hardcover. SIGACT News 41(2): 11-14 (2010) - [j35]Miklós Bóna:
A combinatorial approach to matrix theory and Its applications by Richard Brualdi and Dragos Cvetkovic, Published by Cambridge Press, 2009 824 pages, hardcover. SIGACT News 41(2): 19-22 (2010)
2000 – 2009
- 2009
- [j34]Miklós Bóna:
On two related questions of Wilf concerning Standard Young Tableaux. Eur. J. Comb. 30(5): 1318-1322 (2009) - [j33]Miklós Bóna, Ryan Flynn:
The average number of block interchanges needed to sort a permutation and a recent result of Stanley. Inf. Process. Lett. 109(16): 927-931 (2009) - [j32]Miklós Bóna:
Real Zeros and Normal Distribution for Statistics on Stirling Permutations Defined by Gessel and Stanley. SIAM J. Discret. Math. 23(1): 401-406 (2009) - [j31]Miklós Bóna:
Review of Combinatorics and graph theory: (second edition) by John M. Harris, Jeffry L. Hirst and Michael J. Mossinghoff. SIGACT News 40(3): 37-39 (2009) - [j30]Miklós Bóna:
Review of Algorithmic combinatorics on partial words by Francine Blanchet-Sadri. SIGACT News 40(3): 39-41 (2009) - [j29]Miklós Bóna:
Review of Random graphs: (second edition) by Béla Bollobás. SIGACT News 40(3): 46-48 (2009) - 2008
- [j28]Miklós Bóna:
Generalized Descents and Normality. Electron. J. Comb. 15(1) (2008) - [j27]Miklós Bóna:
Where the monotone pattern (mostly) rules. Discret. Math. 308(23): 5782-5788 (2008) - [j26]Miklós Bóna:
Combinatorics of permutations. SIGACT News 39(4): 21-25 (2008) - 2007
- [j25]Miklós Bóna, Hyeong-Kwan Ju, Ruriko Yoshida:
On the enumeration of certain weighted graphs. Discret. Appl. Math. 155(11): 1481-1496 (2007) - [j24]Miklós Bóna:
New records in Stanley-Wilf limits. Eur. J. Comb. 28(1): 75-85 (2007) - 2006
- [j23]Miklós Bóna:
Editor's Preface. Adv. Appl. Math. 36(2): 95 (2006) - [j22]Miklós Bóna:
On a Balanced Property of Derangements. Electron. J. Comb. 13(1) (2006) - 2005
- [j21]Miklós Bóna:
A Combinatorial Proof of the Log-Concavity of a Famous Sequence Counting Permutations. Electron. J. Comb. 11(2) (2005) - [j20]Miklós Bóna:
The limit of a Stanley-Wilf sequence is not always rational, and layered patterns beat monotone patterns. J. Comb. Theory A 110(2): 223-235 (2005) - [p1]Meera Sitharam, Miklós Bóna:
Counting and Enumeration of Self-assembly pathways for Symmetric macromolecular Structures. Advances in Bioinformatics and Its Applications 2005 - 2004
- [j19]Miklós Bóna:
A simple proof for the exponential upper bound for some tenacious patterns. Adv. Appl. Math. 33(1): 192-198 (2004) - 2003
- [j18]Miklós Bóna, Bruce E. Sagan:
Two injective proofs of a conjecture of Simion. J. Comb. Theory A 102(1): 212-216 (2003) - 2002
- [j17]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) - [j16]Miklós Bóna:
A simplicial complex of 2-stack sortable permutations. Adv. Appl. Math. 29(4): 499-508 (2002) - [j15]Miklós Bóna:
A Survey of Stack-Sorting Disciplines. Electron. J. Comb. 9(2) (2002) - [j14]Miklós Bóna:
Symmetry and Unimodality in t-Stack Sortable Permutations. J. Comb. Theory A 98(1): 201-209 (2002) - 2000
- [j13]Miklós Bóna, Michel Bousquet, Gilbert Labelle, Pierre Leroux:
Enumeration of m-Ary Cacti. Adv. Appl. Math. 24(1): 22-56 (2000) - [j12]Daniel A. Spielman, Miklós Bóna:
An Infinite Antichain of Permutations. Electron. J. Comb. 7 (2000) - [j11]Noga Alon, Miklós Bóna, Joel Spencer:
Packing Ferrers Shapes. Comb. Probab. Comput. 9(3): 205-211 (2000) - [j10]Miklós Bóna, Rodica Simion:
A self-dual poset on objects counted by the Catalan numbers and a type-B analogue. Discret. Math. 220(1-3): 35-49 (2000) - [j9]Miklós Bóna, Richard Ehrenborg:
Combinatorial Proof of the Log-Concavity of the Numbers of Permutations with k Runs. J. Comb. Theory A 90(2): 293-303 (2000) - [j8]Miklós Bóna, Andrew McLennan, Dennis White:
Permutations with roots. Random Struct. Algorithms 17(2): 157-167 (2000)
1990 – 1999
- 1999
- [j7]Miklós Bóna:
The Solution of a Conjecture of Stanley and Wilf for All Layered Patterns. J. Comb. Theory A 85(1): 96-104 (1999) - 1998
- [j6]Miklós Bóna:
The Permutation Classes Equinumerous to the Smooth Class. Electron. J. Comb. 5 (1998) - [j5]Miklós Bóna:
Permutations with one or two 132-subsequences. Discret. Math. 181(1-3): 267-274 (1998) - 1997
- [j4]Miklós Bóna:
Permutations avoiding certain patterns: The case of length 4 and some generalizations. Discret. Math. 175(1-3): 55-67 (1997) - [j3]Miklós Bóna:
Exact Enumeration of 1342-Avoiding Permutations: A Close Link with Labeled Trees and Planar Maps. J. Comb. Theory A 80(2): 257-272 (1997) - 1996
- [j2]Miklós Bóna, Géza Tóth:
A Ramsey-type problem on right-angled triangles in space. Discret. Math. 150(1-3): 61-67 (1996) - 1993
- [j1]Miklós Bóna:
A Euclidean Ramsey theorem. Discret. Math. 122(1-3): 349-352 (1993)
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-06-10 20:28 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:
