{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T00:25:17Z","timestamp":1760487917441,"version":"build-2065373602"},"reference-count":62,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2023,3,9]],"date-time":"2023-03-09T00:00:00Z","timestamp":1678320000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001352","name":"National University of Singapore","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001352","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001459","name":"Ministry of Education - Singapore","doi-asserted-by":"publisher","award":["MOE-T2EP20221-0001"],"award-info":[{"award-number":["MOE-T2EP20221-0001"]}],"id":[{"id":"10.13039\/501100001459","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["712\/20"],"award-info":[{"award-number":["712\/20"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010663","name":"European Research Council","doi-asserted-by":"publisher","award":["639945"],"award-info":[{"award-number":["639945"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1016\/j.comgeo.2023.102006","type":"journal-article","created":{"date-parts":[[2023,3,13]],"date-time":"2023-03-13T21:55:44Z","timestamp":1678744544000},"page":"102006","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Keep your distance: Land division with separation"],"prefix":"10.1016","volume":"113","author":[{"given":"Edith","family":"Elkind","sequence":"first","affiliation":[]},{"given":"Erel","family":"Segal-Halevi","sequence":"additional","affiliation":[]},{"given":"Warut","family":"Suksompong","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.comgeo.2023.102006_br0010","series-title":"Proceedings of the 18th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)","first-page":"1","article-title":"On guillotine cutting sequences","author":"Abed","year":"2015"},{"issue":"4","key":"10.1016\/j.comgeo.2023.102006_br0020","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/j.ipl.2006.01.011","article-title":"The number of guillotine partitions in d dimensions","volume":"98","author":"Ackerman","year":"2006","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.comgeo.2023.102006_br0030","series-title":"Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS)","first-page":"400","article-title":"Approximation schemes for maximum weight independent set of rectangles","author":"Adamaszek","year":"2013"},{"issue":"4","key":"10.1016\/j.comgeo.2023.102006_br0040","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0925-7721(95)00005-8","article-title":"Computing depth orders for fat objects and related problems","volume":"5","author":"Agarwal","year":"1995","journal-title":"Comput. Geom."},{"issue":"3\u20134","key":"10.1016\/j.comgeo.2023.102006_br0050","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0925-7721(98)00028-5","article-title":"Label placement by maximum independent set in rectangles","volume":"11","author":"Agarwal","year":"1998","journal-title":"Comput. Geom."},{"author":"Aharoni","key":"10.1016\/j.comgeo.2023.102006_br0060"},{"key":"10.1016\/j.comgeo.2023.102006_br0070","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/j.tcs.2015.08.003","article-title":"Algorithms for fair partitioning of convex polygons","volume":"607","author":"Bogdan","year":"2015","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.comgeo.2023.102006_br0080","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/j.disc.2014.05.014","article-title":"Cut equivalence of d-dimensional guillotine partitions","volume":"331","author":"Asinowski","year":"2014","journal-title":"Discrete Math."},{"key":"10.1016\/j.comgeo.2023.102006_br0090","series-title":"Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI)","first-page":"5159","article-title":"Dividing a graphical cake","author":"Bei","year":"2021"},{"issue":"2","key":"10.1016\/j.comgeo.2023.102006_br0100","doi-asserted-by":"crossref","first-page":"1156","DOI":"10.1137\/20M1388310","article-title":"The price of connectivity in fair division","volume":"36","author":"Bei","year":"2022","journal-title":"SIAM J. Discrete Math."},{"issue":"5","key":"10.1016\/j.comgeo.2023.102006_br0110","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1016\/S0304-4068(03)00077-6","article-title":"A foundation of location theory: existence of equilibrium, the welfare theorems, and core","volume":"40","author":"Berliant","year":"2004","journal-title":"J. Math. Econ."},{"issue":"3","key":"10.1016\/j.comgeo.2023.102006_br0120","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0304-4068(92)90001-N","article-title":"On the fair division of a heterogeneous commodity","volume":"21","author":"Berliant","year":"1992","journal-title":"J. Math. Econ."},{"key":"10.1016\/j.comgeo.2023.102006_br0130","series-title":"Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI)","first-page":"91","article-title":"Fair division under cardinality constraints","author":"Biswas","year":"2018"},{"issue":"1","key":"10.1016\/j.comgeo.2023.102006_br0140","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s11856-014-1006-6","article-title":"Convex equipartitions via equivariant obstruction theory","volume":"200","author":"Blagojevi\u0107","year":"2014","journal-title":"Isr. J. Math."},{"key":"10.1016\/j.comgeo.2023.102006_br0150","series-title":"Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI)","first-page":"135","article-title":"Fair division of a graph","author":"Bouveret","year":"2017"},{"issue":"6","key":"10.1016\/j.comgeo.2023.102006_br0160","doi-asserted-by":"crossref","first-page":"1061","DOI":"10.1086\/664613","article-title":"The combinatorial assignment problem: approximate competitive equilibrium from equal incomes","volume":"119","author":"Budish","year":"2011","journal-title":"J. Polit. Econ."},{"issue":"3","key":"10.1016\/j.comgeo.2023.102006_br0170","doi-asserted-by":"crossref","first-page":"18:1","DOI":"10.1145\/3457166","article-title":"Weighted envy-freeness in indivisible item allocation","volume":"9","author":"Chakraborty","year":"2021","journal-title":"ACM Trans. Econ. Comput."},{"key":"10.1016\/j.comgeo.2023.102006_br0180","doi-asserted-by":"crossref","DOI":"10.1016\/j.artint.2021.103578","article-title":"Picking sequences and monotonicity in weighted fair division","volume":"301","author":"Chakraborty","year":"2021","journal-title":"Artif. Intell."},{"key":"10.1016\/j.comgeo.2023.102006_br0190","series-title":"Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI)","first-page":"4949","article-title":"Weighted fairness notions for indivisible items revisited","author":"Chakraborty","year":"2022"},{"key":"10.1016\/j.comgeo.2023.102006_br0200","series-title":"Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","first-page":"892","article-title":"Maximum independent set of rectangles","author":"Chalermsook","year":"2009"},{"key":"10.1016\/j.comgeo.2023.102006_br0210","series-title":"Proceedings of the 32nd ACM-SIAM Symposium on Discrete Algorithms (SODA)","first-page":"860","article-title":"Coloring and maximum weight independent set of rectangles","author":"Chalermsook","year":"2021"},{"issue":"1","key":"10.1016\/j.comgeo.2023.102006_br0220","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.ipl.2003.09.019","article-title":"A note on maximum independent sets in rectangle intersection graphs","volume":"89","author":"Chan","year":"2004","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"10.1016\/j.comgeo.2023.102006_br0230","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0377-2217(93)E0277-5","article-title":"An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts","volume":"83","author":"Christofides","year":"1995","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.comgeo.2023.102006_br0240","series-title":"Proceedings of the 57th Annual Symposium on Foundations of Computer Science (FOCS)","first-page":"820","article-title":"On approximating maximum independent set of rectangles","author":"Chuzhoy","year":"2016"},{"year":"2009","series-title":"Introduction to Algorithms","author":"Cormen","key":"10.1016\/j.comgeo.2023.102006_br0250"},{"issue":"3","key":"10.1016\/j.comgeo.2023.102006_br0260","doi-asserted-by":"crossref","first-page":"29:1","DOI":"10.1145\/3380742","article-title":"The complexity of cake cutting with unequal shares","volume":"16","author":"Cseh","year":"2020","journal-title":"ACM Trans. Algorithms"},{"issue":"1","key":"10.1016\/j.comgeo.2023.102006_br0270","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.geb.2008.04.006","article-title":"Disputed lands","volume":"66","author":"Dall'Aglio","year":"2009","journal-title":"Games Econ. Behav."},{"year":"2014","series-title":"Geometric partitioning algorithms for fair division of geographic resources","author":"Devulapalli","key":"10.1016\/j.comgeo.2023.102006_br0280"},{"issue":"1","key":"10.1016\/j.comgeo.2023.102006_br0290","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/2311357","article-title":"How to cut a cake fairly","volume":"68","author":"Dubins","year":"1961","journal-title":"Am. Math. Mon."},{"key":"10.1016\/j.comgeo.2023.102006_br0300","series-title":"Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI)","first-page":"161","article-title":"Graphical cake cutting via maximin share","author":"Elkind","year":"2021"},{"key":"10.1016\/j.comgeo.2023.102006_br0310","series-title":"Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI)","first-page":"168","article-title":"Keep your distance: land division with separation","author":"Elkind","year":"2021"},{"key":"10.1016\/j.comgeo.2023.102006_br0320","doi-asserted-by":"crossref","DOI":"10.1016\/j.artint.2022.103783","article-title":"Mind the gap: cake cutting with separation","volume":"313","author":"Elkind","year":"2022","journal-title":"Artif. Intell."},{"author":"Frettl\u00f6h","key":"10.1016\/j.comgeo.2023.102006_br0330"},{"key":"10.1016\/j.comgeo.2023.102006_br0340","series-title":"Proceedings of the 33rd ACM-SIAM Symposium on Discrete Algorithms (SODA)","first-page":"894","article-title":"A 3-approximation algorithm for maximum independent set of rectangles","author":"G\u00e1lvez","year":"2022"},{"issue":"1","key":"10.1016\/j.comgeo.2023.102006_br0350","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0925-7721(94)90013-2","article-title":"On optimal guillotine partitions approximating optimal d-box partitions","volume":"4","author":"Gonzalez","year":"1994","journal-title":"Comput. Geom."},{"issue":"13","key":"10.1016\/j.comgeo.2023.102006_br0360","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1016\/j.ipl.2009.03.006","article-title":"Polychromatic 4-coloring of guillotine subdivisions","volume":"109","author":"Horev","year":"2009","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"10.1016\/j.comgeo.2023.102006_br0370","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/S0304-4068(98)00053-6","article-title":"Equitable allocation of divisible goods","volume":"32","author":"Ichiishi","year":"1999","journal-title":"J. Math. Econ."},{"author":"Igarashi","key":"10.1016\/j.comgeo.2023.102006_br0380"},{"issue":"3\u20134","key":"10.1016\/j.comgeo.2023.102006_br0390","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1142\/S0218843009002051","article-title":"A procedure for the allocation of two-dimensional resources in a multiagent system","volume":"18","author":"Iyer","year":"2009","journal-title":"Int. J. Coop. Inf. Syst."},{"issue":"6","key":"10.1016\/j.comgeo.2023.102006_br0400","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/S0925-7721(96)00027-2","article-title":"3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects","volume":"8","author":"Katz","year":"1997","journal-title":"Comput. Geom."},{"key":"10.1016\/j.comgeo.2023.102006_br0410","series-title":"Handbook of Computational Geometry","first-page":"491","article-title":"Polygon decomposition","author":"Mark Keil","year":"2000"},{"key":"10.1016\/j.comgeo.2023.102006_br0420","series-title":"Proceedings of the 23rd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)","first-page":"47:1","article-title":"On guillotine separability of squares and rectangles","author":"Khan","year":"2020"},{"key":"10.1016\/j.comgeo.2023.102006_br0430","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.dam.2021.04.007","article-title":"Rainbow independent sets on dense graph classes","volume":"312","author":"Kim","year":"2022","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"10.1016\/j.comgeo.2023.102006_br0440","first-page":"8:1","article-title":"Fair enough: guaranteeing approximate maximin shares","volume":"64","author":"Kurokawa","year":"2018","journal-title":"J. ACM"},{"key":"10.1016\/j.comgeo.2023.102006_br0450","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1613\/jair.1.11702","article-title":"Maximin share allocations on cycles","volume":"69","author":"Lonc","year":"2020","journal-title":"J. Artif. Intell. Res."},{"author":"Lv","key":"10.1016\/j.comgeo.2023.102006_br0460"},{"key":"10.1016\/j.comgeo.2023.102006_br0470","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/j.dam.2022.04.016","article-title":"Rainbow independent sets in graphs with maximum degree two","volume":"317","author":"Ma","year":"2022","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/j.comgeo.2023.102006_br0480","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1016\/j.ejor.2007.08.029","article-title":"Characterization and modelling of guillotine constraints","volume":"191","author":"Messaoud","year":"2008","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.comgeo.2023.102006_br0490","series-title":"Proceedings of the 62nd Annual Symposium on Foundations of Computer Science (FOCS)","first-page":"339","article-title":"Approximating maximum independent set for rectangles in the plane","author":"Mitchell","year":"2022"},{"issue":"3","key":"10.1016\/j.comgeo.2023.102006_br0500","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s12044-012-0076-5","article-title":"Fair partitions of polygons: an elementary introduction","volume":"122","author":"Nandakumar","year":"2012","journal-title":"Proc. Math. Sci."},{"key":"10.1016\/j.comgeo.2023.102006_br0510","series-title":"Proceedings of the 16th Annual Symposium on Computational Geometry (SCG)","first-page":"360","article-title":"Cutting glass","author":"Pach","year":"2000"},{"year":"1998","series-title":"Cake-Cutting Algorithms: Be Fair if You Can","author":"Robertson","key":"10.1016\/j.comgeo.2023.102006_br0520"},{"issue":"2","key":"10.1016\/j.comgeo.2023.102006_br0530","doi-asserted-by":"crossref","first-page":"794","DOI":"10.1111\/itor.12687","article-title":"Constrained two-dimensional guillotine cutting problem: upper-bound review and categorization","volume":"27","author":"Russo","year":"2020","journal-title":"Int. Trans. Oper. Res."},{"issue":"1","key":"10.1016\/j.comgeo.2023.102006_br0540","doi-asserted-by":"crossref","DOI":"10.1016\/j.jmaa.2019.123382","article-title":"Cake-cutting with different entitlements: how many cuts are needed?","volume":"480","author":"Segal-Halevi","year":"2019","journal-title":"J. Math. Anal. Appl."},{"issue":"8","key":"10.1016\/j.comgeo.2023.102006_br0550","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jmateco.2017.01.007","article-title":"Fair and square: cake-cutting in two dimensions","volume":"70","author":"Segal-Halevi","year":"2017","journal-title":"J. Math. Econ."},{"issue":"3","key":"10.1016\/j.comgeo.2023.102006_br0560","doi-asserted-by":"crossref","first-page":"896","DOI":"10.1287\/moor.2019.1016","article-title":"Envy-free division of land","volume":"45","author":"Segal-Halevi","year":"2020","journal-title":"Math. Oper. Res."},{"issue":"2","key":"10.1016\/j.comgeo.2023.102006_br0570","first-page":"39:1","article-title":"Fair cake-cutting algorithms with real land-value data","volume":"35","author":"Shtechman","year":"2022","journal-title":"Auton. Agents Multi-Agent Syst."},{"issue":"1","key":"10.1016\/j.comgeo.2023.102006_br0580","first-page":"101","article-title":"The problem of fair division","volume":"16","author":"Steinhaus","year":"1948","journal-title":"Econometrica"},{"issue":"8","key":"10.1016\/j.comgeo.2023.102006_br0590","doi-asserted-by":"crossref","first-page":"640","DOI":"10.1080\/00029890.1980.11995109","article-title":"How to cut a cake fairly","volume":"87","author":"Stromquist","year":"1980","journal-title":"Am. Math. Mon."},{"issue":"2","key":"10.1016\/j.comgeo.2023.102006_br0600","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/3505156.3505162","article-title":"Constraints in fair division","volume":"19","author":"Suksompong","year":"2021","journal-title":"ACM SIGecom Exch."},{"key":"10.1016\/j.comgeo.2023.102006_br0610","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/j.mathsocsci.2022.03.004","article-title":"On maximum weighted Nash welfare for binary valuations","volume":"117","author":"Suksompong","year":"2022","journal-title":"Math. Soc. Sci."},{"issue":"1","key":"10.1016\/j.comgeo.2023.102006_br0620","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1145\/606603.606607","article-title":"Floorplan representations: complexity and connections","volume":"8","author":"Yao","year":"2003","journal-title":"ACM Trans. Des. Autom. Electron. Syst."}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772123000263?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772123000263?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T07:53:35Z","timestamp":1760428415000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772123000263"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8]]},"references-count":62,"alternative-id":["S0925772123000263"],"URL":"https:\/\/doi.org\/10.1016\/j.comgeo.2023.102006","relation":{},"ISSN":["0925-7721"],"issn-type":[{"type":"print","value":"0925-7721"}],"subject":[],"published":{"date-parts":[[2023,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Keep your distance: Land division with separation","name":"articletitle","label":"Article Title"},{"value":"Computational Geometry","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.comgeo.2023.102006","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2023 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"102006"}}