Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[3]
Hilfe
Suche: Author="Barcucci, Elena"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Generalized Schröder permutations
Elena Barcucci
,
Vincent Vajnovszki
Theoretical Computer Science
502
, 2013, pp. 210-216
Exhaustive generation of combinatorial objects by ECO
Silvia Bacchelli
,
Elena Barcucci
,
Elisabetta Grazzini
,
Elisa Pergola
Acta Informatica
40
(8), 2004, pp. 585-602
Reconstruction of discrete sets from three or more X-rays
Elena Barcucci
,
Sara Brunetti
,
Alberto Del Lungo
,
Maurice Nivat
Lecture Notes in Computer Science
1767
, 2000, pp. 199-210
Permutations avoiding an increasing number of length-increasing forbidden subsequences
Elena Barcucci
,
Alberto del Lungo
,
Elisa Pergola
,
Renzo Pinzani
Discrete Mathematics and Theoretical Computer Science
4
(1), 2000, pp. 31-44
Random generation of trees and other combinatorial objects
Elena Barcucci
,
Alberto del Lungo
,
Elisa Pergola
Theoretical Computer Science
218
(2), 1999, pp. 219-232
Reconstruction convex polyominoes from horizontal and vertical projections II
Elena Barcucci
,
Alberto Del Lungo
,
Maurice Nivat
,
Renzo Pinzani
Lecture Notes in Computer Science
1176
, 1996, pp. 295-306
Polyominoes defined by their vertical and horizontal projections
Elena Barcucci
,
Alberto Del Lungo
,
Renzo Pinzani
,
Renzo Sprugnoli
Theoretical Computer Science
159
(1), 1996, pp. 129-136
"Deco" polyominoes, permutations and random generation
Elena Barcucci
,
Alberto Del Lungo
,
Renzo Pinzani
Theoretical Computer Science
159
(1), 1996, pp. 29-42
A construction for enumerating
k
-coloured Motzkin paths
Elena Barcucci
,
Alberto Del-Lungo
,
Elisa Pergola
,
Renzo Pinzani
Lecture Notes in Computer Science
959
, 1995, pp. 254-263