The following pages link to Andrea Frosini (Q265053):
Displaying 50 items.
- (Q180275) (redirect page) (← links)
- Geometric properties of matrices induced by pattern avoidance (Q265055) (← links)
- Reconstructing binary matrices with timetabling constraints (Q350725) (← links)
- On the shape of permutomino tiles (Q387869) (← links)
- Enumeration of 4-stack polyominoes (Q391403) (← links)
- The NP-completeness of a tomographical problem on bicolored domino tilings (Q596077) (← links)
- A reconstruction algorithm for a subclass of instances of the 2-color problem (Q638558) (← links)
- On the tiling system recognizability of various classes of convex polyominoes (Q659791) (← links)
- Ambiguous reconstructions of hv-convex polyominoes (Q785796) (← links)
- Tilings by translation: enumeration by a rational language approach (Q815209) (← links)
- New sufficient conditions on the degree sequences of uniform hypergraphs (Q831139) (← links)
- Binary matrices under the microscope: A tomographical problem (Q868951) (← links)
- Reconstruction of binary matrices under fixed size neighborhood constraints (Q952456) (← links)
- Scanning integer matrices by means of two rectangular windows (Q952464) (← links)
- A closed formula for the number of convex permutominoes (Q1010614) (← links)
- The combinatorics of convex permutominoes (Q1034386) (← links)
- First steps in the algorithmic reconstruction of digital convex sets (Q1678351) (← links)
- Ambiguity results in the characterization of \(hv\)-convex polyominoes from projections (Q1690387) (← links)
- On the generation and enumeration of some classes of convex polyominoes (Q1883680) (← links)
- A tiling system for the class of \(L\)-convex polyominoes (Q1939281) (← links)
- On null 3-hypergraphs (Q1983115) (← links)
- On some geometric aspects of the class of \(hv\)-convex switching components (Q2061811) (← links)
- Properties of unique degree sequences of 3-uniform hypergraphs (Q2061813) (← links)
- On the reconstruction of 3-uniform hypergraphs from step-two degree sequences (Q2061815) (← links)
- Further steps on the reconstruction of convex polyominoes from orthogonal projections (Q2084620) (← links)
- Combinatorial properties of degree sequences of 3-uniform hypergraphs arising from Saind arrays (Q2106608) (← links)
- A study on the existence of null labelling for 3-hypergraphs (Q2115865) (← links)
- Logarithmic equal-letter runs for BWT of purely morphic words (Q2163991) (← links)
- Burrows-Wheeler transform of words defined by morphisms (Q2301759) (← links)
- Combinatorial aspects of \(L\)-convex polyominoes (Q2372433) (← links)
- Tomographic reconstruction of 2-convex polyominoes using dual Horn clauses (Q2422035) (← links)
- On directed-convex polyominoes in a rectangle (Q2566276) (← links)
- An algorithm for the reconstruction of discrete sets from two projections in presence of absorption (Q2573236) (← links)
- The reconstruction of a subclass of domino tilings from two projections (Q2573244) (← links)
- Enumeration of L-convex polyominoes by rows and columns (Q2576881) (← links)
- An introduction to periodical discrete sets from a tomographical perspective (Q2576883) (← links)
- On doubly symmetric Dyck words (Q2664949) (← links)
- On the reconstruction of 3-uniform hypergraphs from degree sequences of span-two (Q2678917) (← links)
- Characterization of hv-convex sequences (Q2678923) (← links)
- Structure and complexity of 2-intersection graphs of 3-hypergraphs (Q2689256) (← links)
- (Q2755045) (← links)
- (Q2755046) (← links)
- (Q2915587) (← links)
- Permutation classes and polyomino classes with excluded submatrices (Q2971061) (← links)
- Tiling the Plane with Permutations (Q3000719) (← links)
- Planar Configurations Induced by Exact Polyominoes (Q3003542) (← links)
- Solving the Two Color Problem: An Heuristic Algorithm (Q3003544) (← links)
- (Q3004880) (← links)
- (Q3077258) (← links)
- (Q3077323) (← links)
