EDBT 2026 Demo / reviewers in the wild / expert

Gil Ben-Shachar

dblp:222/0317 · DBLP profile ↗
← Back
7ranked-venue papers
0as first author
4since 2021 · last 2026
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 6 · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021
YearPublicationVenuePosition
2026 Counting Polyominoes, Revisited
abstract
A polyomino is an edge-connected set of squares on the square lattice. In this paper, we improve the Conway-Jensen polyomino-counting algorithm by considering bounding boxes on the square lattice rotated by $$45^\circ $$ instead of on the regular unrotated lattice. This allows us to extend significantly the count of polyominoes from 56 to 70 terms.
Gill Barequet, Gil Ben-Shachar
 Algorithmica2
2024 Counting Polyominoes, Revisited
Gill Barequet, Gil Ben-Shachar
 ALENEX2
2023 Algorithms for Counting Minimum-Perimeter Lattice Animals
Gill Barequet, Gil Ben-Shachar
 Algorithmica2
2021 Concatenation arguments and their applications to polyominoes and polycubes
Gill Barequet, Gil Ben-Shachar, Martha C. Osegueda
 Comput. Geom.2
2020 On Minimal-Perimeter Lattice Animals
Gill Barequet, Gil Ben-Shachar
 LATIN2
2019 Properties of Minimal-Perimeter Polyominoes (Multimedia Exposition)
abstract
In this video, we survey some results concerning polyominoes, which are sets of connected cells on the square lattice, and specifically, minimal-perimeter polyominoes, that are polyominoes with the minimal-perimeter from all polyominoes of the same size.
Gill Barequet, Gil Ben-Shachar
 SoCG2
2018 Properties of Minimal-Perimeter Polyominoes
Gill Barequet, Gil Ben-Shachar
 COCOON2