{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:15:38Z","timestamp":1759637738179,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>In this paper we present an algorithm which has as input a convex polyomino $P$ and computes its degree of convexity, defined as the smallest integer $k$ such that any\u00a0two cells of $P$ can be joined by a monotone path inside $P$ with at most $k$ changes\u00a0of direction. The algorithm uses space $O(m + n)$ to represent a polyomino $P$ with $n$ rows and $m$ columns, and has a running time $O(min(m; r k))$, where $r$ is the\u00a0number of corners of $P$. Moreover, the algorithm leads naturally to a decomposition\u00a0of $P$ into simpler polyominoes.<\/jats:p>","DOI":"10.37236\/3678","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T00:33:30Z","timestamp":1578702810000},"source":"Crossref","is-referenced-by-count":2,"title":["On Computing the Degree of Convexity of Polyominoes"],"prefix":"10.37236","volume":"22","author":[{"given":"Stefano","family":"Brocchi","sequence":"first","affiliation":[]},{"given":"Giuseppa","family":"Castiglione","sequence":"additional","affiliation":[]},{"given":"Paolo","family":"Massazza","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2015,1,9]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v22i1p7\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v22i1p7\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T10:38:58Z","timestamp":1579257538000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v22i1p7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,9]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2015,1,2]]}},"URL":"https:\/\/doi.org\/10.37236\/3678","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2015,1,9]]},"article-number":"P1.7"}}