Counting Polyominoes, Revisited: Corrigendum and Addendum
Gill Barequet, Gil Ben-Shachar
cs.DMarXiv:2610.10632
Abstract
This is a Corrigendum and Addendum to Algorithmica paper (2026) 88:51.
Create a lesson
Related papers
Equitable Subpartitionability Does Not Characterize Box-TDI Polyhedra
Emiliano Lancini, Francesco Pisanu
Detection and Construction of Small Blocking Sets via Critical Independent Sets and Matching Decomposition
Quanlong Niu, Riheng Jia
Maximal Linear Arrangement is NP complete on Bipartite Graphs
Aparna Das, Jonathan Needleman
Perfect Italian Domination on and Near Split Graphs: Algorithms, Hardness, and Approximation
Anand Babu N B, Ashwin Jacob, Manjusha M S et al.
An upper bound of 4.268 for the random 3-SAT satisfiability threshold
Fedor Vorobyev
An Efficient Algorithm for the Quickest Path Reliability Problem
Majid Forghani-elahabad