Publication | Date of Publication | Type |
---|
Proving a conjecture on prime double square tiles | 2024-04-10 | Paper |
\textsc{Minimum Surgical Probing} with convexity constraints | 2023-12-22 | Paper |
Characterization and reconstruction of hypergraphic pattern sequences | 2023-08-03 | Paper |
The generalized microscopic image reconstruction problem for hypergraphs | 2023-08-03 | Paper |
On the decomposability of homogeneous binary planar configurations with respect to a given exact polyomino | 2023-06-02 | Paper |
Properties of SAT formulas characterizing convex sets with given projections | 2023-06-02 | Paper |
The Complexity of 2-Intersection Graphs of 3-Hypergraphs Recognition for Claw-free Graphs and triangulated Claw-free Graphs | 2023-05-23 | Paper |
Structure and complexity of 2-intersection graphs of 3-hypergraphs | 2023-03-09 | Paper |
On the reconstruction of 3-uniform hypergraphs from degree sequences of span-two | 2023-01-25 | Paper |
Characterization of hv-convex sequences | 2023-01-25 | Paper |
Combinatorial properties of degree sequences of 3-uniform hypergraphs arising from Saind arrays | 2022-12-16 | Paper |
Further steps on the reconstruction of convex polyominoes from orthogonal projections | 2022-10-18 | Paper |
The Characterization of Rational Numbers Belonging to a Minimal Path in the Stern-Brocot Tree According to a Second Order Balancedness | 2022-10-13 | Paper |
Logarithmic equal-letter runs for BWT of purely morphic words | 2022-08-11 | Paper |
A study on the existence of null labelling for 3-hypergraphs | 2022-03-22 | Paper |
On some geometric aspects of the class of \(hv\)-convex switching components | 2021-12-21 | Paper |
Properties of unique degree sequences of 3-uniform hypergraphs | 2021-12-21 | Paper |
On the reconstruction of 3-uniform hypergraphs from step-two degree sequences | 2021-12-21 | Paper |
On doubly symmetric Dyck words | 2021-11-18 | Paper |
On null 3-hypergraphs | 2021-09-15 | Paper |
New sufficient conditions on the degree sequences of uniform hypergraphs | 2021-05-10 | Paper |
Ambiguous reconstructions of hv-convex polyominoes | 2020-08-12 | Paper |
Burrows-Wheeler transform of words defined by morphisms | 2020-02-25 | Paper |
A study on the fixed points of the $\gamma$ function | 2019-11-12 | Paper |
On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition | 2019-10-16 | Paper |
Tomographic reconstruction of 2-convex polyominoes using dual Horn clauses | 2019-06-18 | Paper |
Ambiguity results in the characterization of \(hv\)-convex polyominoes from projections | 2018-01-19 | Paper |
Regions of Uniqueness Quickly Reconstructed by Three Directions in Discrete Tomography | 2018-01-05 | Paper |
First steps in the algorithmic reconstruction of digital convex sets | 2017-11-15 | Paper |
Permutation classes and polyomino classes with excluded submatrices | 2017-04-04 | Paper |
Reconstructing binary matrices with timetabling constraints | 2016-12-09 | Paper |
The Identity Transform of a Permutation and its Applications | 2016-08-15 | Paper |
A Tomographical Interpretation of a Sufficient Condition on h-Graphical Sequences | 2016-07-15 | Paper |
Geometrical Characterization of the Uniqueness Regions Under Special Sets of Three Directions in Discrete Tomography | 2016-07-15 | Paper |
Geometric properties of matrices induced by pattern avoidance | 2016-04-01 | Paper |
A geometrical characterization of regions of uniqueness and applications to discrete tomography | 2016-01-15 | Paper |
Binary Pictures with Excluded Patterns | 2014-09-15 | Paper |
Uniqueness Regions under Sets of Generic Projections in Discrete Tomography | 2014-09-15 | Paper |
Enumeration of 4-stack polyominoes | 2014-01-10 | Paper |
On the shape of permutomino tiles | 2013-12-17 | Paper |
Characterization of the degree sequences of (quasi) regular uniform hypergraphs | 2013-09-30 | Paper |
On the Degree Sequences of Uniform Hypergraphs | 2013-05-31 | Paper |
How to Decompose a Binary Matrix into Three hv-convex Polyominoes | 2013-05-31 | Paper |
https://portal.mardi4nfdi.de/entity/Q4917715 | 2013-05-02 | Paper |
A tiling system for the class of \(L\)-convex polyominoes | 2013-03-04 | Paper |
https://portal.mardi4nfdi.de/entity/Q2915587 | 2012-09-18 | Paper |
On the tiling system recognizability of various classes of convex polyominoes | 2012-01-24 | Paper |
A reconstruction algorithm for a subclass of instances of the 2-color problem | 2011-09-12 | Paper |
Encoding Centered Polyominoes by Means of a Regular Language | 2011-07-29 | Paper |
https://portal.mardi4nfdi.de/entity/Q3004880 | 2011-06-06 | Paper |
Planar Configurations Induced by Exact Polyominoes | 2011-05-27 | Paper |
Solving the Two Color Problem: An Heuristic Algorithm | 2011-05-27 | Paper |
Tiling the Plane with Permutations | 2011-05-19 | Paper |
https://portal.mardi4nfdi.de/entity/Q3077258 | 2011-02-22 | Paper |
https://portal.mardi4nfdi.de/entity/Q3077323 | 2011-02-22 | Paper |
https://portal.mardi4nfdi.de/entity/Q3077324 | 2011-02-22 | Paper |
https://portal.mardi4nfdi.de/entity/Q3077346 | 2011-02-22 | Paper |
https://portal.mardi4nfdi.de/entity/Q3575010 | 2010-07-05 | Paper |
Solving Some Instances of the 2-Color Problem | 2009-12-01 | Paper |
The 1-Color Problem and the Brylawski Model | 2009-12-01 | Paper |
The combinatorics of convex permutominoes | 2009-11-11 | Paper |
A closed formula for the number of convex permutominoes | 2009-04-07 | Paper |
Reconstruction of binary matrices under fixed size neighborhood constraints | 2008-11-12 | Paper |
Scanning integer matrices by means of two rectangular windows | 2008-11-12 | Paper |
Reconstructing Binary Matrices with Neighborhood Constraints: An NP-hard Problem | 2008-04-24 | Paper |
https://portal.mardi4nfdi.de/entity/Q5434302 | 2008-01-04 | Paper |
https://portal.mardi4nfdi.de/entity/Q5434310 | 2008-01-04 | Paper |
Combinatorial aspects of \(L\)-convex polyominoes | 2007-07-27 | Paper |
Reconstruction of low degree domino tilings | 2007-05-29 | Paper |
Reconstruction of discrete sets from two absorbed projections: an algorithm | 2007-05-29 | Paper |
Reconstructing a binary matrix under timetabling constraints | 2007-05-29 | Paper |
An efficient algorithm for reconstructing binary matrices from horizontal and vertical absorbed projections | 2007-05-29 | Paper |
https://portal.mardi4nfdi.de/entity/Q3428799 | 2007-03-29 | Paper |
Binary matrices under the microscope: A tomographical problem | 2007-02-26 | Paper |
https://portal.mardi4nfdi.de/entity/Q5395445 | 2006-10-30 | Paper |
Tilings by translation: enumeration by a rational language approach | 2006-02-16 | Paper |
Enumeration of L-convex polyominoes by rows and columns | 2005-12-29 | Paper |
An introduction to periodical discrete sets from a tomographical perspective | 2005-12-29 | Paper |
An algorithm for the reconstruction of discrete sets from two projections in presence of absorption | 2005-11-07 | Paper |
The reconstruction of a subclass of domino tilings from two projections | 2005-11-07 | Paper |
On directed-convex polyominoes in a rectangle | 2005-09-22 | Paper |
Discrete Geometry for Computer Imagery | 2005-09-13 | Paper |
Combinatorial Image Analysis | 2005-08-12 | Paper |
https://portal.mardi4nfdi.de/entity/Q4672865 | 2005-04-28 | Paper |
On the generation and enumeration of some classes of convex polyominoes | 2004-10-13 | Paper |
https://portal.mardi4nfdi.de/entity/Q4737143 | 2004-08-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q4738254 | 2004-08-11 | Paper |
The NP-completeness of a tomographical problem on bicolored domino tilings | 2004-08-10 | Paper |
https://portal.mardi4nfdi.de/entity/Q4451020 | 2004-02-22 | Paper |
https://portal.mardi4nfdi.de/entity/Q4452096 | 2004-02-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q4483947 | 2003-05-27 | Paper |
A technology for reverse-engineering a combinatorial problem from a rational generating function | 2002-05-07 | Paper |
https://portal.mardi4nfdi.de/entity/Q2755045 | 2001-11-05 | Paper |
https://portal.mardi4nfdi.de/entity/Q2755046 | 2001-11-05 | Paper |
https://portal.mardi4nfdi.de/entity/Q4502584 | 2001-01-04 | Paper |
https://portal.mardi4nfdi.de/entity/Q4938145 | 2000-02-21 | Paper |