Sara Brunetti

Orcid: 0000-0001-8607-6900

According to our database1, Sara Brunetti authored at least 47 papers between 1998 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Post-hoc evaluation of nodes influence in information cascades: the case of coordinated accounts.
CoRR, 2024

A Discrete Geometry Method for Atom Depth Computation in Complex Molecular Systems.
Proceedings of the Discrete Geometry and Mathematical Morphology, 2024

2020
A Measure of Q-convexity for Shape Analysis.
J. Math. Imaging Vis., 2020

Uniqueness Results for Grey Scale Digital Images.
Fundam. Informaticae, 2020

2019
A Q-Convexity Vector Descriptor for Image Analysis.
J. Math. Imaging Vis., 2019

A Spatial Convexity Descriptor for Object Enlacement.
Proceedings of the Discrete Geometry for Computer Imagery, 2019

2018
Preface.
Fundam. Informaticae, 2018

2017
Multi-level dynamo and opinion spreading.
Math. Struct. Comput. Sci., 2017

Extension of a One-Dimensional Convexity Measure to Two Dimensions.
Proceedings of the Combinatorial Image Analysis - 18th International Workshop, 2017

A New Shape Descriptor Based on a Q-convexity Measure.
Proceedings of the Discrete Geometry for Computer Imagery, 2017

2016
On bounded additivity in discrete tomography.
Theor. Comput. Sci., 2016

On J-additivity and Bounded Additivity.
Fundam. Informaticae, 2016

A Measure of Q-Convexity.
Proceedings of the Discrete Geometry for Computer Imagery, 2016

2015
An inclusion hierarchy of irreversible dynamos.
Theor. Comput. Sci., 2015

Ghosts in Discrete Tomography.
J. Math. Imaging Vis., 2015

Discrete Tomography determination of bounded sets in Z<sup>n</sup>.
Discret. Appl. Math., 2015

MeDuSa: a multi-draft based scaffolder.
Bioinform., 2015

2014
Non-additive Bounded Sets of Uniqueness in ℤ n.
Proceedings of the Discrete Geometry for Computer Imagery, 2014

2013
Discrete tomography determination of bounded lattice sets from four X-rays.
Discret. Appl. Math., 2013

Explicit determination of bounded non-additive sets of uniqueness for four X-rays.
Proceedings of the 8th International Symposium on Image and Signal Processing and Analysis, 2013

On the Non-additive Sets of Uniqueness in a Finite Grid.
Proceedings of the Discrete Geometry for Computer Imagery, 2013

2012
Minimum Weight Dynamo and Fast Opinion Spreading
CoRR, 2012

Minimum Weight Dynamo and Fast Opinion Spreading - (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

2011
Dynamic Monopolies in Colored Tori.
Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

Characterization of { - 1, 0, + 1} Valued Functions in Discrete Tomography under Sets of Four Directions.
Proceedings of the Discrete Geometry for Computer Imagery, 2011

2010
Multicolored Dynamos on Toroidal Meshes
CoRR, 2010

2008
On the reconstruction of binary and permutation matrices under (binary) tomographic constraints.
Theor. Comput. Sci., 2008

Reconstruction of convex lattice sets from tomographic projections in quartic time.
Theor. Comput. Sci., 2008

PARPST: a PARallel algorithm to find peptide sequence tags.
BMC Bioinform., 2008

2007
Stability results for the reconstruction of binary pictures from two projections.
Image Vis. Comput., 2007

A parallel algorithm for de novo peptide sequencing.
BMC Syst. Biol., 2007

2006
Fast Filling Operations Used in the Reconstruction of Convex Lattice Sets.
Proceedings of the Discrete Geometry for Computer Imagery, 13th International Conference, 2006

2005
Random generation of Q-convex sets.
Theor. Comput. Sci., 2005

Reconstructing a binary matrix under timetabling constraints.
Electron. Notes Discret. Math., 2005

Determination of Q-convex bodies by X-rays.
Electron. Notes Discret. Math., 2005

Stability in Discrete Tomography: some positive results.
Discret. Appl. Math., 2005

On the Stability of Reconstructing Lattice Sets from X-rays Along Two Directions.
Proceedings of the Discrete Geometry for Computer Imagery, 12th International Conference, 2005

2004
On the polynomial 1[n]<sub>q</sub>nk<sub>q</sub>.
Adv. Appl. Math., 2004

2003
An algorithm reconstructing convex lattice sets.
Theor. Comput. Sci., 2003

Stability in Discrete Tomography: Linear Programming, Additivity and Convexity.
Proceedings of the Discrete Geometry for Computer Imagery, 11th International Conference, 2003

2002
A cycle lemma for permutation inversions.
Discret. Math., 2002

2001
Reconstruction of lattice sets from their horizontal, vertical and diagonal X-rays.
Discret. Math., 2001

An Equipartition Property for the Distribution of Multiset Permutation Inversions.
Adv. Appl. Math., 2001

2000
Succession rules and deco polyominoes.
RAIRO Theor. Informatics Appl., 2000

An Algorithm for Reconstructing Special Lattice Sets from Their Approximate X-Rays.
Proceedings of the Discrete Geometry for Computer Imagery, 9th International Conference, 2000

Reconstruction of Discrete Sets from Three or More X-Rays.
Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000

1998
A combinatorial interpretation of the recurrence f<sub>n+1</sub> = 6f<sub>n</sub> - f<sub>n-1</sub>.
Discret. Math., 1998


  Loading...