Andrea Frosini

Inf., February, 2024

A study on the predictive strength of fractal dimension of white and grey matter on MRI images in Alzheimer's disease.

[BibT_eX]

[DOI]

Azzurra di Palma

Ann. Math. Artif. Intell., January, 2024

2023

Structure and Complexity of 2-Intersection Graphs of 3-Hypergraphs.

[BibT_eX]

[DOI]

William Lawrence Kocay

Elisa Pergola

Lama Tarsissi

Algorithmica, March, 2023

Minimum Surgical Probing with Convexity Constraints.

[BibT_eX]

[DOI]

Toni Böhnlein

Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

On Min-Max Graph Balancing with Strict Negative Correlation Constraints.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Algorithms and Computation, 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

Setting the Path to the Combinatorial Characterization of Prime Double Square Polyominoes.

[BibT_eX]

[DOI]

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

2022

On the Reconstruction of 3-Uniform Hypergraphs from Degree Sequences of Span-Two.

[BibT_eX]

[DOI]

Giulia Palma

J. Math. Imaging Vis., 2022

Characterization of hv-Convex Sequences.

[BibT_eX]

[DOI]

J. Math. Imaging Vis., 2022

Further steps on the reconstruction of convex polyominoes from orthogonal projections.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

Tomography and Applications.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2022

The Generalized Microscopic Image Reconstruction Problem for Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Image Analysis - 21st International Workshop, 2022

Characterization and Reconstruction of Hypergraphic Pattern Sequences.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Image Analysis - 21st International Workshop, 2022

Logarithmic Equal-Letter Runs for BWT of Purely Morphic Words.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 26th International Conference, 2022

Properties of SAT Formulas Characterizing Convex Sets with Given Projections.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry and Mathematical Morphology, 2022

On the Decomposability of Homogeneous Binary Planar Configurations with Respect to a Given Exact Polyomino.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry and Mathematical Morphology, 2022

Burrows-Wheeler Transform on Purely Morphic Words.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2022

2021

New sufficient conditions on the degree sequences of uniform hypergraphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

On doubly symmetric Dyck words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

On null 3-hypergraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

A Study on the Existence of Null Labelling for 3-Hypergraphs.

[BibT_eX]

[DOI]

William Lawrence Kocay

Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

On the Reconstruction of 3-Uniform Hypergraphs from Step-Two Degree Sequences.

[BibT_eX]

[DOI]

Giulia Palma

Proceedings of the Discrete Geometry and Mathematical Morphology, 2021

On Some Geometric Aspects of the Class of hv-Convex Switching Components.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry and Mathematical Morphology, 2021

Properties of Unique Degree Sequences of 3-Uniform Hypergraphs.

[BibT_eX]

[DOI]

William Lawrence Kocay

Lama Tarsissi

Proceedings of the Discrete Geometry and Mathematical Morphology, 2021

2020

Ambiguous reconstructions of hv-convex polyominoes.

[BibT_eX]

[DOI]

Discret. Math., 2020

The Characterization of Rational Numbers Belonging to a Minimal Path in the Stern-Brocot Tree According to a Second Order Balancedness.

[BibT_eX]

[DOI]

Lama Tarsissi

Proceedings of the Developments in Language Theory - 24th International Conference, 2020

Combinatorial Properties of Degree Sequences of 3-Uniform Hypergraphs Arising from Saind Arrays.

[BibT_eX]

[DOI]

Giulia Palma

Proceedings of the Beyond the Horizon of Computability, 2020

2019

Tomographic reconstruction of 2-convex polyominoes using dual Horn clauses.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Burrows-Wheeler Transform of Words Defined by Morphisms.

[BibT_eX]

[DOI]

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

On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2018

Preface.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2018

2017

Permutation classes and polyomino classes with excluded submatrices.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2017

Regions of Uniqueness Quickly Reconstructed by Three Directions in Discrete Tomography.

[BibT_eX]

[DOI]

Silvia M. C. Pagani

Fundam. Informaticae, 2017

Preface.

[BibT_eX]

[DOI]

Grzegorz Rozenberg

Fundam. Informaticae, 2017

Ambiguity Results in the Characterization of hv-convex Polyominoes from Projections.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 2017

First Steps in the Algorithmic Reconstruction of Digital Convex Sets.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 11th International Conference, 2017

2016

Advances in Discrete Geometry for Computer Imagery: Preface.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Geometric properties of matrices induced by pattern avoidance.

[BibT_eX]

[DOI]

Veronica Guerrini

Theor. Comput. Sci., 2016

Reconstructing binary matrices with timetabling constraints.

[BibT_eX]

[DOI]

Srecko Brlek

J. Discrete Algorithms, 2016

Geometrical Characterization of the Uniqueness Regions Under Special Sets of Three Directions in Discrete Tomography.

[BibT_eX]

[DOI]

Silvia M. C. Pagani

Proceedings of the Discrete Geometry for Computer Imagery, 2016

A Tomographical Interpretation of a Sufficient Condition on h-Graphical Sequences.

[BibT_eX]

[DOI]

Srecko Brlek

Proceedings of the Discrete Geometry for Computer Imagery, 2016

2015

The Identity Transform of a Permutation and its Applications.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2015

2014

Uniqueness Regions under Sets of Generic Projections in Discrete Tomography.

[BibT_eX]

[DOI]

Silvia M. C. Pagani

Proceedings of the Discrete Geometry for Computer Imagery, 2014

Binary Pictures with Excluded Patterns.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 2014

2013

Enumeration of 4-stack polyominoes.

[BibT_eX]

[DOI]

Jean-Marc Fedou

Theor. Comput. Sci., 2013

A tiling system for the class of <i>L</i>-convex polyominoes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

On the shape of permutomino tiles.

[BibT_eX]

[DOI]

Alexandre Blondin Massé

Discret. Appl. Math., 2013

A decomposition theorem for homogeneous sets with respect to diamond probes.

[BibT_eX]

[DOI]

Daniela Battaglino

Comput. Vis. Image Underst., 2013

On the Degree Sequences of Uniform Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 2013

How to Decompose a Binary Matrix into Three hv-convex Polyominoes.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 2013

2011

A reconstruction algorithm for a subclass of instances of the 2-color problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Planar Configurations Induced by Exact Polyominoes.

[BibT_eX]

[DOI]

Daniela Battaglino

Proceedings of the Combinatorial Image Analysis - 14th International Workshop, 2011

Solving the Two Color Problem: An Heuristic Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Image Analysis - 14th International Workshop, 2011

Encoding Centered Polyominoes by Means of a Regular Language.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 15th International Conference, 2011

Tiling the Plane with Permutations.

[BibT_eX]

[DOI]

Alexandre Blondin Massé

Proceedings of the Discrete Geometry for Computer Imagery, 2011

2009

Lattices of local two-dimensional languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

The 1-Color Problem and the Brylawski Model.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 2009

Solving Some Instances of the 2-Color Problem.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 2009

2008

Scanning integer matrices by means of two rectangular windows.

[BibT_eX]

[DOI]

Maurice Nivat

Theor. Comput. Sci., 2008

Reconstruction of binary matrices under fixed size neighborhood constraints.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Reconstructing words from a fixed palindromic length sequence.

[BibT_eX]

[DOI]

Alexandre Blondin Massé

Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

Reconstructing Binary Matrices with Neighborhood Constraints: An NP-hard Problem.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 2008

2007

Binary matrices under the microscope: A tomographical problem.

[BibT_eX]

[DOI]

Maurice Nivat

Theor. Comput. Sci., 2007

Combinatorial aspects of L-convex polyominoes.

[BibT_eX]

[DOI]

Eur. J. Comb., 2007

A Closed Formula for the Number of Convex Permutominoes.

[BibT_eX]

[DOI]

Electron. J. Comb., 2007

2006

Tilings by Translation: Enumeration by a Rational Language Approach.

[BibT_eX]

[DOI]

Electron. J. Comb., 2006

2005

An introduction to periodical discrete sets from a tomographical perspective.

[BibT_eX]

[DOI]

Maurice Nivat

Theor. Comput. Sci., 2005

Enumeration of L-convex polyominoes by rows and columns.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Reconstructing a binary matrix under timetabling constraints.

[BibT_eX]

[DOI]

Sara Brunetti

Electron. Notes Discret. Math., 2005

An efficient algorithm for reconstructing binary matrices from horizontal and vertical absorbed projections.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

On directed-convex polyominoes in a rectangle.

[BibT_eX]

[DOI]

Discret. Math., 2005

The reconstruction of a subclass of domino tilings from two projections.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

An algorithm for the reconstruction of discrete sets from two projections in presence of absorption.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

A Tomographical Characterization of L-Convex Polyominoes.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 12th International Conference, 2005

2004

The NP-completeness of a tomographical problem on bicolored domino tilings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

On the Generation and Enumeration of some Classes of Convex Polyominoes.

[BibT_eX]

[DOI]

Electron. J. Comb., 2004

2003

Reconstruction of low degree domino tilings.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2003

Reconstruction of discrete sets from two absorbed projections: an algorithm.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2003

ECO Method and the Exhaustive Generation of Convex Polyominoes.

[BibT_eX]

[DOI]

Alberto Del Lungo

Proceedings of the Discrete Mathematics and Theoretical Computer Science, 2003

Enumeration of convex polyominoes using the ECO method.

[BibT_eX]

[DOI]

Proceedings of the Discrete Models for Complex Systems, 2003

2002

Discrete Tomography: Reconstruction under Periodicity Constraints.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

The Reconstruction of a Bicolored Domino Tiling from Two Projections.

[BibT_eX]

[DOI]