Analytic combinatorics aims to enable precise quantitative predictions of the properties of
large combinatorial structures. The theory has emerged over recent decades as essential …

This book is a revised version of my 2005 thesis [71] for the degree of Doctor of Philosophy
at the Royal Institute of Technology (KTH) in Stockholm. The whole idea of writing a …

This article proposes a surprisingly simple framework for the random generation of
combinatorial configurations based on what we call Boltzmann models. The idea is to …

Abstract In a 1972 paper, Germain Kreweras investigated noncrossing partitions under the
refinement order relation. His paper set the stage both for a wealth of further enumerative …

In this paper we study the distribution of the number of occurrences of a permutation σ as a
subword among all permutations in S n. We solve the problem in several cases depending …

A Horizontal Visibility Graph (HVG) is defined in association with an ordered set of non-
negative reals. HVGs realize a methodology in the analysis of time series, their degree …

We review results concerning edge flips in planar graphs concentrating mainly on various
aspects of the following problem: Given two different planar graphs of the same size, how …

We introduce the notion of quadri-algebras. These are associative algebras for which the
multiplication can be decomposed as the sum of four operations in a certain coherent …

We study the coefficients of algebraic functions∑ n≥ 0fnzn. First, we recall the too-little-
known fact that these coefficients fn always admit a closed form. Then we study their …

We show that the number gn of labelled series–parallel graphs on n vertices is
asymptotically gn∼ g⋅ n− 5/2γnn!, where γ and g are explicit computable constants. We …