 | 2009 |
|---|
| 22 |       | 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) |
| 2008 |
|---|
| 21 | | Miklós Bóna:
Where the monotone pattern (mostly) rules.
Discrete Mathematics 308(23): 5782-5788 (2008) |
| 20 | | Miklós Bóna:
Combinatorics of permutations.
SIGACT News 39(4): 21-25 (2008) |
| 2007 |
|---|
| 19 | | Miklós Bóna,
Hyeong-Kwan Ju,
Ruriko Yoshida:
On the enumeration of certain weighted graphs.
Discrete Applied Mathematics 155(11): 1481-1496 (2007) |
| 18 | | Miklós Bóna:
New records in Stanley-Wilf limits.
Eur. J. Comb. 28(1): 75-85 (2007) |
| 2006 |
|---|
| 17 | | Miklós Bóna:
On a Balanced Property of Derangements.
Electr. J. Comb. 13(1): (2006) |
| 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): (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) |
