---
res:
  bibo_abstract:
  - 'Inside a two-dimensional region (``cake""), there are m nonoverlapping
    tiles of a certain kind (``toppings""). We want to expand the toppings
    while keeping them nonoverlapping, and possibly add some blank pieces of the same
    ``certain kind,"" such that the entire cake is covered. How many blanks
    must we add? We study this question in several cases: (1) The cake and toppings
    are general polygons. (2) The cake and toppings are convex figures. (3) The cake
    and toppings are axis-parallel rectangles. (4) The cake is an axis-parallel rectilinear
    polygon and the toppings are axis-parallel rectangles. In all four cases, we provide
    tight bounds on the number of blanks.@eng'
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Arseniy
      foaf_name: Akopyan, Arseniy
      foaf_surname: Akopyan
      foaf_workInfoHomepage: http://www.librecat.org/personId=430D2C90-F248-11E8-B48F-1D18A9856A87
    orcid: 0000-0002-2548-617X
  - foaf_Person:
      foaf_givenName: Erel
      foaf_name: Segal Halevi, Erel
      foaf_surname: Segal Halevi
  bibo_doi: 10.1137/16M110407X
  bibo_issue: '3'
  bibo_volume: 32
  dct_date: 2018^xs_gYear
  dct_identifier:
  - UT:000450810500036
  dct_language: eng
  dct_publisher: Society for Industrial and Applied Mathematics@
  dct_title: Counting blanks in polygonal arrangements@
...