We stand with Ukraine  

Miklós Bóna

Orcid: 0000-0002-8711-7281

According to our database1, Miklós Bóna authored at least 69 papers between 1993 and 2023.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Random plane increasing trees: Asymptotic enumeration of vertices by distance from leaves.
[BibTeX]
[DOI]
Miklós Bóna
,
Boris G. Pittel
Random Struct. Algorithms, August, 2023

Pattern Avoidance, Statistical Mechanics and Computational Complexity (Dagstuhl Seminar 23121).
[BibTeX]
[DOI]
David I. Bevan
,
Miklós Bóna
,
István Miklós
Dagstuhl Reports, March, 2023

Permutations avoiding sets of patterns with long monotone subsequences.
[BibTeX]
[DOI]
Miklós Bóna
,
Jay Pantone
J. Symb. Comput., 2023

2020
Supercritical sequences, and the nonrationality of most principal permutation classes.
[BibTeX]
[DOI]
Miklós Bóna
Eur. J. Comb., 2020

Stack words and a bound for 3-stack sortable permutations.
[BibTeX]
[DOI]
Miklós Bóna
Discret. Appl. Math., 2020

Pattern Avoiding Permutations with a Unique Longest Increasing Subsequence.
[BibTeX]
[DOI]
Miklós Bóna
,
Elijah DeJonge
Electron. J. Comb., 2020

A Method to Prove the Nonrationality of Some Combinatorial Generating Functions.
[BibTeX]
[DOI]
Miklós Bóna
Proceedings of the LATIN 2020: Theoretical Informatics, 2020

2019
Cyclic permutations avoiding pairs of patterns of length three.
[BibTeX]
[DOI]
Miklós Bóna
,
Michael Cory
Discret. Math. Theor. Comput. Sci., 2019

Pattern avoidance in permutations and their squares.
[BibTeX]
[DOI]
Miklós Bóna
,
Rebecca Smith
Discret. Math., 2019

Limiting Probabilities for Vertices of a Given Rank in 1-2 Trees.
[BibTeX]
[DOI]
Miklós Bóna
,
István Mezö
Electron. J. Comb., 2019

2018
Genomics, Pattern Avoidance, and Statistical Mechanics (Dagstuhl Seminar 18451).
[BibTeX]
[DOI]
Michael Albert
,
David I. Bevan
,
Miklós Bóna
,
István Miklós
Dagstuhl Reports, 2018

2017
On the cycle structure of the product of random maximal cycles.
[BibTeX]
[DOI]
Miklós Bóna
,
Boris G. Pittel
Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, 2017

2016
Symmetry in Sphere-Based Assembly Configuration Spaces.
[BibTeX]
[DOI]
Meera Sitharam
,
Andrew Vince
,
Menghan Wang
,
Miklós Bóna
Symmetry, 2016

Real zeros and partitions without singleton blocks.
[BibTeX]
[DOI]
Miklós Bóna
,
István Mezö
Eur. J. Comb., 2016

On the number of vertices of each rank in phylogenetic trees and their generalizations.
[BibTeX]
[DOI]
Miklós Bóna
Discret. Math. Theor. Comput. Sci., 2016

Pattern Avoidance and Genome Sorting (Dagstuhl Seminar 16071).
[BibTeX]
[DOI]
Michael Albert
,
Miklós Bóna
,
István Miklós
,
Einar Steingrímsson
Dagstuhl Reports, 2016

Pattern-avoiding involutions: exact and asymptotic enumeration.
[BibTeX]
[DOI]
Miklós Bóna
,
Cheyne Homberger
,
Jay Pantone
,
Vincent Vatter
Australas. J Comb., 2016

Introduction to Enumerative and Analytic Combinatorics, Second Edition.
[BibTeX]
Miklós Bóna
Discrete mathematics and its applications, CRC Press, ISBN: 978-1-48-224909-5, 2016

2014
Review of analytic combinatorics in several variables by Robin Pemantle and Mark Wilson.
[BibTeX]
[DOI]
Miklós Bóna
SIGACT News, 2014

On a Family of Conjectures of Joel Lewis on Alternating Permutations.
[BibTeX]
[DOI]
Miklós Bóna
Graphs Comb., 2014

A New Upper Bound for 1324-Avoiding Permutations.
[BibTeX]
[DOI]
Miklós Bóna
Comb. Probab. Comput., 2014

<i>k</i>-Protected vertices in binary search trees.
[BibTeX]
[DOI]
Miklós Bóna
Adv. Appl. Math., 2014

2013
Review of extremal combinatorics with applications to computer science (2nd edition) by Stasys Jukna.
[BibTeX]
[DOI]
Miklós Bóna
SIGACT News, 2013

Review of Bijective Combinatorics by Nicholas Loehr.
[BibTeX]
[DOI]
Miklós Bóna
SIGACT News, 2013

2012
Review of the life and times of the central limit theorem by William J. Adams.
[BibTeX]
[DOI]
Miklós Bóna
SIGACT News, 2012

The Number of Ways to Assemble a Graph.
[BibTeX]
[DOI]
Andrew Vince
,
Miklós Bóna
Electron. J. Comb., 2012

Surprising Symmetries in Objects Counted by Catalan Numbers.
[BibTeX]
[DOI]
Miklós Bóna
Electron. J. Comb., 2012

Combinatorics of Permutations, Second Edition.
[BibTeX]
Miklós Bóna
Discrete mathematics and its applications, CRC Press, ISBN: 978-1-43-985051-0, 2012

2011
Review of proofs from THE BOOK (4th edition) by Martin Aigner and Günter M. Ziegler.
[BibTeX]
[DOI]
Miklós Bóna
SIGACT News, 2011

Review of probability: theory and examples, 4th edition by Rick Durrett.
[BibTeX]
[DOI]
Miklós Bóna
SIGACT News, 2011

Review of applied combinatorics by Fred S. Roberts and Barry Tesman.
[BibTeX]
[DOI]
Miklós Bóna
SIGACT News, 2011

2010
A combinatorial approach to matrix theory and Its applications by Richard Brualdi and Dragos Cvetkovic, Published by Cambridge Press, 2009 824 pages, hardcover.
[BibTeX]
[DOI]
Miklós Bóna
SIGACT News, 2010

Analytic combinatorics by Philippe Flajolet and Robert Sedgewick, published by Cambridge Press, 2009 824 pages, hardcover.
[BibTeX]
[DOI]
Miklós Bóna
SIGACT News, 2010

The absence of a pattern and the occurrences of another.
[BibTeX]
[DOI]
Miklós Bóna
Discret. Math. Theor. Comput. Sci., 2010

2009
Review of Random graphs: (second edition) by Béla Bollobás.
[BibTeX]
[DOI]
Miklós Bóna
SIGACT News, 2009

Review of Algorithmic combinatorics on partial words by Francine Blanchet-Sadri.
[BibTeX]
[DOI]
Miklós Bóna
SIGACT News, 2009

Review of Combinatorics and graph theory: (second edition) by John M. Harris, Jeffry L. Hirst and Michael J. Mossinghoff.
[BibTeX]
[DOI]
Miklós Bóna
SIGACT News, 2009

Real Zeros and Normal Distribution for Statistics on Stirling Permutations Defined by Gessel and Stanley.
[BibTeX]
[DOI]
Miklós Bóna
SIAM J. Discret. Math., 2009

The average number of block interchanges needed to sort a permutation and a recent result of Stanley.
[BibTeX]
[DOI]
Miklós Bóna
,
Ryan Flynn
Inf. Process. Lett., 2009

On two related questions of Wilf concerning Standard Young Tableaux.
[BibTeX]
[DOI]
Miklós Bóna
Eur. J. Comb., 2009

2008
Combinatorics of permutations.
[BibTeX]
[DOI]
Miklós Bóna
SIGACT News, 2008

Where the monotone pattern (mostly) rules.
[BibTeX]
[DOI]
Miklós Bóna
Discret. Math., 2008

Generalized Descents and Normality.
[BibTeX]
[DOI]
Miklós Bóna
Electron. J. Comb., 2008

2007
New records in Stanley-Wilf limits.
[BibTeX]
[DOI]
Miklós Bóna
Eur. J. Comb., 2007

On the enumeration of certain weighted graphs.
[BibTeX]
[DOI]
Miklós Bóna
,
Hyeong-Kwan Ju
,
Ruriko Yoshida
Discret. Appl. Math., 2007

2006
On a Balanced Property of Derangements.
[BibTeX]
[DOI]
Miklós Bóna
Electron. J. Comb., 2006

Editor's Preface.
[BibTeX]
[DOI]
Miklós Bóna
Adv. Appl. Math., 2006

2005
The limit of a Stanley-Wilf sequence is not always rational, and layered patterns beat monotone patterns.
[BibTeX]
[DOI]
Miklós Bóna
J. Comb. Theory, Ser. A, 2005

A Combinatorial Proof of the Log-Concavity of a Famous Sequence Counting Permutations.
[BibTeX]
[DOI]
Miklós Bóna
Electron. J. Comb., 2005

Counting and Enumeration of Self-assembly pathways for Symmetric macromolecular Structures.
[BibTeX]
[DOI]
Meera Sitharam
,
Miklós Bóna
Proceedings of the Advances in Bioinformatics and Its Applications, 2005

2004
A simple proof for the exponential upper bound for some tenacious patterns.
[BibTeX]
[DOI]
Miklós Bóna
Adv. Appl. Math., 2004

2003
Two injective proofs of a conjecture of Simion.
[BibTeX]
[DOI]
Miklós Bóna
,
Bruce E. Sagan
J. Comb. Theory, Ser. A, 2003

2002
Symmetry and Unimodality in t-Stack Sortable Permutations.
[BibTeX]
[DOI]
Miklós Bóna
J. Comb. Theory, Ser. A, 2002

A Survey of Stack-Sorting Disciplines.
[BibTeX]
[DOI]
Miklós Bóna
Electron. J. Comb., 2002

Pattern Frequency Sequences and Internal Zeros.
[BibTeX]
[DOI]
Miklós Bóna
,
Bruce E. Sagan
,
Vincent R. Vatter
Adv. Appl. Math., 2002

A simplicial complex of 2-stack sortable permutations.
[BibTeX]
[DOI]
Miklós Bóna
Adv. Appl. Math., 2002

2000
Permutations with roots.
[BibTeX]
[DOI]
Miklós Bóna
,
Andrew McLennan
,
Dennis White
Random Struct. Algorithms, 2000

Combinatorial Proof of the Log-Concavity of the Numbers of Permutations with k Runs.
[BibTeX]
[DOI]
Miklós Bóna
,
Richard Ehrenborg
J. Comb. Theory, Ser. A, 2000

A self-dual poset on objects counted by the Catalan numbers and a type-B analogue.
[BibTeX]
[DOI]
Miklós Bóna
,
Rodica Simion
Discret. Math., 2000

Packing Ferrers Shapes.
[BibTeX]
[DOI]
Noga Alon
,
Miklós Bóna
,
Joel Spencer
Comb. Probab. Comput., 2000

An Infinite Antichain of Permutations.
[BibTeX]
[DOI]
Daniel A. Spielman
,
Miklós Bóna
Electron. J. Comb., 2000

Enumeration of <i>m</i>-Ary Cacti.
[BibTeX]
[DOI]
Miklós Bóna
,
Michel Bousquet
,
Gilbert Labelle
,
Pierre Leroux
Adv. Appl. Math., 2000

1999
The Solution of a Conjecture of Stanley and Wilf for All Layered Patterns.
[BibTeX]
[DOI]
Miklós Bóna
J. Comb. Theory, Ser. A, 1999

1998
Permutations with one or two 132-subsequences.
[BibTeX]
[DOI]
Miklós Bóna
Discret. Math., 1998

The Permutation Classes Equinumerous to the Smooth Class.
[BibTeX]
[DOI]
Miklós Bóna
Electron. J. Comb., 1998

1997
Exact Enumeration of 1342-Avoiding Permutations: A Close Link with Labeled Trees and Planar Maps.
[BibTeX]
[DOI]
Miklós Bóna
J. Comb. Theory, Ser. A, 1997

Permutations avoiding certain patterns: The case of length 4 and some generalizations.
[BibTeX]
[DOI]
Miklós Bóna
Discret. Math., 1997

1996
A Ramsey-type problem on right-angled triangles in space.
[BibTeX]
[DOI]
Miklós Bóna
,
Géza Tóth
Discret. Math., 1996

1993
A Euclidean Ramsey theorem.
[BibTeX]
[DOI]
Miklós Bóna
Discret. Math., 1993


  Loading...