Gil Ben-Shachar

According to our database, Gil Ben-Shachar authored at least 9 papers between 2018 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Counting Polyominoes, Revisited.

Gill Barequet, Gil Ben-Shachar

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2024

2023

Algorithms for Counting Minimum-Perimeter Lattice Animals.

Gill Barequet, Gil Ben-Shachar

Algorithmica, 2023

2022

Minimal-Perimeter Lattice Animals and the Constant-Isomer Conjecture.

Gill Barequet, Gil Ben-Shachar

CoRR, 2022

Minimum-Perimeter Lattice Animals and the Constant-Isomer Conjecture.

Gill Barequet, Gil Ben-Shachar

Electron. J. Comb., 2022

2021

Concatenation arguments and their applications to polyominoes and polycubes.

Gill Barequet, Gil Ben-Shachar, Martha C. Osegueda

Comput. Geom., 2021

2020

On Minimal-Perimeter Lattice Animals.

Gill Barequet, Gil Ben-Shachar

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

2019

Properties of Minimal-Perimeter Polyominoes (Multimedia Exposition).

Gill Barequet, Gil Ben-Shachar

Proceedings of the 35th International Symposium on Computational Geometry, 2019

Minimal-Perimeter Polyominoes: Chains, Roots, and Algorithms.

Gill Barequet, Gil Ben-Shachar

Proceedings of the Algorithms and Discrete Applied Mathematics, 2019

2018

Properties of Minimal-Perimeter Polyominoes.

Gill Barequet, Gil Ben-Shachar

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018