Elisa Pergola

Lama Tarsissi

Algorithmica, March, 2023

A Heuristic for the P-time Reconstruction of Unique 3-Uniform Hypergraphs from their Degree Sequences.

[BibT_eX]

[DOI]

Proceedings of the 24th Italian Conference on Theoretical Computer Science, 2023

2021

On doubly symmetric Dyck words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

2019

Recurrence relations, succession rules and the positivity problem.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2019

Burrows-Wheeler Transform of Words Defined by Morphisms.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

2018

Graph Model Simulation of Human Brain's Functional Activity at Resting State by Means of the FD Model.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2018

2017

Pattern Avoiding Languages and Recurrence Relations Interpretation.

[BibT_eX]

[DOI]

Elisabetta Grazzini

Fundam. Informaticae, 2017

2016

Cross-bifix-free sets generation via Motzkin paths.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2016

2015

Enumeration of Two Particular Sets of Minimal Permutations.

[BibT_eX]

[DOI]

Elisabetta Grazzini

J. Integer Seq., 2015

2013

Generation and Enumeration of Some Classes of Interval Orders.

[BibT_eX]

[DOI]

Order, 2013

Recurrence relations versus succession rules

[BibT_eX]

[DOI]

CoRR, 2013

Avoiding cross-bifix-free binary words.

[BibT_eX]

[DOI]

Acta Informatica, 2013

2012

A New Approach to Cross-Bifix-Free Sets.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

Pattern 1j+10j Avoiding Binary Words.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2012

Generation of binary words avoiding alternating patterns

[BibT_eX]

[DOI]

CoRR, 2012

2011

Pattern 1^j0^i avoiding binary words

[BibT_eX]

[DOI]

Proceedings of the Proceedings 8th International Conference Words 2011, 2011

Binary words avoiding a pattern and marked succession rule

[BibT_eX]

[DOI]

CoRR, 2011

Some applications arising from the interactions between the theory of Catalan-like numbers and the ECO method.

[BibT_eX]

Ars Comb., 2011

2010

Posets and permutations in the duplication-loss model: Minimal permutations with d descents.

[BibT_eX]

[DOI]

Mathilde Bouvel

Theor. Comput. Sci., 2010

2007

A general exhaustive generation algorithm for Gray structures.

[BibT_eX]

[DOI]

Acta Informatica, 2007

2006

Non uniform random generation of generalized Motzkin paths.

[BibT_eX]

[DOI]

Srecko Brlek

Olivier Roques

Acta Informatica, 2006

2005

In memoriam: Alberto Del Lungo (1965-2003).

[BibT_eX]

[DOI]

Simone Rinaldi

Theor. Comput. Sci., 2005

Preface.

[BibT_eX]

[DOI]

Simone Rinaldi

Theor. Comput. Sci., 2005

On the equivalence problem for succession rules.

[BibT_eX]

[DOI]

Discret. Math., 2005

2004

Exhaustive generation of combinatorial objects by ECO.

[BibT_eX]

[DOI]

Acta Informatica, 2004

2003

Some bijective results about the area of Schröder paths.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Jumping succession rules and their generating functions.

[BibT_eX]

[DOI]

Discret. Math., 2003

Lattice path moments by cut and paste.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2003

2002

Approximating algebraic functions by means of rational ones.

[BibT_eX]

[DOI]

Simone Rinaldi

Theor. Comput. Sci., 2002

An algebraic characterization of the set of succession rules.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Stirling numbers interpolation using permutations with forbidden subsequences.

[BibT_eX]

[DOI]

Discret. Math., 2002

A Bijective Approach to the Area of Generalized Motzkin Paths.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2002

2001

Chemins de Schröder et hiérarchies aléatoires.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Two bijections for the area of Dyck paths.

[BibT_eX]

[DOI]

Discret. Math., 2001

Some permutations with forbidden subsequences and their inversion number.

[BibT_eX]

[DOI]

Discret. Math., 2001

A Bijection for Some Paths on the Slit Plane.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2001

2000

Permutations avoiding an increasing number of length-increasing forbidden subsequences.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2000

Enumeration of vexillary involutions which are equal to their mirror/complement.

[BibT_eX]

[DOI]

Olivier Guibert

Discret. Math., 2000

From Motzkin to Catalan permutations.

[BibT_eX]

[DOI]

Discret. Math., 2000

1999

Random Generation of Trees and Other Combinatorial Objects.

[BibT_eX]

[DOI]

Elena Barcucci

Alberto Del Lungo

Theor. Comput. Sci., 1999

Directed animals, forests and permutations.

[BibT_eX]

[DOI]

Discret. Math., 1999

A Combinatorial Interpretation of the Area of Schröder Paths.

[BibT_eX]

[DOI]