The following pages link to Stefano Brocchi (Q265060):
Displayed 19 items.
- Reconstruction of convex polyominoes with a blocking component (Q265062) (← links)
- Reconstructing binary matrices with timetabling constraints (Q350725) (← links)
- On computing the degree of convexity of polyominoes (Q490307) (← links)
- On the exhaustive generation of \(k\)-convex polyominoes (Q517034) (← links)
- Item:Q265060 (redirect page) (← links)
- A reconstruction algorithm for a subclass of instances of the 2-color problem (Q638558) (← links)
- Reconstruction of binary matrices under fixed size neighborhood constraints (Q952456) (← links)
- A tiling system for the class of \(L\)-convex polyominoes (Q1939281) (← links)
- Solving Multicolor Discrete Tomography Problems by Using Prior Knowledge (Q2844604) (← links)
- (Q2915587) (← links)
- A New Sandpile Model with Smoothness Assumptions (Q2968524) (← links)
- Solving the Two Color Problem: An Heuristic Algorithm (Q3003544) (← links)
- BCIF: Another Algorithm for Lossless True Color Image Compression (Q3003552) (← links)
- Discrete Tomography Reconstruction Algorithms for Images with a Blocking Component (Q3190084) (← links)
- Solving Some Instances of the 2-Color Problem (Q3648811) (← links)
- The 1-Color Problem and the Brylawski Model (Q3648813) (← links)
- PCIF: An Algorithm for Lossless True Color Image Compression (Q3651617) (← links)
- Smooth Sand Piles (Q4899144) (← links)
- A New Approach for the Reconstruction of Object-Based Images in Discrete Tomography (Q5259284) (← links)