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.
Random Struct. Algorithms, August, 2023

Pattern Avoidance, Statistical Mechanics and Computational Complexity (Dagstuhl Seminar 23121).
Dagstuhl Reports, March, 2023

Permutations avoiding sets of patterns with long monotone subsequences.
J. Symb. Comput., 2023

2020
Supercritical sequences, and the nonrationality of most principal permutation classes.
Eur. J. Comb., 2020

Stack words and a bound for 3-stack sortable permutations.
Discret. Appl. Math., 2020

Pattern Avoiding Permutations with a Unique Longest Increasing Subsequence.
Electron. J. Comb., 2020

A Method to Prove the Nonrationality of Some Combinatorial Generating Functions.
Proceedings of the LATIN 2020: Theoretical Informatics, 2020

2019
Cyclic permutations avoiding pairs of patterns of length three.
Discret. Math. Theor. Comput. Sci., 2019

Pattern avoidance in permutations and their squares.
Discret. Math., 2019

Limiting Probabilities for Vertices of a Given Rank in 1-2 Trees.
Electron. J. Comb., 2019

2018
Genomics, Pattern Avoidance, and Statistical Mechanics (Dagstuhl Seminar 18451).
Dagstuhl Reports, 2018

2017
On the cycle structure of the product of random maximal cycles.
Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, 2017

2016
Symmetry in Sphere-Based Assembly Configuration Spaces.
Symmetry, 2016

Real zeros and partitions without singleton blocks.
Eur. J. Comb., 2016

On the number of vertices of each rank in phylogenetic trees and their generalizations.
Discret. Math. Theor. Comput. Sci., 2016

Pattern Avoidance and Genome Sorting (Dagstuhl Seminar 16071).
Dagstuhl Reports, 2016

Pattern-avoiding involutions: exact and asymptotic enumeration.
Australas. J Comb., 2016

Introduction to Enumerative and Analytic Combinatorics, Second Edition.
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.
SIGACT News, 2014

On a Family of Conjectures of Joel Lewis on Alternating Permutations.
Graphs Comb., 2014

A New Upper Bound for 1324-Avoiding Permutations.
Comb. Probab. Comput., 2014

<i>k</i>-Protected vertices in binary search trees.
Adv. Appl. Math., 2014

2013
Review of extremal combinatorics with applications to computer science (2nd edition) by Stasys Jukna.
SIGACT News, 2013

Review of Bijective Combinatorics by Nicholas Loehr.
SIGACT News, 2013

2012
Review of the life and times of the central limit theorem by William J. Adams.
SIGACT News, 2012

The Number of Ways to Assemble a Graph.
Electron. J. Comb., 2012

Surprising Symmetries in Objects Counted by Catalan Numbers.
Electron. J. Comb., 2012

Combinatorics of Permutations, Second Edition.
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.
SIGACT News, 2011

Review of probability: theory and examples, 4th edition by Rick Durrett.
SIGACT News, 2011

Review of applied combinatorics by Fred S. Roberts and Barry Tesman.
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.
SIGACT News, 2010

Analytic combinatorics by Philippe Flajolet and Robert Sedgewick, published by Cambridge Press, 2009 824 pages, hardcover.
SIGACT News, 2010

The absence of a pattern and the occurrences of another.
Discret. Math. Theor. Comput. Sci., 2010

2009
Review of Random graphs: (second edition) by Béla Bollobás.
SIGACT News, 2009

Review of Algorithmic combinatorics on partial words by Francine Blanchet-Sadri.
SIGACT News, 2009

Review of Combinatorics and graph theory: (second edition) by John M. Harris, Jeffry L. Hirst and Michael J. Mossinghoff.
SIGACT News, 2009

Real Zeros and Normal Distribution for Statistics on Stirling Permutations Defined by Gessel and Stanley.
SIAM J. Discret. Math., 2009

The average number of block interchanges needed to sort a permutation and a recent result of Stanley.
Inf. Process. Lett., 2009

On two related questions of Wilf concerning Standard Young Tableaux.
Eur. J. Comb., 2009

2008
Combinatorics of permutations.
SIGACT News, 2008

Where the monotone pattern (mostly) rules.
Discret. Math., 2008

Generalized Descents and Normality.
Electron. J. Comb., 2008

2007
New records in Stanley-Wilf limits.
Eur. J. Comb., 2007

On the enumeration of certain weighted graphs.
Discret. Appl. Math., 2007

2006
On a Balanced Property of Derangements.
Electron. J. Comb., 2006

Editor's Preface.
Adv. Appl. Math., 2006

2005
The limit of a Stanley-Wilf sequence is not always rational, and layered patterns beat monotone patterns.
J. Comb. Theory A, 2005

A Combinatorial Proof of the Log-Concavity of a Famous Sequence Counting Permutations.
Electron. J. Comb., 2005

Counting and Enumeration of Self-assembly pathways for Symmetric macromolecular Structures.
Proceedings of the Advances in Bioinformatics and Its Applications, 2005

2004
A simple proof for the exponential upper bound for some tenacious patterns.
Adv. Appl. Math., 2004

2003
Two injective proofs of a conjecture of Simion.
J. Comb. Theory A, 2003

2002
Symmetry and Unimodality in t-Stack Sortable Permutations.
J. Comb. Theory A, 2002

A Survey of Stack-Sorting Disciplines.
Electron. J. Comb., 2002

Pattern Frequency Sequences and Internal Zeros.
Adv. Appl. Math., 2002

A simplicial complex of 2-stack sortable permutations.
Adv. Appl. Math., 2002

2000
Permutations with roots.
Random Struct. Algorithms, 2000

Combinatorial Proof of the Log-Concavity of the Numbers of Permutations with k Runs.
J. Comb. Theory A, 2000

A self-dual poset on objects counted by the Catalan numbers and a type-B analogue.
Discret. Math., 2000

Packing Ferrers Shapes.
Comb. Probab. Comput., 2000

An Infinite Antichain of Permutations.
Electron. J. Comb., 2000

Enumeration of <i>m</i>-Ary Cacti.
Adv. Appl. Math., 2000

1999
The Solution of a Conjecture of Stanley and Wilf for All Layered Patterns.
J. Comb. Theory A, 1999

1998
Permutations with one or two 132-subsequences.
Discret. Math., 1998

The Permutation Classes Equinumerous to the Smooth Class.
Electron. J. Comb., 1998

1997
Exact Enumeration of 1342-Avoiding Permutations: A Close Link with Labeled Trees and Planar Maps.
J. Comb. Theory A, 1997

Permutations avoiding certain patterns: The case of length 4 and some generalizations.
Discret. Math., 1997

1996
A Ramsey-type problem on right-angled triangles in space.
Discret. Math., 1996

1993
A Euclidean Ramsey theorem.
Discret. Math., 1993


  Loading...