 | 2012 |
|---|
| 36 |       | 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 |
|---|
| 35 | | Miklós Bóna:
Review of applied combinatorics by Fred S. Roberts and Barry Tesman.
SIGACT News 42(3): 32-34 (2011) |
| 34 | | Miklós Bóna:
Review of probability: theory and examples, 4th edition by Rick Durrett.
SIGACT News 42(3): 42-45 (2011) |
| 33 | | 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 |
|---|
| 32 | | Miklós Bóna:
The absence of a pattern and the occurrences of another.
Discrete Mathematics & Theoretical Computer Science 12(2): 89-102 (2010) |
| 31 | | 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) |
| 30 | | 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) |
| 2009 |
|---|
| 29 | | Miklós Bóna:
On two related questions of Wilf concerning Standard Young Tableaux.
Eur. J. Comb. 30(5): 1318-1322 (2009) |
| 28 | | 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) |
| 27 | | Miklós Bóna:
Real Zeros and Normal Distribution for Statistics on Stirling Permutations Defined by Gessel and Stanley.
SIAM J. Discrete Math. 23(1): 401-406 (2009) |
| 26 | | 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) |
| 25 | | Miklós Bóna:
Review of Algorithmic combinatorics on partial words by Francine Blanchet-Sadri.
SIGACT News 40(3): 39-41 (2009) |
| 24 | | Miklós Bóna:
Review of Random graphs: (second edition) by Béla Bollobás.
SIGACT News 40(3): 46-48 (2009) |
| 2008 |
|---|
| 23 | | Miklós Bóna:
Where the monotone pattern (mostly) rules.
Discrete Mathematics 308(23): 5782-5788 (2008) |
| 22 | | Miklós Bóna:
Generalized Descents and Normality.
Electr. J. Comb. 15(1): (2008) |
| 21 | | Miklós Bóna:
Combinatorics of permutations.
SIGACT News 39(4): 21-25 (2008) |
| 2007 |
|---|
| 20 | | Miklós Bóna,
Hyeong-Kwan Ju,
Ruriko Yoshida:
On the enumeration of certain weighted graphs.
Discrete Applied Mathematics 155(11): 1481-1496 (2007) |
| 19 | | Miklós Bóna:
New records in Stanley-Wilf limits.
Eur. J. Comb. 28(1): 75-85 (2007) |
| 2006 |
|---|
| 18 | | Miklós Bóna:
On a Balanced Property of Derangements.
Electr. J. Comb. 13(1): (2006) |
| 2005 |
|---|
| 17 | | Miklós Bóna:
A Combinatorial Proof of the Log-Concavity of a Famous Sequence Counting Permutations.
Electr. J. Comb. 11(2): (2005) |
| 16 | | Miklós Bóna:
The limit of a Stanley-Wilf sequence is not always rational, and layered patterns beat monotone patterns.
J. Comb. Theory, Ser. A 110(2): 223-235 (2005) |
| 2003 |
|---|
| 15 | | Miklós Bóna,
Bruce E. Sagan:
Two injective proofs of a conjecture of Simion.
J. Comb. Theory, Ser. A 102(1): 212-216 (2003) |
| 2002 |
|---|
| 14 | | Miklós Bóna:
A Survey of Stack-Sorting Disciplines.
Electr. J. Comb. on(2): (2002) |
| 13 | | Miklós Bóna:
Symmetry and Unimodality in t-Stack Sortable Permutations.
J. Comb. Theory, Ser. A 98(1): 201-209 (2002) |
| 2000 |
|---|
| 12 | | Noga Alon,
Miklós Bóna,
Joel Spencer:
Packing Ferrers Shapes.
Combinatorics, Probability & Computing 9(3): 205-211 (2000) |
| 11 | | Miklós Bóna,
Rodica Simion:
A self-dual poset on objects counted by the Catalan numbers and a type-B analogue.
Discrete Mathematics 220(1-3): 35-49 (2000) |
| 10 | | Daniel A. Spielman,
Miklós Bóna:
An Infinite Antichain of Permutations.
Electr. J. Comb. 7: (2000) |
| 9 | | Miklós Bóna,
Richard Ehrenborg:
Combinatorial Proof of the Log-Concavity of the Numbers of Permutations with k Runs.
J. Comb. Theory, Ser. A 90(2): 293-303 (2000) |
| 8 | | Miklós Bóna,
Andrew McLennan,
Dennis White:
Permutations with roots.
Random Struct. Algorithms 17(2): 157-167 (2000) |
| 1999 |
|---|
| 7 | | Miklós Bóna:
The Solution of a Conjecture of Stanley and Wilf for All Layered Patterns.
J. Comb. Theory, Ser. A 85(1): 96-104 (1999) |
| 1998 |
|---|
| 6 | | Miklós Bóna:
Permutations with one or two 132-subsequences.
Discrete Mathematics 181(1-3): 267-274 (1998) |
| 5 | | Miklós Bóna:
The Permutation Classes Equinumerous to the Smooth Class.
Electr. J. Comb. 5: (1998) |
| 1997 |
|---|
| 4 | | Miklós Bóna:
Permutations avoiding certain patterns: The case of length 4 and some generalizations.
Discrete Mathematics 175(1-3): 55-67 (1997) |
| 3 | | Miklós Bóna:
Exact Enumeration of 1342-Avoiding Permutations: A Close Link with Labeled Trees and Planar Maps.
J. Comb. Theory, Ser. A 80(2): 257-272 (1997) |
| 1996 |
|---|
| 2 | | Miklós Bóna,
Géza Tóth:
A Ramsey-type problem on right-angled triangles in space.
Discrete Mathematics 150(1-3): 61-67 (1996) |
| 1993 |
|---|
| 1 | | Miklós Bóna:
A Euclidean Ramsey theorem.
Discrete Mathematics 122(1-3): 349-352 (1993) |
Data released under the ODC-BY 1.0 license — See also our legal information page