Andrea Frosini

According to our database1, Andrea Frosini authored at least 57 papers between 2002 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition.
Proceedings of the Discrete Geometry for Computer Imagery, 2019

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

Preface.
Fundam. Inform., 2018

2017
Permutation classes and polyomino classes with excluded submatrices.
Mathematical Structures in Computer Science, 2017

Regions of Uniqueness Quickly Reconstructed by Three Directions in Discrete Tomography.
Fundam. Inform., 2017

Preface.
Fundam. Inform., 2017

Ambiguity Results in the Characterization of hv-convex Polyominoes from Projections.
Proceedings of the Discrete Geometry for Computer Imagery, 2017

First Steps in the Algorithmic Reconstruction of Digital Convex Sets.
Proceedings of the Combinatorics on Words - 11th International Conference, 2017

2016
Advances in Discrete Geometry for Computer Imagery: Preface.
Theor. Comput. Sci., 2016

Geometric properties of matrices induced by pattern avoidance.
Theor. Comput. Sci., 2016

Reconstructing binary matrices with timetabling constraints.
J. Discrete Algorithms, 2016

Preface.
Fundam. Inform., 2016

Geometrical Characterization of the Uniqueness Regions Under Special Sets of Three Directions in Discrete Tomography.
Proceedings of the Discrete Geometry for Computer Imagery, 2016

A Tomographical Interpretation of a Sufficient Condition on h-Graphical Sequences.
Proceedings of the Discrete Geometry for Computer Imagery, 2016

2015
The Identity Transform of a Permutation and its Applications.
Fundam. Inform., 2015

2014
Preface.
Fundam. Inform., 2014

Uniqueness Regions under Sets of Generic Projections in Discrete Tomography.
Proceedings of the Discrete Geometry for Computer Imagery, 2014

Binary Pictures with Excluded Patterns.
Proceedings of the Discrete Geometry for Computer Imagery, 2014

2013
Enumeration of 4-stack polyominoes.
Theor. Comput. Sci., 2013

A tiling system for the class of L-convex polyominoes.
Theor. Comput. Sci., 2013

Preface.
Fundam. Inform., 2013

On the shape of permutomino tiles.
Discrete Applied Mathematics, 2013

A decomposition theorem for homogeneous sets with respect to diamond probes.
Computer Vision and Image Understanding, 2013

On the Degree Sequences of Uniform Hypergraphs.
Proceedings of the Discrete Geometry for Computer Imagery, 2013

How to Decompose a Binary Matrix into Three hv-convex Polyominoes.
Proceedings of the Discrete Geometry for Computer Imagery, 2013

2011
A reconstruction algorithm for a subclass of instances of the 2-color problem.
Theor. Comput. Sci., 2011

Planar Configurations Induced by Exact Polyominoes.
Proceedings of the Combinatorial Image Analysis - 14th International Workshop, 2011

Solving the Two Color Problem: An Heuristic Algorithm.
Proceedings of the Combinatorial Image Analysis - 14th International Workshop, 2011

Encoding Centered Polyominoes by Means of a Regular Language.
Proceedings of the Developments in Language Theory - 15th International Conference, 2011

Tiling the Plane with Permutations.
Proceedings of the Discrete Geometry for Computer Imagery, 2011

2009
Lattices of local two-dimensional languages.
Theor. Comput. Sci., 2009

The 1-Color Problem and the Brylawski Model.
Proceedings of the Discrete Geometry for Computer Imagery, 2009

Solving Some Instances of the 2-Color Problem.
Proceedings of the Discrete Geometry for Computer Imagery, 2009

2008
Scanning integer matrices by means of two rectangular windows.
Theor. Comput. Sci., 2008

Reconstruction of binary matrices under fixed size neighborhood constraints.
Theor. Comput. Sci., 2008

Reconstructing words from a fixed palindromic length sequence.
Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

Reconstructing Binary Matrices with Neighborhood Constraints: An NP-hard Problem.
Proceedings of the Discrete Geometry for Computer Imagery, 2008

2007
Combinatorial aspects of L-convex polyominoes.
Eur. J. Comb., 2007

A Closed Formula for the Number of Convex Permutominoes.
Electr. J. Comb., 2007

2006
Tilings by Translation: Enumeration by a Rational Language Approach.
Electr. J. Comb., 2006

2005
An introduction to periodical discrete sets from a tomographical perspective.
Theor. Comput. Sci., 2005

Enumeration of L-convex polyominoes by rows and columns.
Theor. Comput. Sci., 2005

Reconstructing a binary matrix under timetabling constraints.
Electronic Notes in Discrete Mathematics, 2005

An efficient algorithm for reconstructing binary matrices from horizontal and vertical absorbed projections.
Electronic Notes in Discrete Mathematics, 2005

On directed-convex polyominoes in a rectangle.
Discrete Mathematics, 2005

The reconstruction of a subclass of domino tilings from two projections.
Discrete Applied Mathematics, 2005

An algorithm for the reconstruction of discrete sets from two projections in presence of absorption.
Discrete Applied Mathematics, 2005

A Tomographical Characterization of L-Convex Polyominoes.
Proceedings of the Discrete Geometry for Computer Imagery, 12th International Conference, 2005

2004
The NP-completeness of a tomographical problem on bicolored domino tilings.
Theor. Comput. Sci., 2004

On the Generation and Enumeration of some Classes of Convex Polyominoes.
Electr. J. Comb., 2004

Binary Matrices Under the Microscope: A Tomographical Problem.
Proceedings of the Combinatorial Image Analysis, 10th InternationalWorkshop, 2004

2003
Reconstruction of low degree domino tilings.
Electronic Notes in Discrete Mathematics, 2003

Reconstruction of discrete sets from two absorbed projections: an algorithm.
Electronic Notes in Discrete Mathematics, 2003

ECO Method and the Exhaustive Generation of Convex Polyominoes.
Proceedings of the Discrete Mathematics and Theoretical Computer Science, 2003

Enumeration of convex polyominoes using the ECO method.
Proceedings of the Discrete Models for Complex Systems, 2003

2002
Discrete Tomography: Reconstruction under Periodicity Constraints.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

The Reconstruction of a Bicolored Domino Tiling from Two Projections.
Proceedings of the Discrete Geometry for Computer Imagery, 10th International Conference, 2002


  Loading...